/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-34549b5 [2022-04-08 06:00:52,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:00:52,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:00:52,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:00:52,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:00:52,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:00:52,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:00:52,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:00:52,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:00:52,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:00:52,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:00:52,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:00:52,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:00:52,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:00:52,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:00:52,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:00:52,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:00:52,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:00:52,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:00:52,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:00:52,876 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:00:52,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:00:52,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:00:52,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:00:52,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:00:52,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:00:52,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:00:52,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:00:52,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:00:52,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:00:52,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:00:52,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:00:52,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:00:52,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:00:52,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:00:52,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:00:52,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:00:52,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:00:52,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:00:52,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:00:52,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:00:52,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:00:52,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:00:52,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:00:52,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:00:52,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:00:52,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:00:52,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:00:52,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:00:52,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:00:52,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:00:52,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:00:52,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:00:52,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:00:52,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:00:52,919 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:00:53,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:00:53,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:00:53,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:00:53,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:00:53,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:00:53,264 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-08 06:00:53,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e199e8115/8e3baafd30e4403f81a0acf9d0ab0009/FLAGe36e3e58b [2022-04-08 06:00:53,917 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:00:53,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-08 06:00:53,927 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e199e8115/8e3baafd30e4403f81a0acf9d0ab0009/FLAGe36e3e58b [2022-04-08 06:00:54,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e199e8115/8e3baafd30e4403f81a0acf9d0ab0009 [2022-04-08 06:00:54,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:00:54,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:00:54,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:00:54,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:00:54,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:00:54,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3ed732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54, skipping insertion in model container [2022-04-08 06:00:54,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:00:54,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:00:54,523 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-08 06:00:54,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:00:54,589 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:00:54,602 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-08 06:00:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:00:54,639 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:00:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54 WrapperNode [2022-04-08 06:00:54,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:00:54,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:00:54,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:00:54,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:00:54,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:00:54,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:00:54,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:00:54,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:00:54,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (1/1) ... [2022-04-08 06:00:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:00:54,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:54,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:00:54,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:00:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:00:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:00:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:00:54,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:00:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:00:54,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:00:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:00:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:00:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:00:54,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:00:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:00:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:00:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:00:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:00:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:00:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:00:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:00:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:00:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:00:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:00:54,900 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:00:54,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:00:55,202 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:00:55,207 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:00:55,207 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 06:00:55,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:00:55 BoogieIcfgContainer [2022-04-08 06:00:55,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:00:55,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:00:55,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:00:55,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:00:55,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:00:54" (1/3) ... [2022-04-08 06:00:55,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d25da14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:00:55, skipping insertion in model container [2022-04-08 06:00:55,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:00:54" (2/3) ... [2022-04-08 06:00:55,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d25da14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:00:55, skipping insertion in model container [2022-04-08 06:00:55,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:00:55" (3/3) ... [2022-04-08 06:00:55,226 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-08 06:00:55,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:00:55,229 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:00:55,290 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:00:55,294 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:00:55,294 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:00:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 06:00:55,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:55,326 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:55,326 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-08 06:00:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:55,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277646186] [2022-04-08 06:00:55,359 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-08 06:00:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:55,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720174724] [2022-04-08 06:00:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:55,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:55,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:55,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129486070] [2022-04-08 06:00:55,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:55,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:55,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:55,522 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:00:55,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:00:55,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:00:55,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:55,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 06:00:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:55,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:55,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-08 06:00:55,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-08 06:00:55,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:00:55,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-08 06:00:55,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-08 06:00:55,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-08 06:00:55,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-08 06:00:55,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:00:55,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-08 06:00:55,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 06:00:55,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-08 06:00:55,846 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-08 06:00:55,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 06:00:55,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 06:00:55,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 06:00:55,850 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-08 06:00:55,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-08 06:00:55,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 06:00:55,851 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-08 06:00:55,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 06:00:55,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 06:00:55,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 06:00:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 06:00:55,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:00:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:55,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720174724] [2022-04-08 06:00:55,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:55,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129486070] [2022-04-08 06:00:55,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129486070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:55,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:00:55,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277646186] [2022-04-08 06:00:55,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277646186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:55,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:55,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:00:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34203922] [2022-04-08 06:00:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 06:00:55,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:55,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:00:55,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:55,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 06:00:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 06:00:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 06:00:55,962 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:00:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,073 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-08 06:00:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 06:00:56,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 06:00:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:00:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 06:00:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:00:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 06:00:56,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-08 06:00:56,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:56,243 INFO L225 Difference]: With dead ends: 67 [2022-04-08 06:00:56,244 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 06:00:56,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 06:00:56,249 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:56,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 06:00:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 06:00:56,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:56,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,278 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,278 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,285 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:00:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:00:56,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:56,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:56,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 06:00:56,293 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-08 06:00:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,297 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 06:00:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:00:56,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:56,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:56,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:56,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 06:00:56,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-08 06:00:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:56,305 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 06:00:56,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:00:56,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 06:00:56,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 06:00:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 06:00:56,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:56,341 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:56,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 06:00:56,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 06:00:56,579 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-08 06:00:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1638821752] [2022-04-08 06:00:56,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-08 06:00:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254533619] [2022-04-08 06:00:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:56,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756368216] [2022-04-08 06:00:56,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:56,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:00:56,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:00:56,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:00:56,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:56,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 06:00:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:56,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:56,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-08 06:00:56,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,821 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,823 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-08 06:00:56,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {370#false} is VALID [2022-04-08 06:00:56,824 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-08 06:00:56,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-08 06:00:56,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-08 06:00:56,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-08 06:00:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:56,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:00:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254533619] [2022-04-08 06:00:56,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756368216] [2022-04-08 06:00:56,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756368216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:56,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:56,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:00:56,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:56,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1638821752] [2022-04-08 06:00:56,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1638821752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:56,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:56,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:00:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112319169] [2022-04-08 06:00:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 06:00:56,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:56,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:00:56,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:56,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:00:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:56,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:00:56,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:00:56,845 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:00:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,912 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 06:00:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:00:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 06:00:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:00:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 06:00:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:00:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 06:00:56,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 06:00:56,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:56,950 INFO L225 Difference]: With dead ends: 41 [2022-04-08 06:00:56,950 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 06:00:56,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:00:56,951 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:56,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 06:00:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 06:00:56,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:56,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,961 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,961 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,963 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 06:00:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:00:56,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:56,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:56,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 06:00:56,964 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-08 06:00:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:56,965 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 06:00:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:00:56,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:56,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:56,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:56,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-08 06:00:56,968 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-08 06:00:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:56,968 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-08 06:00:56,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 06:00:56,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-08 06:00:57,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 06:00:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 06:00:57,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:57,001 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:57,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 06:00:57,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 06:00:57,218 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-08 06:00:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:57,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804334103] [2022-04-08 06:00:57,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-08 06:00:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:57,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998977201] [2022-04-08 06:00:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:57,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:57,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600602648] [2022-04-08 06:00:57,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:57,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:00:57,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:00:57,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:00:57,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:57,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:00:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:57,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:57,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-08 06:00:57,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-08 06:00:57,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:00:57,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-08 06:00:57,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-08 06:00:57,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-08 06:00:57,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-08 06:00:57,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 06:00:57,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 06:00:57,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:00:57,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-08 06:00:57,588 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-08 06:00:57,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 06:00:57,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 06:00:57,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 06:00:57,588 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-08 06:00:59,591 WARN 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 UNKNOWN [2022-04-08 06:00:59,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-08 06:00:59,594 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-08 06:01:00,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:01:00,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:00,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-08 06:01:00,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 06:01:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:00,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:01:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:00,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998977201] [2022-04-08 06:01:00,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:00,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600602648] [2022-04-08 06:01:00,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600602648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:00,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:00,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:01:00,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:00,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804334103] [2022-04-08 06:01:00,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804334103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:00,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:00,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:01:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866437733] [2022-04-08 06:01:00,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 06:01:00,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:00,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:01:02,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:02,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:01:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:01:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:01:02,926 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:01:04,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:01:07,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:01:13,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:01:20,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:01:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:20,103 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 06:01:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:01:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 06:01:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:01:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:01:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:01:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:01:20,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 06:01:22,368 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-08 06:01:22,370 INFO L225 Difference]: With dead ends: 53 [2022-04-08 06:01:22,370 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 06:01:22,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:01:22,371 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:22,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 9.5s Time] [2022-04-08 06:01:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 06:01:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 06:01:22,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:22,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:22,387 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:22,387 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,389 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:01:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:01:22,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:22,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:22,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 06:01:22,390 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-08 06:01:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,393 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:01:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:01:22,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:22,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:22,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:22,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-08 06:01:22,396 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-08 06:01:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:22,396 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-08 06:01:22,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 06:01:22,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-08 06:01:25,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 66 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-08 06:01:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 06:01:25,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:25,621 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:25,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:25,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:25,822 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-08 06:01:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:25,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751045890] [2022-04-08 06:01:25,823 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-08 06:01:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:25,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607201737] [2022-04-08 06:01:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:25,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:25,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479041978] [2022-04-08 06:01:25,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:25,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:25,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:25,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 06:01:26,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:26,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:26,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:01:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:26,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:26,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:01:26,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 06:01:26,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:01:26,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:01:26,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:26,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:26,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:26,325 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-08 06:01:26,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 06:01:26,327 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:01:26,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:26,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:01:26,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:01:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:26,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:26,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:01:26,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:01:26,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:01:26,942 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:01:26,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 06:01:26,945 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-08 06:01:26,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:26,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:01:26,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:01:26,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:01:26,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:01:26,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-08 06:01:26,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:01:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607201737] [2022-04-08 06:01:26,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:26,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479041978] [2022-04-08 06:01:26,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479041978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:26,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:26,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 06:01:26,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:26,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751045890] [2022-04-08 06:01:26,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751045890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:26,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:26,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:01:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734964170] [2022-04-08 06:01:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:26,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:01:26,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:26,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:01:26,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:26,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:01:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:01:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:01:26,974 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:01:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:27,555 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 06:01:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:01:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:01:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:01:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:01:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:01:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:01:27,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 06:01:27,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:27,597 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:01:27,597 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 06:01:27,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:01:27,598 INFO L913 BasicCegarLoop]: 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-08 06:01:27,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 06:01:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 06:01:27,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:27,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:27,618 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:27,618 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:27,631 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:01:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:01:27,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:27,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:27,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 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 52 states. [2022-04-08 06:01:27,632 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 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 52 states. [2022-04-08 06:01:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:27,634 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:01:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:01:27,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:27,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:27,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:27,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 06:01:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-08 06:01:27,637 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-08 06:01:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:27,637 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-08 06:01:27,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:01:27,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-08 06:01:29,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:01:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 06:01:29,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:29,719 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:29,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:29,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:29,920 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-08 06:01:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:29,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782518236] [2022-04-08 06:01:29,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-08 06:01:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:29,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804037513] [2022-04-08 06:01:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:29,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:29,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455296992] [2022-04-08 06:01:29,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:29,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:29,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:29,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:29,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 06:01:30,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:30,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:30,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:01:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:30,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:30,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-08 06:01:30,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(<= ~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; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,316 INFO L272 TraceCheckUtils]: 11: Hoare triple {1561#(<= ~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)); {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1561#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:30,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,319 INFO L272 TraceCheckUtils]: 19: Hoare triple {1610#(<= ~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)); {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,321 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {1610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1635#(<= |main_#t~post7| 1)} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1554#false} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 100);havoc #t~post8; {1554#false} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-08 06:01:30,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 100);havoc #t~post6; {1554#false} is VALID [2022-04-08 06:01:30,323 INFO L272 TraceCheckUtils]: 31: Hoare triple {1554#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1554#false} is VALID [2022-04-08 06:01:30,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-08 06:01:30,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-08 06:01:30,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-08 06:01:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:30,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:01:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804037513] [2022-04-08 06:01:30,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455296992] [2022-04-08 06:01:30,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455296992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:30,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:30,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:01:30,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:30,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782518236] [2022-04-08 06:01:30,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782518236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:30,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:30,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:01:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876880943] [2022-04-08 06:01:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:30,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 06:01:30,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:30,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 06:01:30,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:30,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:01:30,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:01:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:01:30,348 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 06:01:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,457 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-08 06:01:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:01:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-08 06:01:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 06:01:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:01:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 06:01:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:01:30,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-08 06:01:30,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:30,512 INFO L225 Difference]: With dead ends: 97 [2022-04-08 06:01:30,512 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 06:01:30,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:01:30,513 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:30,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 06:01:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-08 06:01:30,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:30,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:01:30,566 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:01:30,566 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:01:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,568 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-08 06:01:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-08 06:01:30,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:30,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:30,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-08 06:01:30,569 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-08 06:01:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,571 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-08 06:01:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-08 06:01:30,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:30,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:30,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:30,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:01:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-08 06:01:30,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-08 06:01:30,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:30,576 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-08 06:01:30,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 06:01:30,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-08 06:01:30,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-08 06:01:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 06:01:30,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:30,945 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:30,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:31,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:31,149 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-08 06:01:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1541736891] [2022-04-08 06:01:31,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-08 06:01:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:31,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561809521] [2022-04-08 06:01:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:31,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:31,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801717880] [2022-04-08 06:01:31,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:31,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:31,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:31,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 06:01:31,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:31,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:31,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:01:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:31,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:31,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-08 06:01:31,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(<= ~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; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,424 INFO L272 TraceCheckUtils]: 6: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {2104#(<= ~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)); {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2104#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:31,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {2153#(<= ~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)); {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,440 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:31,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,442 INFO L272 TraceCheckUtils]: 27: Hoare triple {2178#(<= ~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)); {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,443 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:31,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2203#(<= |main_#t~post8| 2)} is VALID [2022-04-08 06:01:31,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 100);havoc #t~post6; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-08 06:01:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:31,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:31,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-08 06:01:31,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-08 06:01:31,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-08 06:01:31,652 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2097#false} is VALID [2022-04-08 06:01:31,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 100);havoc #t~post6; {2097#false} is VALID [2022-04-08 06:01:31,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-08 06:01:31,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {2097#false} is VALID [2022-04-08 06:01:31,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:01:31,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 100)} assume !(~r~0 > 0); {2247#(< ~counter~0 100)} is VALID [2022-04-08 06:01:31,654 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 100)} #96#return; {2247#(< ~counter~0 100)} is VALID [2022-04-08 06:01:31,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-08 06:01:31,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-08 06:01:31,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-08 06:01:31,654 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~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)); {2096#true} is VALID [2022-04-08 06:01:31,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2247#(< ~counter~0 100)} is VALID [2022-04-08 06:01:31,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 100)} is VALID [2022-04-08 06:01:31,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 99)} assume !!(0 != ~r~0); {2272#(< ~counter~0 99)} is VALID [2022-04-08 06:01:31,655 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 99)} #94#return; {2272#(< ~counter~0 99)} is VALID [2022-04-08 06:01:31,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-08 06:01:31,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-08 06:01:31,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-08 06:01:31,656 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~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)); {2096#true} is VALID [2022-04-08 06:01:31,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2272#(< ~counter~0 99)} is VALID [2022-04-08 06:01:31,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 99)} is VALID [2022-04-08 06:01:31,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,657 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 98)} #92#return; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-08 06:01:31,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-08 06:01:31,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-08 06:01:31,657 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~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)); {2096#true} is VALID [2022-04-08 06:01:31,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 98)} #90#return; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-08 06:01:31,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-08 06:01:31,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-08 06:01:31,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-08 06:01:31,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~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; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 98)} call #t~ret9 := main(); {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 98)} {2096#true} #102#return; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 98)} assume true; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2297#(< ~counter~0 98)} is VALID [2022-04-08 06:01:31,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-08 06:01:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 06:01:31,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:31,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561809521] [2022-04-08 06:01:31,660 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801717880] [2022-04-08 06:01:31,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801717880] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:01:31,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:01:31,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-08 06:01:31,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1541736891] [2022-04-08 06:01:31,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1541736891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:31,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:31,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:01:31,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239124444] [2022-04-08 06:01:31,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 06:01:31,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:31,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:31,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:31,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:01:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:01:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:01:31,686 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:31,905 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-08 06:01:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:01:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 06:01:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:01:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:01:31,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-08 06:01:32,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:32,013 INFO L225 Difference]: With dead ends: 106 [2022-04-08 06:01:32,013 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 06:01:32,014 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:01:32,014 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:32,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:32,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 06:01:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-08 06:01:32,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:32,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:32,057 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:32,057 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:32,059 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-08 06:01:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-08 06:01:32,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:32,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:32,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-08 06:01:32,060 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-08 06:01:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:32,062 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-08 06:01:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-08 06:01:32,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:32,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:32,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:32,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-08 06:01:32,064 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-08 06:01:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:32,064 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-08 06:01:32,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:32,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-08 06:01:33,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-08 06:01:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 06:01:33,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:33,611 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:33,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 06:01:33,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:33,812 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:33,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:33,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-08 06:01:33,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:33,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332578613] [2022-04-08 06:01:33,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-08 06:01:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:33,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124649379] [2022-04-08 06:01:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:33,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:33,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895538327] [2022-04-08 06:01:33,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:33,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:33,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:33,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:33,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 06:01:33,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:33,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:33,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:01:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:33,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:34,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-08 06:01:34,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= ~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; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,220 INFO L272 TraceCheckUtils]: 11: Hoare triple {2845#(<= ~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)); {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {2845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2845#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:34,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,225 INFO L272 TraceCheckUtils]: 19: Hoare triple {2894#(<= ~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)); {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,227 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:34,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,228 INFO L272 TraceCheckUtils]: 27: Hoare triple {2919#(<= ~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)); {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,230 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {2919#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2919#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:34,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {2919#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2944#(<= |main_#t~post7| 2)} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 100);havoc #t~post8; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 100);havoc #t~post6; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-08 06:01:34,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-08 06:01:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:34,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:34,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-08 06:01:34,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-08 06:01:34,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 100);havoc #t~post6; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 100);havoc #t~post8; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2838#false} is VALID [2022-04-08 06:01:34,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:01:34,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 100)} is VALID [2022-04-08 06:01:34,566 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 100)} #96#return; {3000#(< ~counter~0 100)} is VALID [2022-04-08 06:01:34,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-08 06:01:34,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-08 06:01:34,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-08 06:01:34,568 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~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)); {2837#true} is VALID [2022-04-08 06:01:34,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {3000#(< ~counter~0 100)} is VALID [2022-04-08 06:01:34,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 100)} is VALID [2022-04-08 06:01:34,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 99)} assume !!(0 != ~r~0); {3025#(< ~counter~0 99)} is VALID [2022-04-08 06:01:34,571 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 99)} #94#return; {3025#(< ~counter~0 99)} is VALID [2022-04-08 06:01:34,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-08 06:01:34,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-08 06:01:34,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-08 06:01:34,571 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~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)); {2837#true} is VALID [2022-04-08 06:01:34,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {3025#(< ~counter~0 99)} is VALID [2022-04-08 06:01:34,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 99)} is VALID [2022-04-08 06:01:34,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 98)} #92#return; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~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)); {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 98)} #90#return; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-08 06:01:34,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-08 06:01:34,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-08 06:01:34,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~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; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 98)} call #t~ret9 := main(); {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 98)} {2837#true} #102#return; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 98)} assume true; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3050#(< ~counter~0 98)} is VALID [2022-04-08 06:01:34,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-08 06:01:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 06:01:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:34,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124649379] [2022-04-08 06:01:34,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:34,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895538327] [2022-04-08 06:01:34,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895538327] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:34,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:34,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:01:34,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:34,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332578613] [2022-04-08 06:01:34,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332578613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:34,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:34,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:01:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721635281] [2022-04-08 06:01:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 06:01:34,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:34,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:34,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:34,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:01:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:34,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:01:34,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:01:34,620 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:34,908 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-08 06:01:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:01:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 06:01:34,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:01:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:01:34,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-08 06:01:35,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:35,001 INFO L225 Difference]: With dead ends: 91 [2022-04-08 06:01:35,001 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 06:01:35,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:01:35,003 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:35,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 06:01:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 06:01:35,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:35,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:35,075 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:35,075 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:35,077 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 06:01:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 06:01:35,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:35,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:35,092 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-08 06:01:35,092 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-08 06:01:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:35,095 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-08 06:01:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 06:01:35,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:35,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:35,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:35,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:35,095 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 06:01:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-08 06:01:35,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-08 06:01:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:35,097 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-08 06:01:35,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:01:35,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-08 06:01:35,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-08 06:01:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 06:01:35,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:35,998 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:36,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:36,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:36,199 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-08 06:01:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745525567] [2022-04-08 06:01:36,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-08 06:01:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476769900] [2022-04-08 06:01:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:36,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626981056] [2022-04-08 06:01:36,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:36,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:36,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:36,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:36,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 06:01:36,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:36,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:36,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:01:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:36,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:36,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#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; {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 06:01:36,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {3568#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 100);havoc #t~post6; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L272 TraceCheckUtils]: 19: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,555 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-08 06:01:36,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-08 06:01:36,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-08 06:01:36,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-08 06:01:36,556 INFO L272 TraceCheckUtils]: 27: Hoare triple {3645#(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)); {3568#true} is VALID [2022-04-08 06:01:36,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 06:01:36,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 06:01:36,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3568#true} {3645#(not (= main_~r~0 0))} #96#return; {3645#(not (= main_~r~0 0))} is VALID [2022-04-08 06:01:36,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {3645#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:01:36,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:01:36,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:01:36,558 INFO L272 TraceCheckUtils]: 35: Hoare triple {3670#(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)); {3568#true} is VALID [2022-04-08 06:01:36,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 06:01:36,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 06:01:36,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 06:01:36,562 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3568#true} {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:01:36,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3569#false} is VALID [2022-04-08 06:01:36,564 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-08 06:01:36,564 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 100);havoc #t~post6; {3569#false} is VALID [2022-04-08 06:01:36,564 INFO L272 TraceCheckUtils]: 43: Hoare triple {3569#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3569#false} is VALID [2022-04-08 06:01:36,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-08 06:01:36,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-08 06:01:36,568 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-08 06:01:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:01:36,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:01:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476769900] [2022-04-08 06:01:36,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626981056] [2022-04-08 06:01:36,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626981056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:36,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:36,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:36,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745525567] [2022-04-08 06:01:36,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745525567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:36,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:36,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488859838] [2022-04-08 06:01:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:36,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-08 06:01:36,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:36,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 06:01:36,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:36,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:01:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:01:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:01:36,620 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 06:01:36,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:36,850 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2022-04-08 06:01:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:01:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-08 06:01:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 06:01:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:01:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 06:01:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:01:36,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 06:01:36,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:36,967 INFO L225 Difference]: With dead ends: 119 [2022-04-08 06:01:36,967 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 06:01:36,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:01:36,970 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:36,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 06:01:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-04-08 06:01:37,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:37,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:01:37,056 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:01:37,056 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:01:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:37,059 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 06:01:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 06:01:37,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:37,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:37,059 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 82 states. [2022-04-08 06:01:37,059 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 82 states. [2022-04-08 06:01:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:37,061 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-08 06:01:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-08 06:01:37,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:37,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:37,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:37,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:01:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 06:01:37,064 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-08 06:01:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:37,079 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 06:01:37,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 06:01:37,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 06:01:37,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:01:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 06:01:37,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:37,634 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:37,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:37,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 06:01:37,835 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-08 06:01:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:37,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697119409] [2022-04-08 06:01:37,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-08 06:01:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899310406] [2022-04-08 06:01:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:37,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:37,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821238956] [2022-04-08 06:01:37,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:37,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:37,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:37,863 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 06:01:37,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:37,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:37,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:01:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:37,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:38,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4254#true} is VALID [2022-04-08 06:01:38,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4262#(<= ~counter~0 0)} {4254#true} #102#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {4262#(<= ~counter~0 0)} call #t~ret9 := main(); {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {4262#(<= ~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; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {4262#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {4262#(<= ~counter~0 0)} ~cond := #in~cond; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4262#(<= ~counter~0 0)} assume !(0 == ~cond); {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4262#(<= ~counter~0 0)} {4262#(<= ~counter~0 0)} #90#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {4262#(<= ~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)); {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {4262#(<= ~counter~0 0)} ~cond := #in~cond; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4262#(<= ~counter~0 0)} assume !(0 == ~cond); {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4262#(<= ~counter~0 0)} {4262#(<= ~counter~0 0)} #92#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {4262#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4262#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:38,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {4262#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {4311#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,293 INFO L272 TraceCheckUtils]: 19: Hoare triple {4311#(<= ~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)); {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {4311#(<= ~counter~0 1)} ~cond := #in~cond; {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {4311#(<= ~counter~0 1)} assume !(0 == ~cond); {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {4311#(<= ~counter~0 1)} assume true; {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,295 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4311#(<= ~counter~0 1)} {4311#(<= ~counter~0 1)} #94#return; {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {4311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4311#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:38,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {4311#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {4336#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,296 INFO L272 TraceCheckUtils]: 27: Hoare triple {4336#(<= ~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)); {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {4336#(<= ~counter~0 2)} ~cond := #in~cond; {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {4336#(<= ~counter~0 2)} assume !(0 == ~cond); {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {4336#(<= ~counter~0 2)} assume true; {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,297 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4336#(<= ~counter~0 2)} {4336#(<= ~counter~0 2)} #96#return; {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {4336#(<= ~counter~0 2)} assume !(~r~0 > 0); {4336#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:38,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {4336#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {4361#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {4361#(<= ~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)); {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {4361#(<= ~counter~0 3)} ~cond := #in~cond; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {4361#(<= ~counter~0 3)} assume !(0 == ~cond); {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {4361#(<= ~counter~0 3)} assume true; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,300 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4361#(<= ~counter~0 3)} {4361#(<= ~counter~0 3)} #98#return; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {4361#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4361#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:38,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {4361#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4386#(<= |main_#t~post8| 3)} is VALID [2022-04-08 06:01:38,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {4386#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {4255#false} is VALID [2022-04-08 06:01:38,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {4255#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4255#false} is VALID [2022-04-08 06:01:38,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {4255#false} assume !(#t~post6 < 100);havoc #t~post6; {4255#false} is VALID [2022-04-08 06:01:38,302 INFO L272 TraceCheckUtils]: 45: Hoare triple {4255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4255#false} is VALID [2022-04-08 06:01:38,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {4255#false} ~cond := #in~cond; {4255#false} is VALID [2022-04-08 06:01:38,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {4255#false} assume 0 == ~cond; {4255#false} is VALID [2022-04-08 06:01:38,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-08 06:01:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:38,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:38,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-08 06:01:38,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {4255#false} assume 0 == ~cond; {4255#false} is VALID [2022-04-08 06:01:38,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {4255#false} ~cond := #in~cond; {4255#false} is VALID [2022-04-08 06:01:38,691 INFO L272 TraceCheckUtils]: 45: Hoare triple {4255#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4255#false} is VALID [2022-04-08 06:01:38,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {4255#false} assume !(#t~post6 < 100);havoc #t~post6; {4255#false} is VALID [2022-04-08 06:01:38,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {4255#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4255#false} is VALID [2022-04-08 06:01:38,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {4426#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {4255#false} is VALID [2022-04-08 06:01:38,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {4430#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4426#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:01:38,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {4430#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4430#(< ~counter~0 100)} is VALID [2022-04-08 06:01:38,694 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4254#true} {4430#(< ~counter~0 100)} #98#return; {4430#(< ~counter~0 100)} is VALID [2022-04-08 06:01:38,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-08 06:01:38,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-08 06:01:38,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-08 06:01:38,694 INFO L272 TraceCheckUtils]: 35: Hoare triple {4430#(< ~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)); {4254#true} is VALID [2022-04-08 06:01:38,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {4430#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {4430#(< ~counter~0 100)} is VALID [2022-04-08 06:01:38,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {4455#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4430#(< ~counter~0 100)} is VALID [2022-04-08 06:01:38,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {4455#(< ~counter~0 99)} assume !(~r~0 > 0); {4455#(< ~counter~0 99)} is VALID [2022-04-08 06:01:38,696 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4254#true} {4455#(< ~counter~0 99)} #96#return; {4455#(< ~counter~0 99)} is VALID [2022-04-08 06:01:38,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-08 06:01:38,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-08 06:01:38,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-08 06:01:38,696 INFO L272 TraceCheckUtils]: 27: Hoare triple {4455#(< ~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)); {4254#true} is VALID [2022-04-08 06:01:38,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {4455#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4455#(< ~counter~0 99)} is VALID [2022-04-08 06:01:38,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {4480#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4455#(< ~counter~0 99)} is VALID [2022-04-08 06:01:38,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {4480#(< ~counter~0 98)} assume !!(0 != ~r~0); {4480#(< ~counter~0 98)} is VALID [2022-04-08 06:01:38,698 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4254#true} {4480#(< ~counter~0 98)} #94#return; {4480#(< ~counter~0 98)} is VALID [2022-04-08 06:01:38,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-08 06:01:38,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-08 06:01:38,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-08 06:01:38,698 INFO L272 TraceCheckUtils]: 19: Hoare triple {4480#(< ~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)); {4254#true} is VALID [2022-04-08 06:01:38,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {4480#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4480#(< ~counter~0 98)} is VALID [2022-04-08 06:01:38,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {4505#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4480#(< ~counter~0 98)} is VALID [2022-04-08 06:01:38,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {4505#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,699 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4254#true} {4505#(< ~counter~0 97)} #92#return; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L272 TraceCheckUtils]: 11: Hoare triple {4505#(< ~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)); {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4254#true} {4505#(< ~counter~0 97)} #90#return; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-08 06:01:38,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-08 06:01:38,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {4505#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4254#true} is VALID [2022-04-08 06:01:38,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {4505#(< ~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; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {4505#(< ~counter~0 97)} call #t~ret9 := main(); {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4505#(< ~counter~0 97)} {4254#true} #102#return; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {4505#(< ~counter~0 97)} assume true; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4505#(< ~counter~0 97)} is VALID [2022-04-08 06:01:38,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4254#true} is VALID [2022-04-08 06:01:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:01:38,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:38,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899310406] [2022-04-08 06:01:38,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:38,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821238956] [2022-04-08 06:01:38,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821238956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:38,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:38,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:01:38,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:38,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697119409] [2022-04-08 06:01:38,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697119409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:38,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:38,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:01:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316240406] [2022-04-08 06:01:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 06:01:38,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:38,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:38,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:38,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:01:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:01:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:01:38,769 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,075 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-08 06:01:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:01:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 06:01:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:01:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:01:39,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 06:01:39,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:39,183 INFO L225 Difference]: With dead ends: 118 [2022-04-08 06:01:39,183 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 06:01:39,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:01:39,184 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:39,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 149 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 06:01:39,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-08 06:01:39,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:39,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:39,270 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:39,271 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,277 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:01:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:01:39,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:39,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:39,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:01:39,278 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:01:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,291 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:01:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:01:39,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:39,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:39,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:39,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-08 06:01:39,293 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-08 06:01:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:39,293 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-08 06:01:39,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:39,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-08 06:01:39,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-08 06:01:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 06:01:39,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:39,975 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:39,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:40,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:40,176 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-08 06:01:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:40,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883627448] [2022-04-08 06:01:40,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-08 06:01:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299805810] [2022-04-08 06:01:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:40,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483936883] [2022-04-08 06:01:40,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:01:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:40,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:40,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:40,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 06:01:40,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:01:40,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:40,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:01:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:40,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:40,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {5119#true} call ULTIMATE.init(); {5119#true} is VALID [2022-04-08 06:01:40,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {5119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#(<= ~counter~0 0)} {5119#true} #102#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#(<= ~counter~0 0)} call #t~ret9 := main(); {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {5127#(<= ~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; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {5127#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {5127#(<= ~counter~0 0)} ~cond := #in~cond; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {5127#(<= ~counter~0 0)} assume !(0 == ~cond); {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5127#(<= ~counter~0 0)} {5127#(<= ~counter~0 0)} #90#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {5127#(<= ~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)); {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {5127#(<= ~counter~0 0)} ~cond := #in~cond; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {5127#(<= ~counter~0 0)} assume !(0 == ~cond); {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5127#(<= ~counter~0 0)} {5127#(<= ~counter~0 0)} #92#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {5127#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5127#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:40,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {5127#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {5176#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {5176#(<= ~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)); {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {5176#(<= ~counter~0 1)} ~cond := #in~cond; {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {5176#(<= ~counter~0 1)} assume !(0 == ~cond); {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {5176#(<= ~counter~0 1)} assume true; {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5176#(<= ~counter~0 1)} {5176#(<= ~counter~0 1)} #94#return; {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {5176#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5176#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:40,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {5176#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {5201#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,668 INFO L272 TraceCheckUtils]: 27: Hoare triple {5201#(<= ~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)); {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {5201#(<= ~counter~0 2)} ~cond := #in~cond; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {5201#(<= ~counter~0 2)} assume !(0 == ~cond); {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {5201#(<= ~counter~0 2)} assume true; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,669 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5201#(<= ~counter~0 2)} {5201#(<= ~counter~0 2)} #96#return; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {5201#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5201#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:40,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {5201#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {5226#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {5226#(<= ~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)); {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {5226#(<= ~counter~0 3)} ~cond := #in~cond; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {5226#(<= ~counter~0 3)} assume !(0 == ~cond); {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {5226#(<= ~counter~0 3)} assume true; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,672 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5226#(<= ~counter~0 3)} {5226#(<= ~counter~0 3)} #96#return; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {5226#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5226#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {5226#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5251#(<= |main_#t~post7| 3)} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {5251#(<= |main_#t~post7| 3)} assume !(#t~post7 < 100);havoc #t~post7; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {5120#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {5120#false} assume !(#t~post8 < 100);havoc #t~post8; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {5120#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {5120#false} assume !(#t~post6 < 100);havoc #t~post6; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L272 TraceCheckUtils]: 47: Hoare triple {5120#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {5120#false} ~cond := #in~cond; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {5120#false} assume 0 == ~cond; {5120#false} is VALID [2022-04-08 06:01:40,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {5120#false} assume !false; {5120#false} is VALID [2022-04-08 06:01:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:40,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {5120#false} assume !false; {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {5120#false} assume 0 == ~cond; {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {5120#false} ~cond := #in~cond; {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L272 TraceCheckUtils]: 47: Hoare triple {5120#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {5120#false} assume !(#t~post6 < 100);havoc #t~post6; {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {5120#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5120#false} is VALID [2022-04-08 06:01:41,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {5120#false} assume !(#t~post8 < 100);havoc #t~post8; {5120#false} is VALID [2022-04-08 06:01:41,092 INFO L290 TraceCheckUtils]: 43: Hoare triple {5120#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5120#false} is VALID [2022-04-08 06:01:41,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {5303#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {5120#false} is VALID [2022-04-08 06:01:41,092 INFO L290 TraceCheckUtils]: 41: Hoare triple {5307#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5303#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:01:41,092 INFO L290 TraceCheckUtils]: 40: Hoare triple {5307#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5307#(< ~counter~0 100)} is VALID [2022-04-08 06:01:41,093 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5119#true} {5307#(< ~counter~0 100)} #96#return; {5307#(< ~counter~0 100)} is VALID [2022-04-08 06:01:41,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-08 06:01:41,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-08 06:01:41,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-08 06:01:41,093 INFO L272 TraceCheckUtils]: 35: Hoare triple {5307#(< ~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)); {5119#true} is VALID [2022-04-08 06:01:41,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {5307#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {5307#(< ~counter~0 100)} is VALID [2022-04-08 06:01:41,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {5332#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5307#(< ~counter~0 100)} is VALID [2022-04-08 06:01:41,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {5332#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5332#(< ~counter~0 99)} is VALID [2022-04-08 06:01:41,096 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5119#true} {5332#(< ~counter~0 99)} #96#return; {5332#(< ~counter~0 99)} is VALID [2022-04-08 06:01:41,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-08 06:01:41,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-08 06:01:41,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-08 06:01:41,097 INFO L272 TraceCheckUtils]: 27: Hoare triple {5332#(< ~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)); {5119#true} is VALID [2022-04-08 06:01:41,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {5332#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {5332#(< ~counter~0 99)} is VALID [2022-04-08 06:01:41,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {5357#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5332#(< ~counter~0 99)} is VALID [2022-04-08 06:01:41,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {5357#(< ~counter~0 98)} assume !!(0 != ~r~0); {5357#(< ~counter~0 98)} is VALID [2022-04-08 06:01:41,098 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5119#true} {5357#(< ~counter~0 98)} #94#return; {5357#(< ~counter~0 98)} is VALID [2022-04-08 06:01:41,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-08 06:01:41,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-08 06:01:41,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-08 06:01:41,098 INFO L272 TraceCheckUtils]: 19: Hoare triple {5357#(< ~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)); {5119#true} is VALID [2022-04-08 06:01:41,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {5357#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {5357#(< ~counter~0 98)} is VALID [2022-04-08 06:01:41,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {5382#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5357#(< ~counter~0 98)} is VALID [2022-04-08 06:01:41,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {5382#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,100 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5119#true} {5382#(< ~counter~0 97)} #92#return; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-08 06:01:41,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-08 06:01:41,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-08 06:01:41,100 INFO L272 TraceCheckUtils]: 11: Hoare triple {5382#(< ~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)); {5119#true} is VALID [2022-04-08 06:01:41,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5119#true} {5382#(< ~counter~0 97)} #90#return; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-08 06:01:41,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-08 06:01:41,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-08 06:01:41,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {5382#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5119#true} is VALID [2022-04-08 06:01:41,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#(< ~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; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {5382#(< ~counter~0 97)} call #t~ret9 := main(); {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5382#(< ~counter~0 97)} {5119#true} #102#return; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {5382#(< ~counter~0 97)} assume true; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {5119#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5382#(< ~counter~0 97)} is VALID [2022-04-08 06:01:41,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {5119#true} call ULTIMATE.init(); {5119#true} is VALID [2022-04-08 06:01:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:01:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299805810] [2022-04-08 06:01:41,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483936883] [2022-04-08 06:01:41,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483936883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:41,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:41,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:01:41,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:41,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883627448] [2022-04-08 06:01:41,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883627448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:41,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:41,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:01:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685251323] [2022-04-08 06:01:41,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 06:01:41,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:41,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:41,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:41,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:01:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:01:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:01:41,154 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:41,442 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-08 06:01:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:01:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 06:01:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:01:41,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:01:41,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 06:01:41,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:41,531 INFO L225 Difference]: With dead ends: 119 [2022-04-08 06:01:41,531 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 06:01:41,531 INFO L912 BasicCegarLoop]: 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-08 06:01:41,532 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:41,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 06:01:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 06:01:41,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:41,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:41,624 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:41,624 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:41,626 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:01:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:01:41,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:41,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:41,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:01:41,626 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:01:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:41,628 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:01:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:01:41,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:41,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:41,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:41,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:01:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 06:01:41,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-08 06:01:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:41,630 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 06:01:41,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:01:41,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 06:01:43,845 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-08 06:01:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:01:43,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 06:01:43,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:43,846 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:43,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:44,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 06:01:44,056 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-08 06:01:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:44,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2115154154] [2022-04-08 06:01:44,057 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-08 06:01:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:44,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060841956] [2022-04-08 06:01:44,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:44,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:44,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544445302] [2022-04-08 06:01:44,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:44,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:44,086 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:44,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 06:01:44,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:44,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:44,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:01:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:44,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:44,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-08 06:01:44,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6014#(<= ~counter~0 0)} {6006#true} #102#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {6014#(<= ~counter~0 0)} call #t~ret9 := main(); {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {6014#(<= ~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; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,465 INFO L272 TraceCheckUtils]: 6: Hoare triple {6014#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {6014#(<= ~counter~0 0)} ~cond := #in~cond; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {6014#(<= ~counter~0 0)} assume !(0 == ~cond); {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,466 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6014#(<= ~counter~0 0)} {6014#(<= ~counter~0 0)} #90#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {6014#(<= ~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)); {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {6014#(<= ~counter~0 0)} ~cond := #in~cond; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {6014#(<= ~counter~0 0)} assume !(0 == ~cond); {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,468 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6014#(<= ~counter~0 0)} {6014#(<= ~counter~0 0)} #92#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {6014#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:44,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {6014#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {6063#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,469 INFO L272 TraceCheckUtils]: 19: Hoare triple {6063#(<= ~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)); {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {6063#(<= ~counter~0 1)} ~cond := #in~cond; {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {6063#(<= ~counter~0 1)} assume !(0 == ~cond); {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {6063#(<= ~counter~0 1)} assume true; {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6063#(<= ~counter~0 1)} {6063#(<= ~counter~0 1)} #94#return; {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {6063#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {6063#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {6088#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,472 INFO L272 TraceCheckUtils]: 27: Hoare triple {6088#(<= ~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)); {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {6088#(<= ~counter~0 2)} ~cond := #in~cond; {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {6088#(<= ~counter~0 2)} assume !(0 == ~cond); {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {6088#(<= ~counter~0 2)} assume true; {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,474 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6088#(<= ~counter~0 2)} {6088#(<= ~counter~0 2)} #96#return; {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {6088#(<= ~counter~0 2)} assume !(~r~0 > 0); {6088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {6088#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {6113#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,475 INFO L272 TraceCheckUtils]: 35: Hoare triple {6113#(<= ~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)); {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {6113#(<= ~counter~0 3)} ~cond := #in~cond; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {6113#(<= ~counter~0 3)} assume !(0 == ~cond); {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {6113#(<= ~counter~0 3)} assume true; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,477 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6113#(<= ~counter~0 3)} {6113#(<= ~counter~0 3)} #98#return; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {6113#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {6113#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {6138#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,478 INFO L272 TraceCheckUtils]: 43: Hoare triple {6138#(<= ~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)); {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {6138#(<= ~counter~0 4)} ~cond := #in~cond; {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {6138#(<= ~counter~0 4)} assume !(0 == ~cond); {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {6138#(<= ~counter~0 4)} assume true; {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,479 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6138#(<= ~counter~0 4)} {6138#(<= ~counter~0 4)} #98#return; {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {6138#(<= ~counter~0 4)} assume !(~r~0 < 0); {6138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {6138#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6163#(<= |main_#t~post6| 4)} is VALID [2022-04-08 06:01:44,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {6163#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {6007#false} is VALID [2022-04-08 06:01:44,490 INFO L272 TraceCheckUtils]: 51: Hoare triple {6007#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6007#false} is VALID [2022-04-08 06:01:44,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2022-04-08 06:01:44,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#false} assume 0 == ~cond; {6007#false} is VALID [2022-04-08 06:01:44,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-08 06:01:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:44,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:44,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-08 06:01:44,950 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#false} assume 0 == ~cond; {6007#false} is VALID [2022-04-08 06:01:44,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2022-04-08 06:01:44,950 INFO L272 TraceCheckUtils]: 51: Hoare triple {6007#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6007#false} is VALID [2022-04-08 06:01:44,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {6191#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {6007#false} is VALID [2022-04-08 06:01:44,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {6195#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6191#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:01:44,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {6195#(< ~counter~0 100)} assume !(~r~0 < 0); {6195#(< ~counter~0 100)} is VALID [2022-04-08 06:01:44,952 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6006#true} {6195#(< ~counter~0 100)} #98#return; {6195#(< ~counter~0 100)} is VALID [2022-04-08 06:01:44,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,953 INFO L272 TraceCheckUtils]: 43: Hoare triple {6195#(< ~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)); {6006#true} is VALID [2022-04-08 06:01:44,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {6195#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {6195#(< ~counter~0 100)} is VALID [2022-04-08 06:01:44,953 INFO L290 TraceCheckUtils]: 41: Hoare triple {6220#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6195#(< ~counter~0 100)} is VALID [2022-04-08 06:01:44,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {6220#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6220#(< ~counter~0 99)} is VALID [2022-04-08 06:01:44,954 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6006#true} {6220#(< ~counter~0 99)} #98#return; {6220#(< ~counter~0 99)} is VALID [2022-04-08 06:01:44,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,974 INFO L272 TraceCheckUtils]: 35: Hoare triple {6220#(< ~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)); {6006#true} is VALID [2022-04-08 06:01:44,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {6220#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {6220#(< ~counter~0 99)} is VALID [2022-04-08 06:01:44,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {6245#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6220#(< ~counter~0 99)} is VALID [2022-04-08 06:01:44,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {6245#(< ~counter~0 98)} assume !(~r~0 > 0); {6245#(< ~counter~0 98)} is VALID [2022-04-08 06:01:44,976 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6006#true} {6245#(< ~counter~0 98)} #96#return; {6245#(< ~counter~0 98)} is VALID [2022-04-08 06:01:44,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {6245#(< ~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)); {6006#true} is VALID [2022-04-08 06:01:44,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {6245#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {6245#(< ~counter~0 98)} is VALID [2022-04-08 06:01:44,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {6270#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6245#(< ~counter~0 98)} is VALID [2022-04-08 06:01:44,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {6270#(< ~counter~0 97)} assume !!(0 != ~r~0); {6270#(< ~counter~0 97)} is VALID [2022-04-08 06:01:44,980 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6006#true} {6270#(< ~counter~0 97)} #94#return; {6270#(< ~counter~0 97)} is VALID [2022-04-08 06:01:44,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,980 INFO L272 TraceCheckUtils]: 19: Hoare triple {6270#(< ~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)); {6006#true} is VALID [2022-04-08 06:01:44,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {6270#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {6270#(< ~counter~0 97)} is VALID [2022-04-08 06:01:44,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {6295#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6270#(< ~counter~0 97)} is VALID [2022-04-08 06:01:44,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {6295#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6006#true} {6295#(< ~counter~0 96)} #92#return; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {6295#(< ~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)); {6006#true} is VALID [2022-04-08 06:01:44,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6006#true} {6295#(< ~counter~0 96)} #90#return; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-08 06:01:44,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-08 06:01:44,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-08 06:01:44,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {6295#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6006#true} is VALID [2022-04-08 06:01:44,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {6295#(< ~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; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {6295#(< ~counter~0 96)} call #t~ret9 := main(); {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6295#(< ~counter~0 96)} {6006#true} #102#return; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {6295#(< ~counter~0 96)} assume true; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6295#(< ~counter~0 96)} is VALID [2022-04-08 06:01:44,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-08 06:01:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 06:01:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060841956] [2022-04-08 06:01:44,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544445302] [2022-04-08 06:01:44,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544445302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:44,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:44,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:01:44,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2115154154] [2022-04-08 06:01:44,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2115154154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:44,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:44,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:01:44,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191049458] [2022-04-08 06:01:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 06:01:44,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:44,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:45,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:45,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:01:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:01:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:45,040 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:45,386 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-08 06:01:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:01:45,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 06:01:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:01:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:01:45,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 06:01:45,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:45,483 INFO L225 Difference]: With dead ends: 99 [2022-04-08 06:01:45,483 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 06:01:45,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-08 06:01:45,484 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:45,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 06:01:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-08 06:01:45,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:45,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:45,587 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:45,588 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:45,590 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:01:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:01:45,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:45,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:45,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:01:45,591 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:01:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:45,593 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:01:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:01:45,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:45,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:45,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:45,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 06:01:45,613 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-08 06:01:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:45,613 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 06:01:45,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:45,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 06:01:47,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 06:01:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 06:01:47,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:47,730 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:47,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:47,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 06:01:47,931 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-08 06:01:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:47,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233506116] [2022-04-08 06:01:47,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-08 06:01:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:47,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688998231] [2022-04-08 06:01:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:47,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:47,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932552730] [2022-04-08 06:01:47,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:01:47,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:47,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:47,959 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:47,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 06:01:48,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:01:48,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:48,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:01:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:48,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:48,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {6919#true} call ULTIMATE.init(); {6919#true} is VALID [2022-04-08 06:01:48,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {6919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6927#(<= ~counter~0 0)} {6919#true} #102#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {6927#(<= ~counter~0 0)} call #t~ret9 := main(); {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {6927#(<= ~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; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {6927#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {6927#(<= ~counter~0 0)} ~cond := #in~cond; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {6927#(<= ~counter~0 0)} assume !(0 == ~cond); {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6927#(<= ~counter~0 0)} {6927#(<= ~counter~0 0)} #90#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {6927#(<= ~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)); {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {6927#(<= ~counter~0 0)} ~cond := #in~cond; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {6927#(<= ~counter~0 0)} assume !(0 == ~cond); {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,556 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6927#(<= ~counter~0 0)} {6927#(<= ~counter~0 0)} #92#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {6927#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6927#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:48,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {6927#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,558 INFO L272 TraceCheckUtils]: 19: Hoare triple {6976#(<= ~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)); {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(<= ~counter~0 1)} ~cond := #in~cond; {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(<= ~counter~0 1)} assume !(0 == ~cond); {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(<= ~counter~0 1)} assume true; {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,559 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6976#(<= ~counter~0 1)} {6976#(<= ~counter~0 1)} #94#return; {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6976#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:48,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {6976#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {7001#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,561 INFO L272 TraceCheckUtils]: 27: Hoare triple {7001#(<= ~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)); {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= ~counter~0 2)} ~cond := #in~cond; {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= ~counter~0 2)} assume !(0 == ~cond); {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {7001#(<= ~counter~0 2)} assume true; {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,562 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7001#(<= ~counter~0 2)} {7001#(<= ~counter~0 2)} #96#return; {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {7001#(<= ~counter~0 2)} assume !(~r~0 > 0); {7001#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:48,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {7001#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {7026#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {7026#(<= ~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)); {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {7026#(<= ~counter~0 3)} ~cond := #in~cond; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {7026#(<= ~counter~0 3)} assume !(0 == ~cond); {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {7026#(<= ~counter~0 3)} assume true; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,565 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7026#(<= ~counter~0 3)} {7026#(<= ~counter~0 3)} #98#return; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,565 INFO L290 TraceCheckUtils]: 40: Hoare triple {7026#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7026#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:48,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {7026#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {7051#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,566 INFO L272 TraceCheckUtils]: 43: Hoare triple {7051#(<= ~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)); {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {7051#(<= ~counter~0 4)} ~cond := #in~cond; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {7051#(<= ~counter~0 4)} assume !(0 == ~cond); {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {7051#(<= ~counter~0 4)} assume true; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,580 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7051#(<= ~counter~0 4)} {7051#(<= ~counter~0 4)} #98#return; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {7051#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7051#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:48,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {7051#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7076#(<= |main_#t~post8| 4)} is VALID [2022-04-08 06:01:48,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {7076#(<= |main_#t~post8| 4)} assume !(#t~post8 < 100);havoc #t~post8; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {6920#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {6920#false} assume !(#t~post6 < 100);havoc #t~post6; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L272 TraceCheckUtils]: 53: Hoare triple {6920#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {6920#false} ~cond := #in~cond; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {6920#false} assume 0 == ~cond; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {6920#false} assume !false; {6920#false} is VALID [2022-04-08 06:01:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:48,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:49,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {6920#false} assume !false; {6920#false} is VALID [2022-04-08 06:01:49,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {6920#false} assume 0 == ~cond; {6920#false} is VALID [2022-04-08 06:01:49,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {6920#false} ~cond := #in~cond; {6920#false} is VALID [2022-04-08 06:01:49,026 INFO L272 TraceCheckUtils]: 53: Hoare triple {6920#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6920#false} is VALID [2022-04-08 06:01:49,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {6920#false} assume !(#t~post6 < 100);havoc #t~post6; {6920#false} is VALID [2022-04-08 06:01:49,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {6920#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6920#false} is VALID [2022-04-08 06:01:49,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {7116#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {6920#false} is VALID [2022-04-08 06:01:49,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {7120#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7116#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:01:49,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {7120#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7120#(< ~counter~0 100)} is VALID [2022-04-08 06:01:49,028 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6919#true} {7120#(< ~counter~0 100)} #98#return; {7120#(< ~counter~0 100)} is VALID [2022-04-08 06:01:49,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,028 INFO L272 TraceCheckUtils]: 43: Hoare triple {7120#(< ~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)); {6919#true} is VALID [2022-04-08 06:01:49,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {7120#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {7120#(< ~counter~0 100)} is VALID [2022-04-08 06:01:49,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {7145#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7120#(< ~counter~0 100)} is VALID [2022-04-08 06:01:49,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {7145#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7145#(< ~counter~0 99)} is VALID [2022-04-08 06:01:49,030 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6919#true} {7145#(< ~counter~0 99)} #98#return; {7145#(< ~counter~0 99)} is VALID [2022-04-08 06:01:49,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,030 INFO L272 TraceCheckUtils]: 35: Hoare triple {7145#(< ~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)); {6919#true} is VALID [2022-04-08 06:01:49,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {7145#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {7145#(< ~counter~0 99)} is VALID [2022-04-08 06:01:49,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {7170#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7145#(< ~counter~0 99)} is VALID [2022-04-08 06:01:49,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {7170#(< ~counter~0 98)} assume !(~r~0 > 0); {7170#(< ~counter~0 98)} is VALID [2022-04-08 06:01:49,032 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6919#true} {7170#(< ~counter~0 98)} #96#return; {7170#(< ~counter~0 98)} is VALID [2022-04-08 06:01:49,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,033 INFO L272 TraceCheckUtils]: 27: Hoare triple {7170#(< ~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)); {6919#true} is VALID [2022-04-08 06:01:49,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {7170#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {7170#(< ~counter~0 98)} is VALID [2022-04-08 06:01:49,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {7195#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7170#(< ~counter~0 98)} is VALID [2022-04-08 06:01:49,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {7195#(< ~counter~0 97)} assume !!(0 != ~r~0); {7195#(< ~counter~0 97)} is VALID [2022-04-08 06:01:49,034 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6919#true} {7195#(< ~counter~0 97)} #94#return; {7195#(< ~counter~0 97)} is VALID [2022-04-08 06:01:49,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,035 INFO L272 TraceCheckUtils]: 19: Hoare triple {7195#(< ~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)); {6919#true} is VALID [2022-04-08 06:01:49,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {7195#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {7195#(< ~counter~0 97)} is VALID [2022-04-08 06:01:49,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {7220#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7195#(< ~counter~0 97)} is VALID [2022-04-08 06:01:49,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {7220#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6919#true} {7220#(< ~counter~0 96)} #92#return; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,036 INFO L272 TraceCheckUtils]: 11: Hoare triple {7220#(< ~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)); {6919#true} is VALID [2022-04-08 06:01:49,037 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6919#true} {7220#(< ~counter~0 96)} #90#return; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-08 06:01:49,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-08 06:01:49,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-08 06:01:49,037 INFO L272 TraceCheckUtils]: 6: Hoare triple {7220#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6919#true} is VALID [2022-04-08 06:01:49,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {7220#(< ~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; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {7220#(< ~counter~0 96)} call #t~ret9 := main(); {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7220#(< ~counter~0 96)} {6919#true} #102#return; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {7220#(< ~counter~0 96)} assume true; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {6919#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7220#(< ~counter~0 96)} is VALID [2022-04-08 06:01:49,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {6919#true} call ULTIMATE.init(); {6919#true} is VALID [2022-04-08 06:01:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 06:01:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688998231] [2022-04-08 06:01:49,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:49,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932552730] [2022-04-08 06:01:49,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932552730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:49,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:49,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:01:49,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233506116] [2022-04-08 06:01:49,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233506116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:49,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:49,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:01:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542913964] [2022-04-08 06:01:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:49,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 06:01:49,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:49,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:49,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:49,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:01:49,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:01:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:49,153 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:49,509 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-08 06:01:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:01:49,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 06:01:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:01:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:01:49,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 06:01:49,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:49,640 INFO L225 Difference]: With dead ends: 132 [2022-04-08 06:01:49,640 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 06:01:49,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:01:49,641 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:49,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 162 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 06:01:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-08 06:01:49,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:49,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:49,732 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:49,732 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:49,740 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:01:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:01:49,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:49,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:49,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:01:49,741 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:01:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:49,743 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:01:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:01:49,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:49,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:49,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:49,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 06:01:49,751 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-08 06:01:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:49,751 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 06:01:49,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:49,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 06:01:51,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:01:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 06:01:51,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:51,837 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:51,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:52,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 06:01:52,037 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-08 06:01:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:52,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991747456] [2022-04-08 06:01:52,038 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-08 06:01:52,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:52,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35660794] [2022-04-08 06:01:52,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:52,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:52,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:52,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072011511] [2022-04-08 06:01:52,055 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:52,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:52,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:52,084 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:52,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 06:01:52,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 06:01:52,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:52,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:01:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:52,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:52,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {7920#true} call ULTIMATE.init(); {7920#true} is VALID [2022-04-08 06:01:52,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {7920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7928#(<= ~counter~0 0)} {7920#true} #102#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {7928#(<= ~counter~0 0)} call #t~ret9 := main(); {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {7928#(<= ~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; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {7928#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {7928#(<= ~counter~0 0)} ~cond := #in~cond; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {7928#(<= ~counter~0 0)} assume !(0 == ~cond); {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7928#(<= ~counter~0 0)} {7928#(<= ~counter~0 0)} #90#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {7928#(<= ~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)); {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {7928#(<= ~counter~0 0)} ~cond := #in~cond; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {7928#(<= ~counter~0 0)} assume !(0 == ~cond); {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,560 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7928#(<= ~counter~0 0)} {7928#(<= ~counter~0 0)} #92#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {7928#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7928#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:52,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {7928#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {7977#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,561 INFO L272 TraceCheckUtils]: 19: Hoare triple {7977#(<= ~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)); {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {7977#(<= ~counter~0 1)} ~cond := #in~cond; {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {7977#(<= ~counter~0 1)} assume !(0 == ~cond); {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {7977#(<= ~counter~0 1)} assume true; {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,563 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7977#(<= ~counter~0 1)} {7977#(<= ~counter~0 1)} #94#return; {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {7977#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7977#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:52,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {7977#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {8002#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {8002#(<= ~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)); {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {8002#(<= ~counter~0 2)} ~cond := #in~cond; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {8002#(<= ~counter~0 2)} assume !(0 == ~cond); {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {8002#(<= ~counter~0 2)} assume true; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,566 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8002#(<= ~counter~0 2)} {8002#(<= ~counter~0 2)} #96#return; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,566 INFO L290 TraceCheckUtils]: 32: Hoare triple {8002#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8002#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:52,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {8002#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {8027#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,567 INFO L272 TraceCheckUtils]: 35: Hoare triple {8027#(<= ~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)); {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {8027#(<= ~counter~0 3)} ~cond := #in~cond; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {8027#(<= ~counter~0 3)} assume !(0 == ~cond); {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {8027#(<= ~counter~0 3)} assume true; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,569 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8027#(<= ~counter~0 3)} {8027#(<= ~counter~0 3)} #96#return; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {8027#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8027#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:52,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {8027#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {8052#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,570 INFO L272 TraceCheckUtils]: 43: Hoare triple {8052#(<= ~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)); {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {8052#(<= ~counter~0 4)} ~cond := #in~cond; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {8052#(<= ~counter~0 4)} assume !(0 == ~cond); {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {8052#(<= ~counter~0 4)} assume true; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,572 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8052#(<= ~counter~0 4)} {8052#(<= ~counter~0 4)} #96#return; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {8052#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8052#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:52,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {8052#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8077#(<= |main_#t~post7| 4)} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {8077#(<= |main_#t~post7| 4)} assume !(#t~post7 < 100);havoc #t~post7; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {7921#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {7921#false} assume !(#t~post8 < 100);havoc #t~post8; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {7921#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {7921#false} assume !(#t~post6 < 100);havoc #t~post6; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L272 TraceCheckUtils]: 55: Hoare triple {7921#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {7921#false} ~cond := #in~cond; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {7921#false} assume 0 == ~cond; {7921#false} is VALID [2022-04-08 06:01:52,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {7921#false} assume !false; {7921#false} is VALID [2022-04-08 06:01:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:52,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {7921#false} assume !false; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {7921#false} assume 0 == ~cond; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {7921#false} ~cond := #in~cond; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L272 TraceCheckUtils]: 55: Hoare triple {7921#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {7921#false} assume !(#t~post6 < 100);havoc #t~post6; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {7921#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {7921#false} assume !(#t~post8 < 100);havoc #t~post8; {7921#false} is VALID [2022-04-08 06:01:52,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {7921#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7921#false} is VALID [2022-04-08 06:01:52,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {8129#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {7921#false} is VALID [2022-04-08 06:01:52,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {8133#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8129#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:01:52,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {8133#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8133#(< ~counter~0 100)} is VALID [2022-04-08 06:01:52,956 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7920#true} {8133#(< ~counter~0 100)} #96#return; {8133#(< ~counter~0 100)} is VALID [2022-04-08 06:01:52,956 INFO L290 TraceCheckUtils]: 46: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,956 INFO L272 TraceCheckUtils]: 43: Hoare triple {8133#(< ~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)); {7920#true} is VALID [2022-04-08 06:01:52,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {8133#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {8133#(< ~counter~0 100)} is VALID [2022-04-08 06:01:52,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {8158#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8133#(< ~counter~0 100)} is VALID [2022-04-08 06:01:52,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {8158#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8158#(< ~counter~0 99)} is VALID [2022-04-08 06:01:52,958 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7920#true} {8158#(< ~counter~0 99)} #96#return; {8158#(< ~counter~0 99)} is VALID [2022-04-08 06:01:52,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {8158#(< ~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)); {7920#true} is VALID [2022-04-08 06:01:52,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {8158#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {8158#(< ~counter~0 99)} is VALID [2022-04-08 06:01:52,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {8183#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8158#(< ~counter~0 99)} is VALID [2022-04-08 06:01:52,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {8183#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8183#(< ~counter~0 98)} is VALID [2022-04-08 06:01:52,977 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7920#true} {8183#(< ~counter~0 98)} #96#return; {8183#(< ~counter~0 98)} is VALID [2022-04-08 06:01:52,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,977 INFO L272 TraceCheckUtils]: 27: Hoare triple {8183#(< ~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)); {7920#true} is VALID [2022-04-08 06:01:52,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {8183#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {8183#(< ~counter~0 98)} is VALID [2022-04-08 06:01:52,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {8208#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8183#(< ~counter~0 98)} is VALID [2022-04-08 06:01:52,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {8208#(< ~counter~0 97)} assume !!(0 != ~r~0); {8208#(< ~counter~0 97)} is VALID [2022-04-08 06:01:52,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7920#true} {8208#(< ~counter~0 97)} #94#return; {8208#(< ~counter~0 97)} is VALID [2022-04-08 06:01:52,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {8208#(< ~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)); {7920#true} is VALID [2022-04-08 06:01:52,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {8208#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {8208#(< ~counter~0 97)} is VALID [2022-04-08 06:01:52,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {8233#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8208#(< ~counter~0 97)} is VALID [2022-04-08 06:01:52,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {8233#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,981 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7920#true} {8233#(< ~counter~0 96)} #92#return; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,981 INFO L272 TraceCheckUtils]: 11: Hoare triple {8233#(< ~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)); {7920#true} is VALID [2022-04-08 06:01:52,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7920#true} {8233#(< ~counter~0 96)} #90#return; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-08 06:01:52,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-08 06:01:52,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-08 06:01:52,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {8233#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7920#true} is VALID [2022-04-08 06:01:52,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#(< ~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; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#(< ~counter~0 96)} call #t~ret9 := main(); {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#(< ~counter~0 96)} {7920#true} #102#return; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#(< ~counter~0 96)} assume true; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {7920#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8233#(< ~counter~0 96)} is VALID [2022-04-08 06:01:52,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {7920#true} call ULTIMATE.init(); {7920#true} is VALID [2022-04-08 06:01:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 06:01:52,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:52,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35660794] [2022-04-08 06:01:52,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:52,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072011511] [2022-04-08 06:01:52,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072011511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:52,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:52,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:01:52,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:52,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991747456] [2022-04-08 06:01:52,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991747456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:52,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:52,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:01:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166116254] [2022-04-08 06:01:52,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:01:52,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:52,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:53,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:53,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:01:53,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:01:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:53,056 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:53,348 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-08 06:01:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:01:53,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:01:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:01:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:01:53,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-08 06:01:53,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:53,448 INFO L225 Difference]: With dead ends: 133 [2022-04-08 06:01:53,448 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 06:01:53,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:01:53,449 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:53,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 06:01:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 06:01:53,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:53,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:53,531 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:53,531 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:53,552 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:01:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:01:53,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:53,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:53,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:01:53,553 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:01:53,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:53,555 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:01:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:01:53,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:53,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:53,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:53,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:01:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-08 06:01:53,559 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-08 06:01:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:53,559 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-08 06:01:53,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:01:53,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-08 06:01:55,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:01:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 06:01:55,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:55,249 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:55,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:55,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 06:01:55,450 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-08 06:01:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455747846] [2022-04-08 06:01:55,450 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-08 06:01:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835055251] [2022-04-08 06:01:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:55,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:55,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145018184] [2022-04-08 06:01:55,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:01:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:55,477 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:55,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 06:01:55,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:01:55,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:55,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:01:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:55,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:56,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {8943#true} call ULTIMATE.init(); {8943#true} is VALID [2022-04-08 06:01:56,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {8943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8951#(<= ~counter~0 0)} {8943#true} #102#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {8951#(<= ~counter~0 0)} call #t~ret9 := main(); {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {8951#(<= ~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; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {8951#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {8951#(<= ~counter~0 0)} ~cond := #in~cond; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {8951#(<= ~counter~0 0)} assume !(0 == ~cond); {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8951#(<= ~counter~0 0)} {8951#(<= ~counter~0 0)} #90#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,192 INFO L272 TraceCheckUtils]: 11: Hoare triple {8951#(<= ~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)); {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {8951#(<= ~counter~0 0)} ~cond := #in~cond; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {8951#(<= ~counter~0 0)} assume !(0 == ~cond); {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8951#(<= ~counter~0 0)} {8951#(<= ~counter~0 0)} #92#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {8951#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8951#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:56,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {8951#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {9000#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,195 INFO L272 TraceCheckUtils]: 19: Hoare triple {9000#(<= ~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)); {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {9000#(<= ~counter~0 1)} ~cond := #in~cond; {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {9000#(<= ~counter~0 1)} assume !(0 == ~cond); {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {9000#(<= ~counter~0 1)} assume true; {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,196 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9000#(<= ~counter~0 1)} {9000#(<= ~counter~0 1)} #94#return; {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {9000#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9000#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:56,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {9000#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {9025#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,198 INFO L272 TraceCheckUtils]: 27: Hoare triple {9025#(<= ~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)); {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {9025#(<= ~counter~0 2)} ~cond := #in~cond; {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {9025#(<= ~counter~0 2)} assume !(0 == ~cond); {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {9025#(<= ~counter~0 2)} assume true; {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,199 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9025#(<= ~counter~0 2)} {9025#(<= ~counter~0 2)} #96#return; {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {9025#(<= ~counter~0 2)} assume !(~r~0 > 0); {9025#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:56,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {9025#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {9050#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,201 INFO L272 TraceCheckUtils]: 35: Hoare triple {9050#(<= ~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)); {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {9050#(<= ~counter~0 3)} ~cond := #in~cond; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {9050#(<= ~counter~0 3)} assume !(0 == ~cond); {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {9050#(<= ~counter~0 3)} assume true; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,202 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9050#(<= ~counter~0 3)} {9050#(<= ~counter~0 3)} #98#return; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {9050#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9050#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:56,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {9050#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {9075#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,208 INFO L272 TraceCheckUtils]: 43: Hoare triple {9075#(<= ~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)); {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {9075#(<= ~counter~0 4)} ~cond := #in~cond; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {9075#(<= ~counter~0 4)} assume !(0 == ~cond); {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {9075#(<= ~counter~0 4)} assume true; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,209 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9075#(<= ~counter~0 4)} {9075#(<= ~counter~0 4)} #98#return; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {9075#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9075#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:56,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {9075#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {9100#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,211 INFO L272 TraceCheckUtils]: 51: Hoare triple {9100#(<= ~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)); {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {9100#(<= ~counter~0 5)} ~cond := #in~cond; {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {9100#(<= ~counter~0 5)} assume !(0 == ~cond); {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {9100#(<= ~counter~0 5)} assume true; {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,212 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9100#(<= ~counter~0 5)} {9100#(<= ~counter~0 5)} #98#return; {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {9100#(<= ~counter~0 5)} assume !(~r~0 < 0); {9100#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:56,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {9100#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9125#(<= |main_#t~post6| 5)} is VALID [2022-04-08 06:01:56,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {9125#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {8944#false} is VALID [2022-04-08 06:01:56,214 INFO L272 TraceCheckUtils]: 59: Hoare triple {8944#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8944#false} is VALID [2022-04-08 06:01:56,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {8944#false} ~cond := #in~cond; {8944#false} is VALID [2022-04-08 06:01:56,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {8944#false} assume 0 == ~cond; {8944#false} is VALID [2022-04-08 06:01:56,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {8944#false} assume !false; {8944#false} is VALID [2022-04-08 06:01:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:56,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:56,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {8944#false} assume !false; {8944#false} is VALID [2022-04-08 06:01:56,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {8944#false} assume 0 == ~cond; {8944#false} is VALID [2022-04-08 06:01:56,601 INFO L290 TraceCheckUtils]: 60: Hoare triple {8944#false} ~cond := #in~cond; {8944#false} is VALID [2022-04-08 06:01:56,601 INFO L272 TraceCheckUtils]: 59: Hoare triple {8944#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8944#false} is VALID [2022-04-08 06:01:56,601 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {8944#false} is VALID [2022-04-08 06:01:56,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {9157#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:01:56,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {9157#(< ~counter~0 100)} assume !(~r~0 < 0); {9157#(< ~counter~0 100)} is VALID [2022-04-08 06:01:56,602 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8943#true} {9157#(< ~counter~0 100)} #98#return; {9157#(< ~counter~0 100)} is VALID [2022-04-08 06:01:56,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,602 INFO L272 TraceCheckUtils]: 51: Hoare triple {9157#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {9157#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {9157#(< ~counter~0 100)} is VALID [2022-04-08 06:01:56,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {9182#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9157#(< ~counter~0 100)} is VALID [2022-04-08 06:01:56,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {9182#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9182#(< ~counter~0 99)} is VALID [2022-04-08 06:01:56,604 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8943#true} {9182#(< ~counter~0 99)} #98#return; {9182#(< ~counter~0 99)} is VALID [2022-04-08 06:01:56,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,604 INFO L272 TraceCheckUtils]: 43: Hoare triple {9182#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {9182#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {9182#(< ~counter~0 99)} is VALID [2022-04-08 06:01:56,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {9207#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9182#(< ~counter~0 99)} is VALID [2022-04-08 06:01:56,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {9207#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9207#(< ~counter~0 98)} is VALID [2022-04-08 06:01:56,606 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8943#true} {9207#(< ~counter~0 98)} #98#return; {9207#(< ~counter~0 98)} is VALID [2022-04-08 06:01:56,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,606 INFO L272 TraceCheckUtils]: 35: Hoare triple {9207#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {9207#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {9207#(< ~counter~0 98)} is VALID [2022-04-08 06:01:56,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {9232#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9207#(< ~counter~0 98)} is VALID [2022-04-08 06:01:56,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {9232#(< ~counter~0 97)} assume !(~r~0 > 0); {9232#(< ~counter~0 97)} is VALID [2022-04-08 06:01:56,607 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8943#true} {9232#(< ~counter~0 97)} #96#return; {9232#(< ~counter~0 97)} is VALID [2022-04-08 06:01:56,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {9232#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {9232#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {9232#(< ~counter~0 97)} is VALID [2022-04-08 06:01:56,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {9257#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9232#(< ~counter~0 97)} is VALID [2022-04-08 06:01:56,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {9257#(< ~counter~0 96)} assume !!(0 != ~r~0); {9257#(< ~counter~0 96)} is VALID [2022-04-08 06:01:56,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8943#true} {9257#(< ~counter~0 96)} #94#return; {9257#(< ~counter~0 96)} is VALID [2022-04-08 06:01:56,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {9257#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {9257#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9257#(< ~counter~0 96)} is VALID [2022-04-08 06:01:56,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {9282#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9257#(< ~counter~0 96)} is VALID [2022-04-08 06:01:56,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {9282#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8943#true} {9282#(< ~counter~0 95)} #92#return; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,611 INFO L272 TraceCheckUtils]: 11: Hoare triple {9282#(< ~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)); {8943#true} is VALID [2022-04-08 06:01:56,611 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8943#true} {9282#(< ~counter~0 95)} #90#return; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-08 06:01:56,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-08 06:01:56,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-08 06:01:56,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {9282#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8943#true} is VALID [2022-04-08 06:01:56,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {9282#(< ~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; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {9282#(< ~counter~0 95)} call #t~ret9 := main(); {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9282#(< ~counter~0 95)} {8943#true} #102#return; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {9282#(< ~counter~0 95)} assume true; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {8943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9282#(< ~counter~0 95)} is VALID [2022-04-08 06:01:56,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {8943#true} call ULTIMATE.init(); {8943#true} is VALID [2022-04-08 06:01:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:01:56,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835055251] [2022-04-08 06:01:56,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145018184] [2022-04-08 06:01:56,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145018184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:56,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:56,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:01:56,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455747846] [2022-04-08 06:01:56,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455747846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:56,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:56,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:01:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904698873] [2022-04-08 06:01:56,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 06:01:56,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:56,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:56,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:56,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:01:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:01:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:01:56,657 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:57,106 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-08 06:01:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:01:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 06:01:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:01:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:01:57,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-08 06:01:57,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:57,192 INFO L225 Difference]: With dead ends: 116 [2022-04-08 06:01:57,192 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 06:01:57,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:01:57,193 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:57,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 164 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 06:01:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-08 06:01:57,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:57,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:01:57,446 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:01:57,447 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:01:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:57,450 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:01:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:01:57,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:57,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:57,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:01:57,451 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:01:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:57,453 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:01:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:01:57,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:57,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:57,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:57,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:01:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 06:01:57,455 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-08 06:01:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:57,455 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 06:01:57,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:57,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 06:01:58,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 06:01:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 06:01:58,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:58,356 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:58,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:58,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:58,557 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-08 06:01:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1720027139] [2022-04-08 06:01:58,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-08 06:01:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307219446] [2022-04-08 06:01:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:58,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:58,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281530920] [2022-04-08 06:01:58,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:58,736 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:58,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 06:01:58,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:01:58,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:58,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:01:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:58,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:59,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {10006#true} call ULTIMATE.init(); {10006#true} is VALID [2022-04-08 06:01:59,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {10006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10014#(<= ~counter~0 0)} {10006#true} #102#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {10014#(<= ~counter~0 0)} call #t~ret9 := main(); {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {10014#(<= ~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; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {10014#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(<= ~counter~0 0)} ~cond := #in~cond; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {10014#(<= ~counter~0 0)} assume !(0 == ~cond); {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10014#(<= ~counter~0 0)} {10014#(<= ~counter~0 0)} #90#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,299 INFO L272 TraceCheckUtils]: 11: Hoare triple {10014#(<= ~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)); {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {10014#(<= ~counter~0 0)} ~cond := #in~cond; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {10014#(<= ~counter~0 0)} assume !(0 == ~cond); {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,301 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10014#(<= ~counter~0 0)} {10014#(<= ~counter~0 0)} #92#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {10014#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10014#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:59,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {10014#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {10063#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,302 INFO L272 TraceCheckUtils]: 19: Hoare triple {10063#(<= ~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)); {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(<= ~counter~0 1)} ~cond := #in~cond; {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(<= ~counter~0 1)} assume !(0 == ~cond); {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {10063#(<= ~counter~0 1)} assume true; {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,304 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10063#(<= ~counter~0 1)} {10063#(<= ~counter~0 1)} #94#return; {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {10063#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10063#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:59,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {10063#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {10088#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,305 INFO L272 TraceCheckUtils]: 27: Hoare triple {10088#(<= ~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)); {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {10088#(<= ~counter~0 2)} ~cond := #in~cond; {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {10088#(<= ~counter~0 2)} assume !(0 == ~cond); {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {10088#(<= ~counter~0 2)} assume true; {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,306 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10088#(<= ~counter~0 2)} {10088#(<= ~counter~0 2)} #96#return; {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {10088#(<= ~counter~0 2)} assume !(~r~0 > 0); {10088#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:59,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {10088#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {10113#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,308 INFO L272 TraceCheckUtils]: 35: Hoare triple {10113#(<= ~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)); {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {10113#(<= ~counter~0 3)} ~cond := #in~cond; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {10113#(<= ~counter~0 3)} assume !(0 == ~cond); {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {10113#(<= ~counter~0 3)} assume true; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,309 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10113#(<= ~counter~0 3)} {10113#(<= ~counter~0 3)} #98#return; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {10113#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10113#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:59,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {10113#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {10138#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,311 INFO L272 TraceCheckUtils]: 43: Hoare triple {10138#(<= ~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)); {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {10138#(<= ~counter~0 4)} ~cond := #in~cond; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {10138#(<= ~counter~0 4)} assume !(0 == ~cond); {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {10138#(<= ~counter~0 4)} assume true; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,312 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10138#(<= ~counter~0 4)} {10138#(<= ~counter~0 4)} #98#return; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {10138#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10138#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:59,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {10138#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {10163#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,317 INFO L272 TraceCheckUtils]: 51: Hoare triple {10163#(<= ~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)); {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {10163#(<= ~counter~0 5)} ~cond := #in~cond; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {10163#(<= ~counter~0 5)} assume !(0 == ~cond); {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {10163#(<= ~counter~0 5)} assume true; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,318 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10163#(<= ~counter~0 5)} {10163#(<= ~counter~0 5)} #98#return; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {10163#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10163#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:59,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {10163#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10188#(<= |main_#t~post8| 5)} is VALID [2022-04-08 06:01:59,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {10188#(<= |main_#t~post8| 5)} assume !(#t~post8 < 100);havoc #t~post8; {10007#false} is VALID [2022-04-08 06:01:59,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {10007#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10007#false} is VALID [2022-04-08 06:01:59,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {10007#false} assume !(#t~post6 < 100);havoc #t~post6; {10007#false} is VALID [2022-04-08 06:01:59,320 INFO L272 TraceCheckUtils]: 61: Hoare triple {10007#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10007#false} is VALID [2022-04-08 06:01:59,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {10007#false} ~cond := #in~cond; {10007#false} is VALID [2022-04-08 06:01:59,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {10007#false} assume 0 == ~cond; {10007#false} is VALID [2022-04-08 06:01:59,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {10007#false} assume !false; {10007#false} is VALID [2022-04-08 06:01:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:59,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:59,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {10007#false} assume !false; {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L290 TraceCheckUtils]: 63: Hoare triple {10007#false} assume 0 == ~cond; {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L290 TraceCheckUtils]: 62: Hoare triple {10007#false} ~cond := #in~cond; {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L272 TraceCheckUtils]: 61: Hoare triple {10007#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L290 TraceCheckUtils]: 60: Hoare triple {10007#false} assume !(#t~post6 < 100);havoc #t~post6; {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L290 TraceCheckUtils]: 59: Hoare triple {10007#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10007#false} is VALID [2022-04-08 06:01:59,666 INFO L290 TraceCheckUtils]: 58: Hoare triple {10228#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {10007#false} is VALID [2022-04-08 06:01:59,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {10232#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10228#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:01:59,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {10232#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10232#(< ~counter~0 100)} is VALID [2022-04-08 06:01:59,671 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10006#true} {10232#(< ~counter~0 100)} #98#return; {10232#(< ~counter~0 100)} is VALID [2022-04-08 06:01:59,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,671 INFO L272 TraceCheckUtils]: 51: Hoare triple {10232#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {10232#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {10232#(< ~counter~0 100)} is VALID [2022-04-08 06:01:59,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {10257#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10232#(< ~counter~0 100)} is VALID [2022-04-08 06:01:59,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {10257#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10257#(< ~counter~0 99)} is VALID [2022-04-08 06:01:59,672 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10006#true} {10257#(< ~counter~0 99)} #98#return; {10257#(< ~counter~0 99)} is VALID [2022-04-08 06:01:59,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,673 INFO L272 TraceCheckUtils]: 43: Hoare triple {10257#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {10257#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {10257#(< ~counter~0 99)} is VALID [2022-04-08 06:01:59,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {10282#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10257#(< ~counter~0 99)} is VALID [2022-04-08 06:01:59,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {10282#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10282#(< ~counter~0 98)} is VALID [2022-04-08 06:01:59,674 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10006#true} {10282#(< ~counter~0 98)} #98#return; {10282#(< ~counter~0 98)} is VALID [2022-04-08 06:01:59,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {10282#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {10282#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {10282#(< ~counter~0 98)} is VALID [2022-04-08 06:01:59,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {10307#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10282#(< ~counter~0 98)} is VALID [2022-04-08 06:01:59,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {10307#(< ~counter~0 97)} assume !(~r~0 > 0); {10307#(< ~counter~0 97)} is VALID [2022-04-08 06:01:59,676 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10006#true} {10307#(< ~counter~0 97)} #96#return; {10307#(< ~counter~0 97)} is VALID [2022-04-08 06:01:59,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,676 INFO L272 TraceCheckUtils]: 27: Hoare triple {10307#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {10307#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {10307#(< ~counter~0 97)} is VALID [2022-04-08 06:01:59,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {10332#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10307#(< ~counter~0 97)} is VALID [2022-04-08 06:01:59,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {10332#(< ~counter~0 96)} assume !!(0 != ~r~0); {10332#(< ~counter~0 96)} is VALID [2022-04-08 06:01:59,678 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10006#true} {10332#(< ~counter~0 96)} #94#return; {10332#(< ~counter~0 96)} is VALID [2022-04-08 06:01:59,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {10332#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {10332#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {10332#(< ~counter~0 96)} is VALID [2022-04-08 06:01:59,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {10357#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10332#(< ~counter~0 96)} is VALID [2022-04-08 06:01:59,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {10357#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10006#true} {10357#(< ~counter~0 95)} #92#return; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {10357#(< ~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)); {10006#true} is VALID [2022-04-08 06:01:59,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10006#true} {10357#(< ~counter~0 95)} #90#return; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-08 06:01:59,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-08 06:01:59,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-08 06:01:59,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {10357#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10006#true} is VALID [2022-04-08 06:01:59,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {10357#(< ~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; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {10357#(< ~counter~0 95)} call #t~ret9 := main(); {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10357#(< ~counter~0 95)} {10006#true} #102#return; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {10357#(< ~counter~0 95)} assume true; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {10006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10357#(< ~counter~0 95)} is VALID [2022-04-08 06:01:59,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {10006#true} call ULTIMATE.init(); {10006#true} is VALID [2022-04-08 06:01:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:01:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:59,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307219446] [2022-04-08 06:01:59,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:59,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281530920] [2022-04-08 06:01:59,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281530920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:59,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:59,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:01:59,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:59,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1720027139] [2022-04-08 06:01:59,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1720027139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:59,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:59,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:01:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718798274] [2022-04-08 06:01:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 06:01:59,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:59,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:01:59,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:59,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:01:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:01:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:01:59,731 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:00,148 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-08 06:02:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:02:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 06:02:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:02:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:02:00,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-08 06:02:00,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:00,247 INFO L225 Difference]: With dead ends: 149 [2022-04-08 06:02:00,247 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 06:02:00,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:02:00,248 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:00,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 164 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 06:02:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-08 06:02:00,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:00,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:00,337 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:00,337 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:00,342 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:02:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:02:00,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:00,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:00,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:02:00,343 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:02:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:00,345 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:02:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:02:00,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:00,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:00,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:00,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 06:02:00,348 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-08 06:02:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:00,349 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 06:02:00,349 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:00,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 06:02:01,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 06:02:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 06:02:01,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:01,600 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:01,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:01,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 06:02:01,800 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-08 06:02:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:01,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705238767] [2022-04-08 06:02:01,801 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-08 06:02:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:01,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834110561] [2022-04-08 06:02:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:01,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:01,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254624342] [2022-04-08 06:02:01,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:01,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:01,817 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:01,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 06:02:01,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:01,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:01,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:02:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:01,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:02,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {11157#true} call ULTIMATE.init(); {11157#true} is VALID [2022-04-08 06:02:02,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {11157#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11165#(<= ~counter~0 0)} {11157#true} #102#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {11165#(<= ~counter~0 0)} call #t~ret9 := main(); {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {11165#(<= ~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; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {11165#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {11165#(<= ~counter~0 0)} ~cond := #in~cond; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {11165#(<= ~counter~0 0)} assume !(0 == ~cond); {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11165#(<= ~counter~0 0)} {11165#(<= ~counter~0 0)} #90#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {11165#(<= ~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)); {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {11165#(<= ~counter~0 0)} ~cond := #in~cond; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {11165#(<= ~counter~0 0)} assume !(0 == ~cond); {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11165#(<= ~counter~0 0)} {11165#(<= ~counter~0 0)} #92#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {11165#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11165#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:02,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {11165#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {11214#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {11214#(<= ~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)); {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {11214#(<= ~counter~0 1)} ~cond := #in~cond; {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {11214#(<= ~counter~0 1)} assume !(0 == ~cond); {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {11214#(<= ~counter~0 1)} assume true; {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,229 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11214#(<= ~counter~0 1)} {11214#(<= ~counter~0 1)} #94#return; {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {11214#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11214#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:02,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {11214#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {11239#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,230 INFO L272 TraceCheckUtils]: 27: Hoare triple {11239#(<= ~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)); {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {11239#(<= ~counter~0 2)} ~cond := #in~cond; {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {11239#(<= ~counter~0 2)} assume !(0 == ~cond); {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {11239#(<= ~counter~0 2)} assume true; {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,232 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11239#(<= ~counter~0 2)} {11239#(<= ~counter~0 2)} #96#return; {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {11239#(<= ~counter~0 2)} assume !(~r~0 > 0); {11239#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:02,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {11239#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {11264#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,233 INFO L272 TraceCheckUtils]: 35: Hoare triple {11264#(<= ~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)); {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {11264#(<= ~counter~0 3)} ~cond := #in~cond; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {11264#(<= ~counter~0 3)} assume !(0 == ~cond); {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {11264#(<= ~counter~0 3)} assume true; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,234 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11264#(<= ~counter~0 3)} {11264#(<= ~counter~0 3)} #98#return; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {11264#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11264#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:02,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {11264#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {11289#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,235 INFO L272 TraceCheckUtils]: 43: Hoare triple {11289#(<= ~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)); {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {11289#(<= ~counter~0 4)} ~cond := #in~cond; {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {11289#(<= ~counter~0 4)} assume !(0 == ~cond); {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {11289#(<= ~counter~0 4)} assume true; {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,236 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11289#(<= ~counter~0 4)} {11289#(<= ~counter~0 4)} #98#return; {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {11289#(<= ~counter~0 4)} assume !(~r~0 < 0); {11289#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:02,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {11289#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {11314#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,237 INFO L272 TraceCheckUtils]: 51: Hoare triple {11314#(<= ~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)); {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {11314#(<= ~counter~0 5)} ~cond := #in~cond; {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {11314#(<= ~counter~0 5)} assume !(0 == ~cond); {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {11314#(<= ~counter~0 5)} assume true; {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,238 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11314#(<= ~counter~0 5)} {11314#(<= ~counter~0 5)} #94#return; {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {11314#(<= ~counter~0 5)} assume !!(0 != ~r~0); {11314#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {11314#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11339#(<= |main_#t~post7| 5)} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {11339#(<= |main_#t~post7| 5)} assume !(#t~post7 < 100);havoc #t~post7; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {11158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#false} assume !(#t~post8 < 100);havoc #t~post8; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {11158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {11158#false} assume !(#t~post6 < 100);havoc #t~post6; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L272 TraceCheckUtils]: 63: Hoare triple {11158#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {11158#false} ~cond := #in~cond; {11158#false} is VALID [2022-04-08 06:02:02,239 INFO L290 TraceCheckUtils]: 65: Hoare triple {11158#false} assume 0 == ~cond; {11158#false} is VALID [2022-04-08 06:02:02,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {11158#false} assume !false; {11158#false} is VALID [2022-04-08 06:02:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:02,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {11158#false} assume !false; {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {11158#false} assume 0 == ~cond; {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 64: Hoare triple {11158#false} ~cond := #in~cond; {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L272 TraceCheckUtils]: 63: Hoare triple {11158#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {11158#false} assume !(#t~post6 < 100);havoc #t~post6; {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 61: Hoare triple {11158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11158#false} is VALID [2022-04-08 06:02:02,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#false} assume !(#t~post8 < 100);havoc #t~post8; {11158#false} is VALID [2022-04-08 06:02:02,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {11158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11158#false} is VALID [2022-04-08 06:02:02,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {11391#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {11158#false} is VALID [2022-04-08 06:02:02,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {11395#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11391#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:02:02,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {11395#(< ~counter~0 100)} assume !!(0 != ~r~0); {11395#(< ~counter~0 100)} is VALID [2022-04-08 06:02:02,448 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11157#true} {11395#(< ~counter~0 100)} #94#return; {11395#(< ~counter~0 100)} is VALID [2022-04-08 06:02:02,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,449 INFO L272 TraceCheckUtils]: 51: Hoare triple {11395#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {11395#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {11395#(< ~counter~0 100)} is VALID [2022-04-08 06:02:02,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {11420#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11395#(< ~counter~0 100)} is VALID [2022-04-08 06:02:02,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {11420#(< ~counter~0 99)} assume !(~r~0 < 0); {11420#(< ~counter~0 99)} is VALID [2022-04-08 06:02:02,450 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11157#true} {11420#(< ~counter~0 99)} #98#return; {11420#(< ~counter~0 99)} is VALID [2022-04-08 06:02:02,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,450 INFO L272 TraceCheckUtils]: 43: Hoare triple {11420#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {11420#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {11420#(< ~counter~0 99)} is VALID [2022-04-08 06:02:02,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {11445#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11420#(< ~counter~0 99)} is VALID [2022-04-08 06:02:02,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {11445#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11445#(< ~counter~0 98)} is VALID [2022-04-08 06:02:02,451 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11157#true} {11445#(< ~counter~0 98)} #98#return; {11445#(< ~counter~0 98)} is VALID [2022-04-08 06:02:02,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,451 INFO L272 TraceCheckUtils]: 35: Hoare triple {11445#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {11445#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {11445#(< ~counter~0 98)} is VALID [2022-04-08 06:02:02,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {11470#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11445#(< ~counter~0 98)} is VALID [2022-04-08 06:02:02,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {11470#(< ~counter~0 97)} assume !(~r~0 > 0); {11470#(< ~counter~0 97)} is VALID [2022-04-08 06:02:02,453 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11157#true} {11470#(< ~counter~0 97)} #96#return; {11470#(< ~counter~0 97)} is VALID [2022-04-08 06:02:02,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {11470#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {11470#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {11470#(< ~counter~0 97)} is VALID [2022-04-08 06:02:02,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {11495#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11470#(< ~counter~0 97)} is VALID [2022-04-08 06:02:02,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {11495#(< ~counter~0 96)} assume !!(0 != ~r~0); {11495#(< ~counter~0 96)} is VALID [2022-04-08 06:02:02,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11157#true} {11495#(< ~counter~0 96)} #94#return; {11495#(< ~counter~0 96)} is VALID [2022-04-08 06:02:02,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {11495#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {11495#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {11495#(< ~counter~0 96)} is VALID [2022-04-08 06:02:02,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {11520#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11495#(< ~counter~0 96)} is VALID [2022-04-08 06:02:02,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {11520#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11157#true} {11520#(< ~counter~0 95)} #92#return; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {11520#(< ~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)); {11157#true} is VALID [2022-04-08 06:02:02,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11157#true} {11520#(< ~counter~0 95)} #90#return; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-08 06:02:02,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-08 06:02:02,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-08 06:02:02,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {11520#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11157#true} is VALID [2022-04-08 06:02:02,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {11520#(< ~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; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {11520#(< ~counter~0 95)} call #t~ret9 := main(); {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11520#(< ~counter~0 95)} {11157#true} #102#return; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {11520#(< ~counter~0 95)} assume true; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {11157#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11520#(< ~counter~0 95)} is VALID [2022-04-08 06:02:02,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {11157#true} call ULTIMATE.init(); {11157#true} is VALID [2022-04-08 06:02:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:02:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834110561] [2022-04-08 06:02:02,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254624342] [2022-04-08 06:02:02,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254624342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:02,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:02,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 06:02:02,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:02,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705238767] [2022-04-08 06:02:02,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705238767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:02,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:02,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:02:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799933383] [2022-04-08 06:02:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 06:02:02,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:02,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:02,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:02,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:02:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:02:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:02:02,507 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:02,784 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-08 06:02:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:02:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 06:02:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:02:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:02:02,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-08 06:02:02,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:02,849 INFO L225 Difference]: With dead ends: 151 [2022-04-08 06:02:02,849 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 06:02:02,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:02:02,849 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 39 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:02,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 189 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:02,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 06:02:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-08 06:02:02,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:02,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:02,913 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:02,913 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:02,915 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:02:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:02:02,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:02,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:02,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:02:02,916 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:02:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:02,918 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:02:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:02:02,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:02,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:02,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:02,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:02:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-08 06:02:02,930 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-08 06:02:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:02,930 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-08 06:02:02,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:02:02,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-08 06:02:04,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:04,403 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:02:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 06:02:04,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:04,403 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:04,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:04,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 06:02:04,604 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-08 06:02:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:04,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062059195] [2022-04-08 06:02:04,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-08 06:02:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:04,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022621136] [2022-04-08 06:02:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:04,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:04,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576267628] [2022-04-08 06:02:04,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:02:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:04,617 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:04,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 06:02:04,683 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:02:04,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:02:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:05,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {12340#true} call ULTIMATE.init(); {12340#true} is VALID [2022-04-08 06:02:05,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {12340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12348#(<= ~counter~0 0)} {12340#true} #102#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {12348#(<= ~counter~0 0)} call #t~ret9 := main(); {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {12348#(<= ~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; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {12348#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {12348#(<= ~counter~0 0)} ~cond := #in~cond; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {12348#(<= ~counter~0 0)} assume !(0 == ~cond); {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12348#(<= ~counter~0 0)} {12348#(<= ~counter~0 0)} #90#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,214 INFO L272 TraceCheckUtils]: 11: Hoare triple {12348#(<= ~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)); {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {12348#(<= ~counter~0 0)} ~cond := #in~cond; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {12348#(<= ~counter~0 0)} assume !(0 == ~cond); {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,237 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12348#(<= ~counter~0 0)} {12348#(<= ~counter~0 0)} #92#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {12348#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12348#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:05,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {12348#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {12397#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,239 INFO L272 TraceCheckUtils]: 19: Hoare triple {12397#(<= ~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)); {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {12397#(<= ~counter~0 1)} ~cond := #in~cond; {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {12397#(<= ~counter~0 1)} assume !(0 == ~cond); {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {12397#(<= ~counter~0 1)} assume true; {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,241 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12397#(<= ~counter~0 1)} {12397#(<= ~counter~0 1)} #94#return; {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {12397#(<= ~counter~0 1)} assume !!(0 != ~r~0); {12397#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:05,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {12397#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {12422#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,243 INFO L272 TraceCheckUtils]: 27: Hoare triple {12422#(<= ~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)); {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {12422#(<= ~counter~0 2)} ~cond := #in~cond; {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {12422#(<= ~counter~0 2)} assume !(0 == ~cond); {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {12422#(<= ~counter~0 2)} assume true; {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,245 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12422#(<= ~counter~0 2)} {12422#(<= ~counter~0 2)} #96#return; {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {12422#(<= ~counter~0 2)} assume !(~r~0 > 0); {12422#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:05,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {12422#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {12447#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,247 INFO L272 TraceCheckUtils]: 35: Hoare triple {12447#(<= ~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)); {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {12447#(<= ~counter~0 3)} ~cond := #in~cond; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {12447#(<= ~counter~0 3)} assume !(0 == ~cond); {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= ~counter~0 3)} assume true; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,249 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12447#(<= ~counter~0 3)} {12447#(<= ~counter~0 3)} #98#return; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {12447#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12447#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:05,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {12447#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {12472#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,251 INFO L272 TraceCheckUtils]: 43: Hoare triple {12472#(<= ~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)); {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {12472#(<= ~counter~0 4)} ~cond := #in~cond; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {12472#(<= ~counter~0 4)} assume !(0 == ~cond); {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {12472#(<= ~counter~0 4)} assume true; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,253 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12472#(<= ~counter~0 4)} {12472#(<= ~counter~0 4)} #98#return; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {12472#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12472#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:05,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {12472#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {12497#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,255 INFO L272 TraceCheckUtils]: 51: Hoare triple {12497#(<= ~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)); {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,255 INFO L290 TraceCheckUtils]: 52: Hoare triple {12497#(<= ~counter~0 5)} ~cond := #in~cond; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,255 INFO L290 TraceCheckUtils]: 53: Hoare triple {12497#(<= ~counter~0 5)} assume !(0 == ~cond); {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {12497#(<= ~counter~0 5)} assume true; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,256 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12497#(<= ~counter~0 5)} {12497#(<= ~counter~0 5)} #98#return; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {12497#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12497#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:05,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {12497#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {12522#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,259 INFO L272 TraceCheckUtils]: 59: Hoare triple {12522#(<= ~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)); {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {12522#(<= ~counter~0 6)} ~cond := #in~cond; {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {12522#(<= ~counter~0 6)} assume !(0 == ~cond); {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {12522#(<= ~counter~0 6)} assume true; {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,260 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12522#(<= ~counter~0 6)} {12522#(<= ~counter~0 6)} #98#return; {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {12522#(<= ~counter~0 6)} assume !(~r~0 < 0); {12522#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:05,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {12522#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12547#(<= |main_#t~post6| 6)} is VALID [2022-04-08 06:02:05,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {12547#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {12341#false} is VALID [2022-04-08 06:02:05,262 INFO L272 TraceCheckUtils]: 67: Hoare triple {12341#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12341#false} is VALID [2022-04-08 06:02:05,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {12341#false} ~cond := #in~cond; {12341#false} is VALID [2022-04-08 06:02:05,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {12341#false} assume 0 == ~cond; {12341#false} is VALID [2022-04-08 06:02:05,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {12341#false} assume !false; {12341#false} is VALID [2022-04-08 06:02:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:05,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:05,674 INFO L290 TraceCheckUtils]: 70: Hoare triple {12341#false} assume !false; {12341#false} is VALID [2022-04-08 06:02:05,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {12341#false} assume 0 == ~cond; {12341#false} is VALID [2022-04-08 06:02:05,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {12341#false} ~cond := #in~cond; {12341#false} is VALID [2022-04-08 06:02:05,674 INFO L272 TraceCheckUtils]: 67: Hoare triple {12341#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12341#false} is VALID [2022-04-08 06:02:05,674 INFO L290 TraceCheckUtils]: 66: Hoare triple {12575#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {12341#false} is VALID [2022-04-08 06:02:05,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {12579#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12575#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:02:05,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {12579#(< ~counter~0 100)} assume !(~r~0 < 0); {12579#(< ~counter~0 100)} is VALID [2022-04-08 06:02:05,676 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12340#true} {12579#(< ~counter~0 100)} #98#return; {12579#(< ~counter~0 100)} is VALID [2022-04-08 06:02:05,676 INFO L290 TraceCheckUtils]: 62: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,676 INFO L272 TraceCheckUtils]: 59: Hoare triple {12579#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {12579#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {12579#(< ~counter~0 100)} is VALID [2022-04-08 06:02:05,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {12604#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12579#(< ~counter~0 100)} is VALID [2022-04-08 06:02:05,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {12604#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12604#(< ~counter~0 99)} is VALID [2022-04-08 06:02:05,677 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12340#true} {12604#(< ~counter~0 99)} #98#return; {12604#(< ~counter~0 99)} is VALID [2022-04-08 06:02:05,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,678 INFO L272 TraceCheckUtils]: 51: Hoare triple {12604#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,678 INFO L290 TraceCheckUtils]: 50: Hoare triple {12604#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {12604#(< ~counter~0 99)} is VALID [2022-04-08 06:02:05,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {12629#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12604#(< ~counter~0 99)} is VALID [2022-04-08 06:02:05,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {12629#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12629#(< ~counter~0 98)} is VALID [2022-04-08 06:02:05,679 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12340#true} {12629#(< ~counter~0 98)} #98#return; {12629#(< ~counter~0 98)} is VALID [2022-04-08 06:02:05,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,679 INFO L272 TraceCheckUtils]: 43: Hoare triple {12629#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {12629#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {12629#(< ~counter~0 98)} is VALID [2022-04-08 06:02:05,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {12654#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12629#(< ~counter~0 98)} is VALID [2022-04-08 06:02:05,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {12654#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12654#(< ~counter~0 97)} is VALID [2022-04-08 06:02:05,681 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12340#true} {12654#(< ~counter~0 97)} #98#return; {12654#(< ~counter~0 97)} is VALID [2022-04-08 06:02:05,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,681 INFO L272 TraceCheckUtils]: 35: Hoare triple {12654#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {12654#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {12654#(< ~counter~0 97)} is VALID [2022-04-08 06:02:05,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {12679#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12654#(< ~counter~0 97)} is VALID [2022-04-08 06:02:05,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {12679#(< ~counter~0 96)} assume !(~r~0 > 0); {12679#(< ~counter~0 96)} is VALID [2022-04-08 06:02:05,683 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12340#true} {12679#(< ~counter~0 96)} #96#return; {12679#(< ~counter~0 96)} is VALID [2022-04-08 06:02:05,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,683 INFO L272 TraceCheckUtils]: 27: Hoare triple {12679#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {12679#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {12679#(< ~counter~0 96)} is VALID [2022-04-08 06:02:05,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {12704#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12679#(< ~counter~0 96)} is VALID [2022-04-08 06:02:05,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {12704#(< ~counter~0 95)} assume !!(0 != ~r~0); {12704#(< ~counter~0 95)} is VALID [2022-04-08 06:02:05,684 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12340#true} {12704#(< ~counter~0 95)} #94#return; {12704#(< ~counter~0 95)} is VALID [2022-04-08 06:02:05,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {12704#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {12704#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {12704#(< ~counter~0 95)} is VALID [2022-04-08 06:02:05,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {12729#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12704#(< ~counter~0 95)} is VALID [2022-04-08 06:02:05,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {12729#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,686 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12340#true} {12729#(< ~counter~0 94)} #92#return; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,686 INFO L272 TraceCheckUtils]: 11: Hoare triple {12729#(< ~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)); {12340#true} is VALID [2022-04-08 06:02:05,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12340#true} {12729#(< ~counter~0 94)} #90#return; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-08 06:02:05,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-08 06:02:05,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-08 06:02:05,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {12729#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12340#true} is VALID [2022-04-08 06:02:05,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {12729#(< ~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; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {12729#(< ~counter~0 94)} call #t~ret9 := main(); {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12729#(< ~counter~0 94)} {12340#true} #102#return; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {12729#(< ~counter~0 94)} assume true; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {12340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12729#(< ~counter~0 94)} is VALID [2022-04-08 06:02:05,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {12340#true} call ULTIMATE.init(); {12340#true} is VALID [2022-04-08 06:02:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:02:05,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022621136] [2022-04-08 06:02:05,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576267628] [2022-04-08 06:02:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576267628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:05,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:02:05,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:05,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062059195] [2022-04-08 06:02:05,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062059195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:05,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:05,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:02:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368452966] [2022-04-08 06:02:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 06:02:05,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:05,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:05,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:05,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:02:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:02:05,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:02:05,752 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:06,195 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-08 06:02:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:02:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 06:02:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:02:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:02:06,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-08 06:02:06,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:06,298 INFO L225 Difference]: With dead ends: 137 [2022-04-08 06:02:06,298 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 06:02:06,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:02:06,299 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 63 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:06,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 179 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 06:02:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-08 06:02:06,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:06,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:02:06,412 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:02:06,412 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:02:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:06,421 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:02:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:02:06,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:06,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:06,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:02:06,439 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:02:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:06,442 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:02:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:02:06,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:06,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:06,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:06,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:02:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-08 06:02:06,447 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-08 06:02:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:06,447 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-08 06:02:06,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:06,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-08 06:02:08,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 154 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-08 06:02:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:02:08,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:08,629 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:08,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:08,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 06:02:08,830 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-08 06:02:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:08,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620031737] [2022-04-08 06:02:08,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-08 06:02:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:08,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462246026] [2022-04-08 06:02:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:08,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002344805] [2022-04-08 06:02:08,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:08,848 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:08,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 06:02:08,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:08,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:08,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:02:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:08,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:09,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {13577#true} call ULTIMATE.init(); {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {13577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13577#true} {13577#true} #102#return; {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {13577#true} call #t~ret9 := main(); {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {13577#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; {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {13577#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13577#true} is VALID [2022-04-08 06:02:09,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13577#true} {13577#true} #90#return; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L272 TraceCheckUtils]: 11: Hoare triple {13577#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)); {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13577#true} {13577#true} #92#return; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {13577#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13577#true} is VALID [2022-04-08 06:02:09,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {13577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {13577#true} assume !!(#t~post6 < 100);havoc #t~post6; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L272 TraceCheckUtils]: 19: Hoare triple {13577#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)); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13577#true} {13577#true} #94#return; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {13577#true} assume !!(0 != ~r~0); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {13577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {13577#true} assume !!(#t~post7 < 100);havoc #t~post7; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L272 TraceCheckUtils]: 27: Hoare triple {13577#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)); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13577#true} {13577#true} #96#return; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {13577#true} assume !(~r~0 > 0); {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 33: Hoare triple {13577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {13577#true} assume !!(#t~post8 < 100);havoc #t~post8; {13577#true} is VALID [2022-04-08 06:02:09,129 INFO L272 TraceCheckUtils]: 35: Hoare triple {13577#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)); {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13577#true} {13577#true} #98#return; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {13577#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {13577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {13577#true} assume !!(#t~post8 < 100);havoc #t~post8; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L272 TraceCheckUtils]: 43: Hoare triple {13577#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)); {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,130 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13577#true} {13577#true} #98#return; {13577#true} is VALID [2022-04-08 06:02:09,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {13577#true} assume !(~r~0 < 0); {13726#(not (< main_~r~0 0))} is VALID [2022-04-08 06:02:09,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {13726#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13726#(not (< main_~r~0 0))} is VALID [2022-04-08 06:02:09,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {13726#(not (< main_~r~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {13726#(not (< main_~r~0 0))} is VALID [2022-04-08 06:02:09,131 INFO L272 TraceCheckUtils]: 51: Hoare triple {13726#(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)); {13577#true} is VALID [2022-04-08 06:02:09,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,132 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13577#true} {13726#(not (< main_~r~0 0))} #94#return; {13726#(not (< main_~r~0 0))} is VALID [2022-04-08 06:02:09,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {13726#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:09,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:09,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:09,133 INFO L272 TraceCheckUtils]: 59: Hoare triple {13751#(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)); {13577#true} is VALID [2022-04-08 06:02:09,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-08 06:02:09,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-08 06:02:09,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-08 06:02:09,134 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13577#true} {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:09,134 INFO L290 TraceCheckUtils]: 64: Hoare triple {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13578#false} is VALID [2022-04-08 06:02:09,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {13578#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13578#false} is VALID [2022-04-08 06:02:09,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {13578#false} assume !(#t~post8 < 100);havoc #t~post8; {13578#false} is VALID [2022-04-08 06:02:09,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {13578#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13578#false} is VALID [2022-04-08 06:02:09,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {13578#false} assume !(#t~post6 < 100);havoc #t~post6; {13578#false} is VALID [2022-04-08 06:02:09,134 INFO L272 TraceCheckUtils]: 69: Hoare triple {13578#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13578#false} is VALID [2022-04-08 06:02:09,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {13578#false} ~cond := #in~cond; {13578#false} is VALID [2022-04-08 06:02:09,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {13578#false} assume 0 == ~cond; {13578#false} is VALID [2022-04-08 06:02:09,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {13578#false} assume !false; {13578#false} is VALID [2022-04-08 06:02:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-08 06:02:09,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:09,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:09,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462246026] [2022-04-08 06:02:09,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:09,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002344805] [2022-04-08 06:02:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002344805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:09,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:09,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:09,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:09,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620031737] [2022-04-08 06:02:09,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620031737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:09,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:09,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477571952] [2022-04-08 06:02:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 06:02:09,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:09,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:09,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:09,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:02:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:02:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:09,177 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:09,411 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-08 06:02:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:02:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 06:02:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:02:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:02:09,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:02:09,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:09,489 INFO L225 Difference]: With dead ends: 180 [2022-04-08 06:02:09,489 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 06:02:09,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:09,490 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:09,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:02:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 06:02:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-08 06:02:09,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:09,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:09,628 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:09,629 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:09,644 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:02:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:02:09,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:09,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:09,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:02:09,645 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:02:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:09,647 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:02:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:02:09,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:09,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:09,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:09,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-08 06:02:09,650 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-08 06:02:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:09,650 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-08 06:02:09,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:09,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-08 06:02:10,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-08 06:02:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:02:10,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:10,067 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:10,086 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-08 06:02:10,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 06:02:10,268 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-08 06:02:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:10,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800538585] [2022-04-08 06:02:10,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-08 06:02:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:10,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900745349] [2022-04-08 06:02:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:10,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:10,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005245451] [2022-04-08 06:02:10,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:10,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:10,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:10,312 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:10,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 06:02:10,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:10,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:10,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:02:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:10,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:10,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {14719#true} call ULTIMATE.init(); {14719#true} is VALID [2022-04-08 06:02:10,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {14719#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14727#(<= ~counter~0 0)} {14719#true} #102#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {14727#(<= ~counter~0 0)} call #t~ret9 := main(); {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {14727#(<= ~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; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {14727#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {14727#(<= ~counter~0 0)} ~cond := #in~cond; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {14727#(<= ~counter~0 0)} assume !(0 == ~cond); {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14727#(<= ~counter~0 0)} {14727#(<= ~counter~0 0)} #90#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,761 INFO L272 TraceCheckUtils]: 11: Hoare triple {14727#(<= ~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)); {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {14727#(<= ~counter~0 0)} ~cond := #in~cond; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {14727#(<= ~counter~0 0)} assume !(0 == ~cond); {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14727#(<= ~counter~0 0)} {14727#(<= ~counter~0 0)} #92#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {14727#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14727#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:10,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {14727#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {14776#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,764 INFO L272 TraceCheckUtils]: 19: Hoare triple {14776#(<= ~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)); {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {14776#(<= ~counter~0 1)} ~cond := #in~cond; {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {14776#(<= ~counter~0 1)} assume !(0 == ~cond); {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {14776#(<= ~counter~0 1)} assume true; {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,765 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14776#(<= ~counter~0 1)} {14776#(<= ~counter~0 1)} #94#return; {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {14776#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14776#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:10,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {14776#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {14801#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,767 INFO L272 TraceCheckUtils]: 27: Hoare triple {14801#(<= ~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)); {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {14801#(<= ~counter~0 2)} ~cond := #in~cond; {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {14801#(<= ~counter~0 2)} assume !(0 == ~cond); {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {14801#(<= ~counter~0 2)} assume true; {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,768 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14801#(<= ~counter~0 2)} {14801#(<= ~counter~0 2)} #96#return; {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {14801#(<= ~counter~0 2)} assume !(~r~0 > 0); {14801#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:10,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {14801#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {14826#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,770 INFO L272 TraceCheckUtils]: 35: Hoare triple {14826#(<= ~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)); {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {14826#(<= ~counter~0 3)} ~cond := #in~cond; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {14826#(<= ~counter~0 3)} assume !(0 == ~cond); {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {14826#(<= ~counter~0 3)} assume true; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,771 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14826#(<= ~counter~0 3)} {14826#(<= ~counter~0 3)} #98#return; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {14826#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14826#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:10,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {14826#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {14851#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,773 INFO L272 TraceCheckUtils]: 43: Hoare triple {14851#(<= ~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)); {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {14851#(<= ~counter~0 4)} ~cond := #in~cond; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {14851#(<= ~counter~0 4)} assume !(0 == ~cond); {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {14851#(<= ~counter~0 4)} assume true; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,774 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14851#(<= ~counter~0 4)} {14851#(<= ~counter~0 4)} #98#return; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {14851#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14851#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:10,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {14851#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {14876#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,785 INFO L272 TraceCheckUtils]: 51: Hoare triple {14876#(<= ~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)); {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {14876#(<= ~counter~0 5)} ~cond := #in~cond; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {14876#(<= ~counter~0 5)} assume !(0 == ~cond); {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {14876#(<= ~counter~0 5)} assume true; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,786 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14876#(<= ~counter~0 5)} {14876#(<= ~counter~0 5)} #98#return; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {14876#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14876#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:10,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {14876#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,787 INFO L290 TraceCheckUtils]: 58: Hoare triple {14901#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,788 INFO L272 TraceCheckUtils]: 59: Hoare triple {14901#(<= ~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)); {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {14901#(<= ~counter~0 6)} ~cond := #in~cond; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {14901#(<= ~counter~0 6)} assume !(0 == ~cond); {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {14901#(<= ~counter~0 6)} assume true; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,789 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14901#(<= ~counter~0 6)} {14901#(<= ~counter~0 6)} #98#return; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {14901#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14901#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:10,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {14901#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14926#(<= |main_#t~post8| 6)} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {14926#(<= |main_#t~post8| 6)} assume !(#t~post8 < 100);havoc #t~post8; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {14720#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {14720#false} assume !(#t~post6 < 100);havoc #t~post6; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L272 TraceCheckUtils]: 69: Hoare triple {14720#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {14720#false} ~cond := #in~cond; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {14720#false} assume 0 == ~cond; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {14720#false} assume !false; {14720#false} is VALID [2022-04-08 06:02:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:10,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:11,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {14720#false} assume !false; {14720#false} is VALID [2022-04-08 06:02:11,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {14720#false} assume 0 == ~cond; {14720#false} is VALID [2022-04-08 06:02:11,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {14720#false} ~cond := #in~cond; {14720#false} is VALID [2022-04-08 06:02:11,161 INFO L272 TraceCheckUtils]: 69: Hoare triple {14720#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14720#false} is VALID [2022-04-08 06:02:11,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {14720#false} assume !(#t~post6 < 100);havoc #t~post6; {14720#false} is VALID [2022-04-08 06:02:11,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {14720#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14720#false} is VALID [2022-04-08 06:02:11,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {14966#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {14720#false} is VALID [2022-04-08 06:02:11,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {14970#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14966#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:02:11,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {14970#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14970#(< ~counter~0 100)} is VALID [2022-04-08 06:02:11,162 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14719#true} {14970#(< ~counter~0 100)} #98#return; {14970#(< ~counter~0 100)} is VALID [2022-04-08 06:02:11,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,162 INFO L272 TraceCheckUtils]: 59: Hoare triple {14970#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {14970#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {14970#(< ~counter~0 100)} is VALID [2022-04-08 06:02:11,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {14995#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14970#(< ~counter~0 100)} is VALID [2022-04-08 06:02:11,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {14995#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14995#(< ~counter~0 99)} is VALID [2022-04-08 06:02:11,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14719#true} {14995#(< ~counter~0 99)} #98#return; {14995#(< ~counter~0 99)} is VALID [2022-04-08 06:02:11,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {14995#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {14995#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {14995#(< ~counter~0 99)} is VALID [2022-04-08 06:02:11,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {15020#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14995#(< ~counter~0 99)} is VALID [2022-04-08 06:02:11,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {15020#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15020#(< ~counter~0 98)} is VALID [2022-04-08 06:02:11,166 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14719#true} {15020#(< ~counter~0 98)} #98#return; {15020#(< ~counter~0 98)} is VALID [2022-04-08 06:02:11,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,166 INFO L290 TraceCheckUtils]: 45: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {15020#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {15020#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {15020#(< ~counter~0 98)} is VALID [2022-04-08 06:02:11,167 INFO L290 TraceCheckUtils]: 41: Hoare triple {15045#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15020#(< ~counter~0 98)} is VALID [2022-04-08 06:02:11,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {15045#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15045#(< ~counter~0 97)} is VALID [2022-04-08 06:02:11,167 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14719#true} {15045#(< ~counter~0 97)} #98#return; {15045#(< ~counter~0 97)} is VALID [2022-04-08 06:02:11,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,168 INFO L272 TraceCheckUtils]: 35: Hoare triple {15045#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {15045#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {15045#(< ~counter~0 97)} is VALID [2022-04-08 06:02:11,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {15070#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15045#(< ~counter~0 97)} is VALID [2022-04-08 06:02:11,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {15070#(< ~counter~0 96)} assume !(~r~0 > 0); {15070#(< ~counter~0 96)} is VALID [2022-04-08 06:02:11,169 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14719#true} {15070#(< ~counter~0 96)} #96#return; {15070#(< ~counter~0 96)} is VALID [2022-04-08 06:02:11,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,169 INFO L272 TraceCheckUtils]: 27: Hoare triple {15070#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {15070#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {15070#(< ~counter~0 96)} is VALID [2022-04-08 06:02:11,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {15095#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15070#(< ~counter~0 96)} is VALID [2022-04-08 06:02:11,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {15095#(< ~counter~0 95)} assume !!(0 != ~r~0); {15095#(< ~counter~0 95)} is VALID [2022-04-08 06:02:11,171 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14719#true} {15095#(< ~counter~0 95)} #94#return; {15095#(< ~counter~0 95)} is VALID [2022-04-08 06:02:11,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,171 INFO L272 TraceCheckUtils]: 19: Hoare triple {15095#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {15095#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {15095#(< ~counter~0 95)} is VALID [2022-04-08 06:02:11,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {15120#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15095#(< ~counter~0 95)} is VALID [2022-04-08 06:02:11,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {15120#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14719#true} {15120#(< ~counter~0 94)} #92#return; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {15120#(< ~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)); {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14719#true} {15120#(< ~counter~0 94)} #90#return; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-08 06:02:11,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {15120#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14719#true} is VALID [2022-04-08 06:02:11,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {15120#(< ~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; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {15120#(< ~counter~0 94)} call #t~ret9 := main(); {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15120#(< ~counter~0 94)} {14719#true} #102#return; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {15120#(< ~counter~0 94)} assume true; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {14719#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15120#(< ~counter~0 94)} is VALID [2022-04-08 06:02:11,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {14719#true} call ULTIMATE.init(); {14719#true} is VALID [2022-04-08 06:02:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:02:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:11,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900745349] [2022-04-08 06:02:11,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:11,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005245451] [2022-04-08 06:02:11,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005245451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:11,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:11,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:02:11,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:11,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800538585] [2022-04-08 06:02:11,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800538585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:11,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:11,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:02:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452748773] [2022-04-08 06:02:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 06:02:11,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:11,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:11,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:11,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:02:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:02:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:02:11,263 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:11,766 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-08 06:02:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:02:11,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 06:02:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:02:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:02:11,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-08 06:02:11,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:11,944 INFO L225 Difference]: With dead ends: 193 [2022-04-08 06:02:11,944 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 06:02:11,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:02:11,945 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 63 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:11,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 189 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 06:02:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-08 06:02:12,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:12,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:12,113 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:12,113 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:12,115 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:02:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:02:12,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:12,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:12,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:02:12,116 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:02:12,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:12,118 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:02:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:02:12,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:12,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:12,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:12,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-08 06:02:12,121 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-08 06:02:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:12,121 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-08 06:02:12,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:12,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-08 06:02:14,354 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-08 06:02:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 06:02:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 06:02:14,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:14,355 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:14,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:14,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:14,556 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-08 06:02:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629686968] [2022-04-08 06:02:14,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-08 06:02:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476670134] [2022-04-08 06:02:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:14,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:14,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049892423] [2022-04-08 06:02:14,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:14,574 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:14,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 06:02:14,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:14,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:14,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:02:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:14,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:15,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {16136#true} call ULTIMATE.init(); {16136#true} is VALID [2022-04-08 06:02:15,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {16136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16144#(<= ~counter~0 0)} {16136#true} #102#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {16144#(<= ~counter~0 0)} call #t~ret9 := main(); {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {16144#(<= ~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; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {16144#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {16144#(<= ~counter~0 0)} ~cond := #in~cond; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {16144#(<= ~counter~0 0)} assume !(0 == ~cond); {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16144#(<= ~counter~0 0)} {16144#(<= ~counter~0 0)} #90#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {16144#(<= ~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)); {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {16144#(<= ~counter~0 0)} ~cond := #in~cond; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {16144#(<= ~counter~0 0)} assume !(0 == ~cond); {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16144#(<= ~counter~0 0)} {16144#(<= ~counter~0 0)} #92#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {16144#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16144#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:15,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {16144#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {16193#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {16193#(<= ~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)); {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {16193#(<= ~counter~0 1)} ~cond := #in~cond; {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {16193#(<= ~counter~0 1)} assume !(0 == ~cond); {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {16193#(<= ~counter~0 1)} assume true; {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,050 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16193#(<= ~counter~0 1)} {16193#(<= ~counter~0 1)} #94#return; {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {16193#(<= ~counter~0 1)} assume !!(0 != ~r~0); {16193#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:15,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {16193#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {16218#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,051 INFO L272 TraceCheckUtils]: 27: Hoare triple {16218#(<= ~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)); {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {16218#(<= ~counter~0 2)} ~cond := #in~cond; {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {16218#(<= ~counter~0 2)} assume !(0 == ~cond); {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {16218#(<= ~counter~0 2)} assume true; {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,053 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16218#(<= ~counter~0 2)} {16218#(<= ~counter~0 2)} #96#return; {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {16218#(<= ~counter~0 2)} assume !(~r~0 > 0); {16218#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:15,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {16218#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {16243#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,054 INFO L272 TraceCheckUtils]: 35: Hoare triple {16243#(<= ~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)); {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {16243#(<= ~counter~0 3)} ~cond := #in~cond; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {16243#(<= ~counter~0 3)} assume !(0 == ~cond); {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {16243#(<= ~counter~0 3)} assume true; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,055 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16243#(<= ~counter~0 3)} {16243#(<= ~counter~0 3)} #98#return; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {16243#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16243#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:15,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {16243#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {16268#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,057 INFO L272 TraceCheckUtils]: 43: Hoare triple {16268#(<= ~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)); {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {16268#(<= ~counter~0 4)} ~cond := #in~cond; {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {16268#(<= ~counter~0 4)} assume !(0 == ~cond); {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {16268#(<= ~counter~0 4)} assume true; {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,058 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16268#(<= ~counter~0 4)} {16268#(<= ~counter~0 4)} #98#return; {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {16268#(<= ~counter~0 4)} assume !(~r~0 < 0); {16268#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:15,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {16268#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {16293#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,060 INFO L272 TraceCheckUtils]: 51: Hoare triple {16293#(<= ~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)); {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {16293#(<= ~counter~0 5)} ~cond := #in~cond; {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {16293#(<= ~counter~0 5)} assume !(0 == ~cond); {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {16293#(<= ~counter~0 5)} assume true; {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,061 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16293#(<= ~counter~0 5)} {16293#(<= ~counter~0 5)} #94#return; {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {16293#(<= ~counter~0 5)} assume !!(0 != ~r~0); {16293#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:15,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {16293#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {16318#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,062 INFO L272 TraceCheckUtils]: 59: Hoare triple {16318#(<= ~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)); {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {16318#(<= ~counter~0 6)} ~cond := #in~cond; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {16318#(<= ~counter~0 6)} assume !(0 == ~cond); {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {16318#(<= ~counter~0 6)} assume true; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,064 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16318#(<= ~counter~0 6)} {16318#(<= ~counter~0 6)} #96#return; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {16318#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16318#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:15,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {16318#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16343#(<= |main_#t~post7| 6)} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {16343#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 67: Hoare triple {16137#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 68: Hoare triple {16137#false} assume !(#t~post8 < 100);havoc #t~post8; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {16137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {16137#false} assume !(#t~post6 < 100);havoc #t~post6; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L272 TraceCheckUtils]: 71: Hoare triple {16137#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {16137#false} ~cond := #in~cond; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 73: Hoare triple {16137#false} assume 0 == ~cond; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L290 TraceCheckUtils]: 74: Hoare triple {16137#false} assume !false; {16137#false} is VALID [2022-04-08 06:02:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:15,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:15,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {16137#false} assume !false; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {16137#false} assume 0 == ~cond; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {16137#false} ~cond := #in~cond; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L272 TraceCheckUtils]: 71: Hoare triple {16137#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 70: Hoare triple {16137#false} assume !(#t~post6 < 100);havoc #t~post6; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 69: Hoare triple {16137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 68: Hoare triple {16137#false} assume !(#t~post8 < 100);havoc #t~post8; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 67: Hoare triple {16137#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16137#false} is VALID [2022-04-08 06:02:15,570 INFO L290 TraceCheckUtils]: 66: Hoare triple {16395#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {16137#false} is VALID [2022-04-08 06:02:15,571 INFO L290 TraceCheckUtils]: 65: Hoare triple {16399#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16395#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:02:15,571 INFO L290 TraceCheckUtils]: 64: Hoare triple {16399#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16399#(< ~counter~0 100)} is VALID [2022-04-08 06:02:15,571 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16136#true} {16399#(< ~counter~0 100)} #96#return; {16399#(< ~counter~0 100)} is VALID [2022-04-08 06:02:15,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,572 INFO L272 TraceCheckUtils]: 59: Hoare triple {16399#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,572 INFO L290 TraceCheckUtils]: 58: Hoare triple {16399#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {16399#(< ~counter~0 100)} is VALID [2022-04-08 06:02:15,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {16424#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16399#(< ~counter~0 100)} is VALID [2022-04-08 06:02:15,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {16424#(< ~counter~0 99)} assume !!(0 != ~r~0); {16424#(< ~counter~0 99)} is VALID [2022-04-08 06:02:15,573 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16136#true} {16424#(< ~counter~0 99)} #94#return; {16424#(< ~counter~0 99)} is VALID [2022-04-08 06:02:15,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,574 INFO L272 TraceCheckUtils]: 51: Hoare triple {16424#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,574 INFO L290 TraceCheckUtils]: 50: Hoare triple {16424#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {16424#(< ~counter~0 99)} is VALID [2022-04-08 06:02:15,574 INFO L290 TraceCheckUtils]: 49: Hoare triple {16449#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16424#(< ~counter~0 99)} is VALID [2022-04-08 06:02:15,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {16449#(< ~counter~0 98)} assume !(~r~0 < 0); {16449#(< ~counter~0 98)} is VALID [2022-04-08 06:02:15,575 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16136#true} {16449#(< ~counter~0 98)} #98#return; {16449#(< ~counter~0 98)} is VALID [2022-04-08 06:02:15,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,575 INFO L272 TraceCheckUtils]: 43: Hoare triple {16449#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {16449#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {16449#(< ~counter~0 98)} is VALID [2022-04-08 06:02:15,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {16474#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16449#(< ~counter~0 98)} is VALID [2022-04-08 06:02:15,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {16474#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16474#(< ~counter~0 97)} is VALID [2022-04-08 06:02:15,577 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16136#true} {16474#(< ~counter~0 97)} #98#return; {16474#(< ~counter~0 97)} is VALID [2022-04-08 06:02:15,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,577 INFO L272 TraceCheckUtils]: 35: Hoare triple {16474#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {16474#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {16474#(< ~counter~0 97)} is VALID [2022-04-08 06:02:15,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {16499#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16474#(< ~counter~0 97)} is VALID [2022-04-08 06:02:15,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {16499#(< ~counter~0 96)} assume !(~r~0 > 0); {16499#(< ~counter~0 96)} is VALID [2022-04-08 06:02:15,578 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16136#true} {16499#(< ~counter~0 96)} #96#return; {16499#(< ~counter~0 96)} is VALID [2022-04-08 06:02:15,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,579 INFO L272 TraceCheckUtils]: 27: Hoare triple {16499#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {16499#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {16499#(< ~counter~0 96)} is VALID [2022-04-08 06:02:15,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {16524#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16499#(< ~counter~0 96)} is VALID [2022-04-08 06:02:15,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {16524#(< ~counter~0 95)} assume !!(0 != ~r~0); {16524#(< ~counter~0 95)} is VALID [2022-04-08 06:02:15,580 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16136#true} {16524#(< ~counter~0 95)} #94#return; {16524#(< ~counter~0 95)} is VALID [2022-04-08 06:02:15,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,580 INFO L272 TraceCheckUtils]: 19: Hoare triple {16524#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {16524#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {16524#(< ~counter~0 95)} is VALID [2022-04-08 06:02:15,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {16549#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16524#(< ~counter~0 95)} is VALID [2022-04-08 06:02:15,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {16549#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,582 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16136#true} {16549#(< ~counter~0 94)} #92#return; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {16549#(< ~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)); {16136#true} is VALID [2022-04-08 06:02:15,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16136#true} {16549#(< ~counter~0 94)} #90#return; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-08 06:02:15,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-08 06:02:15,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-08 06:02:15,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {16549#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16136#true} is VALID [2022-04-08 06:02:15,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {16549#(< ~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; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {16549#(< ~counter~0 94)} call #t~ret9 := main(); {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16549#(< ~counter~0 94)} {16136#true} #102#return; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {16549#(< ~counter~0 94)} assume true; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {16136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16549#(< ~counter~0 94)} is VALID [2022-04-08 06:02:15,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {16136#true} call ULTIMATE.init(); {16136#true} is VALID [2022-04-08 06:02:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:02:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:15,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476670134] [2022-04-08 06:02:15,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:15,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049892423] [2022-04-08 06:02:15,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049892423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:15,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:15,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 06:02:15,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:15,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629686968] [2022-04-08 06:02:15,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629686968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:15,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:15,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:02:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014271449] [2022-04-08 06:02:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:15,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 06:02:15,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:15,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:15,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:15,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:02:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:15,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:02:15,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:02:15,665 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:16,211 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-08 06:02:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:02:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 06:02:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:16,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:02:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:02:16,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-08 06:02:16,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:16,354 INFO L225 Difference]: With dead ends: 195 [2022-04-08 06:02:16,354 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 06:02:16,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-08 06:02:16,354 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:16,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 186 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 06:02:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 06:02:16,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:16,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:16,501 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:16,501 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:16,515 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:02:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:02:16,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:16,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:16,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:02:16,528 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:02:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:16,530 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:02:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:02:16,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:16,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:16,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:16,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:02:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-08 06:02:16,533 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-08 06:02:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:16,533 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-08 06:02:16,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:02:16,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-08 06:02:17,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:02:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 06:02:17,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:17,165 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:17,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:17,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:17,365 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-08 06:02:17,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:17,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870288506] [2022-04-08 06:02:17,366 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-08 06:02:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:17,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139325471] [2022-04-08 06:02:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:17,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:17,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810930557] [2022-04-08 06:02:17,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:17,383 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:17,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 06:02:17,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:17,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:17,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:02:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:17,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:17,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {17587#true} call ULTIMATE.init(); {17587#true} is VALID [2022-04-08 06:02:17,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {17587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17595#(<= ~counter~0 0)} {17587#true} #102#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {17595#(<= ~counter~0 0)} call #t~ret9 := main(); {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {17595#(<= ~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; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {17595#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {17595#(<= ~counter~0 0)} ~cond := #in~cond; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {17595#(<= ~counter~0 0)} assume !(0 == ~cond); {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17595#(<= ~counter~0 0)} {17595#(<= ~counter~0 0)} #90#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,939 INFO L272 TraceCheckUtils]: 11: Hoare triple {17595#(<= ~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)); {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {17595#(<= ~counter~0 0)} ~cond := #in~cond; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {17595#(<= ~counter~0 0)} assume !(0 == ~cond); {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,940 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17595#(<= ~counter~0 0)} {17595#(<= ~counter~0 0)} #92#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17595#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:17,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {17595#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {17644#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {17644#(<= ~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)); {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {17644#(<= ~counter~0 1)} ~cond := #in~cond; {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {17644#(<= ~counter~0 1)} assume !(0 == ~cond); {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {17644#(<= ~counter~0 1)} assume true; {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17644#(<= ~counter~0 1)} {17644#(<= ~counter~0 1)} #94#return; {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {17644#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17644#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:17,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {17644#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {17669#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,945 INFO L272 TraceCheckUtils]: 27: Hoare triple {17669#(<= ~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)); {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {17669#(<= ~counter~0 2)} ~cond := #in~cond; {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {17669#(<= ~counter~0 2)} assume !(0 == ~cond); {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {17669#(<= ~counter~0 2)} assume true; {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,946 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17669#(<= ~counter~0 2)} {17669#(<= ~counter~0 2)} #96#return; {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {17669#(<= ~counter~0 2)} assume !(~r~0 > 0); {17669#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:17,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {17669#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {17694#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,947 INFO L272 TraceCheckUtils]: 35: Hoare triple {17694#(<= ~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)); {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {17694#(<= ~counter~0 3)} ~cond := #in~cond; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {17694#(<= ~counter~0 3)} assume !(0 == ~cond); {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {17694#(<= ~counter~0 3)} assume true; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,949 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17694#(<= ~counter~0 3)} {17694#(<= ~counter~0 3)} #98#return; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {17694#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17694#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:17,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {17694#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {17719#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,950 INFO L272 TraceCheckUtils]: 43: Hoare triple {17719#(<= ~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)); {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {17719#(<= ~counter~0 4)} ~cond := #in~cond; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {17719#(<= ~counter~0 4)} assume !(0 == ~cond); {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {17719#(<= ~counter~0 4)} assume true; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,951 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17719#(<= ~counter~0 4)} {17719#(<= ~counter~0 4)} #98#return; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {17719#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17719#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:17,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {17719#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {17744#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,967 INFO L272 TraceCheckUtils]: 51: Hoare triple {17744#(<= ~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)); {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {17744#(<= ~counter~0 5)} ~cond := #in~cond; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {17744#(<= ~counter~0 5)} assume !(0 == ~cond); {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {17744#(<= ~counter~0 5)} assume true; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,969 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17744#(<= ~counter~0 5)} {17744#(<= ~counter~0 5)} #98#return; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {17744#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17744#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:17,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {17744#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,970 INFO L290 TraceCheckUtils]: 58: Hoare triple {17769#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,970 INFO L272 TraceCheckUtils]: 59: Hoare triple {17769#(<= ~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)); {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {17769#(<= ~counter~0 6)} ~cond := #in~cond; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {17769#(<= ~counter~0 6)} assume !(0 == ~cond); {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,971 INFO L290 TraceCheckUtils]: 62: Hoare triple {17769#(<= ~counter~0 6)} assume true; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,971 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17769#(<= ~counter~0 6)} {17769#(<= ~counter~0 6)} #98#return; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {17769#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17769#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:17,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {17769#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {17794#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,973 INFO L272 TraceCheckUtils]: 67: Hoare triple {17794#(<= ~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)); {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {17794#(<= ~counter~0 7)} ~cond := #in~cond; {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {17794#(<= ~counter~0 7)} assume !(0 == ~cond); {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {17794#(<= ~counter~0 7)} assume true; {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,974 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17794#(<= ~counter~0 7)} {17794#(<= ~counter~0 7)} #98#return; {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {17794#(<= ~counter~0 7)} assume !(~r~0 < 0); {17794#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:17,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {17794#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17819#(<= |main_#t~post6| 7)} is VALID [2022-04-08 06:02:17,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {17819#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {17588#false} is VALID [2022-04-08 06:02:17,975 INFO L272 TraceCheckUtils]: 75: Hoare triple {17588#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17588#false} is VALID [2022-04-08 06:02:17,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {17588#false} ~cond := #in~cond; {17588#false} is VALID [2022-04-08 06:02:17,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {17588#false} assume 0 == ~cond; {17588#false} is VALID [2022-04-08 06:02:17,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {17588#false} assume !false; {17588#false} is VALID [2022-04-08 06:02:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:17,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:18,465 INFO L290 TraceCheckUtils]: 78: Hoare triple {17588#false} assume !false; {17588#false} is VALID [2022-04-08 06:02:18,465 INFO L290 TraceCheckUtils]: 77: Hoare triple {17588#false} assume 0 == ~cond; {17588#false} is VALID [2022-04-08 06:02:18,465 INFO L290 TraceCheckUtils]: 76: Hoare triple {17588#false} ~cond := #in~cond; {17588#false} is VALID [2022-04-08 06:02:18,466 INFO L272 TraceCheckUtils]: 75: Hoare triple {17588#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17588#false} is VALID [2022-04-08 06:02:18,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {17847#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {17588#false} is VALID [2022-04-08 06:02:18,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {17851#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17847#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:02:18,466 INFO L290 TraceCheckUtils]: 72: Hoare triple {17851#(< ~counter~0 100)} assume !(~r~0 < 0); {17851#(< ~counter~0 100)} is VALID [2022-04-08 06:02:18,467 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17587#true} {17851#(< ~counter~0 100)} #98#return; {17851#(< ~counter~0 100)} is VALID [2022-04-08 06:02:18,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,467 INFO L272 TraceCheckUtils]: 67: Hoare triple {17851#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {17851#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {17851#(< ~counter~0 100)} is VALID [2022-04-08 06:02:18,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {17876#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17851#(< ~counter~0 100)} is VALID [2022-04-08 06:02:18,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {17876#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17876#(< ~counter~0 99)} is VALID [2022-04-08 06:02:18,469 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17587#true} {17876#(< ~counter~0 99)} #98#return; {17876#(< ~counter~0 99)} is VALID [2022-04-08 06:02:18,469 INFO L290 TraceCheckUtils]: 62: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,469 INFO L290 TraceCheckUtils]: 61: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,469 INFO L290 TraceCheckUtils]: 60: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,469 INFO L272 TraceCheckUtils]: 59: Hoare triple {17876#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,469 INFO L290 TraceCheckUtils]: 58: Hoare triple {17876#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {17876#(< ~counter~0 99)} is VALID [2022-04-08 06:02:18,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {17901#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17876#(< ~counter~0 99)} is VALID [2022-04-08 06:02:18,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {17901#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17901#(< ~counter~0 98)} is VALID [2022-04-08 06:02:18,471 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17587#true} {17901#(< ~counter~0 98)} #98#return; {17901#(< ~counter~0 98)} is VALID [2022-04-08 06:02:18,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,471 INFO L272 TraceCheckUtils]: 51: Hoare triple {17901#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {17901#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {17901#(< ~counter~0 98)} is VALID [2022-04-08 06:02:18,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {17926#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17901#(< ~counter~0 98)} is VALID [2022-04-08 06:02:18,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {17926#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17926#(< ~counter~0 97)} is VALID [2022-04-08 06:02:18,472 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17587#true} {17926#(< ~counter~0 97)} #98#return; {17926#(< ~counter~0 97)} is VALID [2022-04-08 06:02:18,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,473 INFO L272 TraceCheckUtils]: 43: Hoare triple {17926#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {17926#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {17926#(< ~counter~0 97)} is VALID [2022-04-08 06:02:18,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {17951#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17926#(< ~counter~0 97)} is VALID [2022-04-08 06:02:18,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {17951#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17951#(< ~counter~0 96)} is VALID [2022-04-08 06:02:18,479 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17587#true} {17951#(< ~counter~0 96)} #98#return; {17951#(< ~counter~0 96)} is VALID [2022-04-08 06:02:18,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,479 INFO L272 TraceCheckUtils]: 35: Hoare triple {17951#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {17951#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {17951#(< ~counter~0 96)} is VALID [2022-04-08 06:02:18,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {17976#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17951#(< ~counter~0 96)} is VALID [2022-04-08 06:02:18,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {17976#(< ~counter~0 95)} assume !(~r~0 > 0); {17976#(< ~counter~0 95)} is VALID [2022-04-08 06:02:18,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17587#true} {17976#(< ~counter~0 95)} #96#return; {17976#(< ~counter~0 95)} is VALID [2022-04-08 06:02:18,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,481 INFO L272 TraceCheckUtils]: 27: Hoare triple {17976#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {17976#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {17976#(< ~counter~0 95)} is VALID [2022-04-08 06:02:18,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {18001#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17976#(< ~counter~0 95)} is VALID [2022-04-08 06:02:18,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {18001#(< ~counter~0 94)} assume !!(0 != ~r~0); {18001#(< ~counter~0 94)} is VALID [2022-04-08 06:02:18,484 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17587#true} {18001#(< ~counter~0 94)} #94#return; {18001#(< ~counter~0 94)} is VALID [2022-04-08 06:02:18,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,484 INFO L272 TraceCheckUtils]: 19: Hoare triple {18001#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {18001#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {18001#(< ~counter~0 94)} is VALID [2022-04-08 06:02:18,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {18026#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18001#(< ~counter~0 94)} is VALID [2022-04-08 06:02:18,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {18026#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,486 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17587#true} {18026#(< ~counter~0 93)} #92#return; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {18026#(< ~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)); {17587#true} is VALID [2022-04-08 06:02:18,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17587#true} {18026#(< ~counter~0 93)} #90#return; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-08 06:02:18,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-08 06:02:18,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-08 06:02:18,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {18026#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17587#true} is VALID [2022-04-08 06:02:18,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {18026#(< ~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; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {18026#(< ~counter~0 93)} call #t~ret9 := main(); {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18026#(< ~counter~0 93)} {17587#true} #102#return; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {18026#(< ~counter~0 93)} assume true; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {17587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18026#(< ~counter~0 93)} is VALID [2022-04-08 06:02:18,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {17587#true} call ULTIMATE.init(); {17587#true} is VALID [2022-04-08 06:02:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:02:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139325471] [2022-04-08 06:02:18,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810930557] [2022-04-08 06:02:18,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810930557] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:18,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:18,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:02:18,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [870288506] [2022-04-08 06:02:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [870288506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:18,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:18,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:02:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690027099] [2022-04-08 06:02:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:18,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 06:02:18,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:18,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:18,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:18,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:02:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:18,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:02:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:02:18,573 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:19,395 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-08 06:02:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:02:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 06:02:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:02:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:02:19,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-08 06:02:19,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:19,557 INFO L225 Difference]: With dead ends: 168 [2022-04-08 06:02:19,558 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 06:02:19,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:02:19,558 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:19,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 196 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:02:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 06:02:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 06:02:19,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:19,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:19,765 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:19,765 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:19,768 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:02:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:02:19,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:19,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:19,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:02:19,768 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:02:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:19,771 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:02:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:02:19,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:19,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:19,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:19,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-08 06:02:19,791 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-08 06:02:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:19,791 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-08 06:02:19,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:19,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-08 06:02:22,041 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-08 06:02:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-08 06:02:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 06:02:22,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:22,042 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:22,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:22,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:22,243 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-08 06:02:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208928655] [2022-04-08 06:02:22,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-08 06:02:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:22,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672040795] [2022-04-08 06:02:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:22,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:22,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732527827] [2022-04-08 06:02:22,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:22,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:22,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:22,261 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:22,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 06:02:22,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:22,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:22,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:02:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:22,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:22,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {19064#true} call ULTIMATE.init(); {19064#true} is VALID [2022-04-08 06:02:22,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {19064#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19072#(<= ~counter~0 0)} {19064#true} #102#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {19072#(<= ~counter~0 0)} call #t~ret9 := main(); {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {19072#(<= ~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; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {19072#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {19072#(<= ~counter~0 0)} ~cond := #in~cond; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {19072#(<= ~counter~0 0)} assume !(0 == ~cond); {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19072#(<= ~counter~0 0)} {19072#(<= ~counter~0 0)} #90#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,753 INFO L272 TraceCheckUtils]: 11: Hoare triple {19072#(<= ~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)); {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {19072#(<= ~counter~0 0)} ~cond := #in~cond; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {19072#(<= ~counter~0 0)} assume !(0 == ~cond); {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19072#(<= ~counter~0 0)} {19072#(<= ~counter~0 0)} #92#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {19072#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19072#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:22,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {19072#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {19121#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,756 INFO L272 TraceCheckUtils]: 19: Hoare triple {19121#(<= ~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)); {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {19121#(<= ~counter~0 1)} ~cond := #in~cond; {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {19121#(<= ~counter~0 1)} assume !(0 == ~cond); {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {19121#(<= ~counter~0 1)} assume true; {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,758 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19121#(<= ~counter~0 1)} {19121#(<= ~counter~0 1)} #94#return; {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {19121#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19121#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:22,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {19121#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {19146#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,764 INFO L272 TraceCheckUtils]: 27: Hoare triple {19146#(<= ~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)); {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {19146#(<= ~counter~0 2)} ~cond := #in~cond; {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {19146#(<= ~counter~0 2)} assume !(0 == ~cond); {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {19146#(<= ~counter~0 2)} assume true; {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,766 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19146#(<= ~counter~0 2)} {19146#(<= ~counter~0 2)} #96#return; {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {19146#(<= ~counter~0 2)} assume !(~r~0 > 0); {19146#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:22,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {19146#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {19171#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {19171#(<= ~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)); {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {19171#(<= ~counter~0 3)} ~cond := #in~cond; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {19171#(<= ~counter~0 3)} assume !(0 == ~cond); {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {19171#(<= ~counter~0 3)} assume true; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,769 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19171#(<= ~counter~0 3)} {19171#(<= ~counter~0 3)} #98#return; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {19171#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19171#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:22,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {19171#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {19196#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,770 INFO L272 TraceCheckUtils]: 43: Hoare triple {19196#(<= ~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)); {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {19196#(<= ~counter~0 4)} ~cond := #in~cond; {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {19196#(<= ~counter~0 4)} assume !(0 == ~cond); {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {19196#(<= ~counter~0 4)} assume true; {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,771 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19196#(<= ~counter~0 4)} {19196#(<= ~counter~0 4)} #98#return; {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {19196#(<= ~counter~0 4)} assume !(~r~0 < 0); {19196#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:22,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {19196#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {19221#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,773 INFO L272 TraceCheckUtils]: 51: Hoare triple {19221#(<= ~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)); {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {19221#(<= ~counter~0 5)} ~cond := #in~cond; {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {19221#(<= ~counter~0 5)} assume !(0 == ~cond); {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {19221#(<= ~counter~0 5)} assume true; {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,774 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19221#(<= ~counter~0 5)} {19221#(<= ~counter~0 5)} #94#return; {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {19221#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19221#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:22,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {19221#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {19246#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,777 INFO L272 TraceCheckUtils]: 59: Hoare triple {19246#(<= ~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)); {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {19246#(<= ~counter~0 6)} ~cond := #in~cond; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {19246#(<= ~counter~0 6)} assume !(0 == ~cond); {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {19246#(<= ~counter~0 6)} assume true; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,779 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19246#(<= ~counter~0 6)} {19246#(<= ~counter~0 6)} #96#return; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,779 INFO L290 TraceCheckUtils]: 64: Hoare triple {19246#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19246#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:22,779 INFO L290 TraceCheckUtils]: 65: Hoare triple {19246#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {19271#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,780 INFO L272 TraceCheckUtils]: 67: Hoare triple {19271#(<= ~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)); {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,780 INFO L290 TraceCheckUtils]: 68: Hoare triple {19271#(<= ~counter~0 7)} ~cond := #in~cond; {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {19271#(<= ~counter~0 7)} assume !(0 == ~cond); {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {19271#(<= ~counter~0 7)} assume true; {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,781 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19271#(<= ~counter~0 7)} {19271#(<= ~counter~0 7)} #96#return; {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {19271#(<= ~counter~0 7)} assume !(~r~0 > 0); {19271#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:22,782 INFO L290 TraceCheckUtils]: 73: Hoare triple {19271#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19296#(<= |main_#t~post8| 7)} is VALID [2022-04-08 06:02:22,782 INFO L290 TraceCheckUtils]: 74: Hoare triple {19296#(<= |main_#t~post8| 7)} assume !(#t~post8 < 100);havoc #t~post8; {19065#false} is VALID [2022-04-08 06:02:22,782 INFO L290 TraceCheckUtils]: 75: Hoare triple {19065#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19065#false} is VALID [2022-04-08 06:02:22,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {19065#false} assume !(#t~post6 < 100);havoc #t~post6; {19065#false} is VALID [2022-04-08 06:02:22,782 INFO L272 TraceCheckUtils]: 77: Hoare triple {19065#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19065#false} is VALID [2022-04-08 06:02:22,783 INFO L290 TraceCheckUtils]: 78: Hoare triple {19065#false} ~cond := #in~cond; {19065#false} is VALID [2022-04-08 06:02:22,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {19065#false} assume 0 == ~cond; {19065#false} is VALID [2022-04-08 06:02:22,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {19065#false} assume !false; {19065#false} is VALID [2022-04-08 06:02:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:22,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:23,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {19065#false} assume !false; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {19065#false} assume 0 == ~cond; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {19065#false} ~cond := #in~cond; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L272 TraceCheckUtils]: 77: Hoare triple {19065#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {19065#false} assume !(#t~post6 < 100);havoc #t~post6; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {19065#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {19336#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {19065#false} is VALID [2022-04-08 06:02:23,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {19340#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19336#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:02:23,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {19340#(< ~counter~0 100)} assume !(~r~0 > 0); {19340#(< ~counter~0 100)} is VALID [2022-04-08 06:02:23,226 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19064#true} {19340#(< ~counter~0 100)} #96#return; {19340#(< ~counter~0 100)} is VALID [2022-04-08 06:02:23,226 INFO L290 TraceCheckUtils]: 70: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,226 INFO L290 TraceCheckUtils]: 69: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,226 INFO L272 TraceCheckUtils]: 67: Hoare triple {19340#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {19340#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {19340#(< ~counter~0 100)} is VALID [2022-04-08 06:02:23,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {19365#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19340#(< ~counter~0 100)} is VALID [2022-04-08 06:02:23,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {19365#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19365#(< ~counter~0 99)} is VALID [2022-04-08 06:02:23,228 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19064#true} {19365#(< ~counter~0 99)} #96#return; {19365#(< ~counter~0 99)} is VALID [2022-04-08 06:02:23,228 INFO L290 TraceCheckUtils]: 62: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,228 INFO L272 TraceCheckUtils]: 59: Hoare triple {19365#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {19365#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {19365#(< ~counter~0 99)} is VALID [2022-04-08 06:02:23,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {19390#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19365#(< ~counter~0 99)} is VALID [2022-04-08 06:02:23,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {19390#(< ~counter~0 98)} assume !!(0 != ~r~0); {19390#(< ~counter~0 98)} is VALID [2022-04-08 06:02:23,230 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19064#true} {19390#(< ~counter~0 98)} #94#return; {19390#(< ~counter~0 98)} is VALID [2022-04-08 06:02:23,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,231 INFO L272 TraceCheckUtils]: 51: Hoare triple {19390#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {19390#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {19390#(< ~counter~0 98)} is VALID [2022-04-08 06:02:23,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {19415#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19390#(< ~counter~0 98)} is VALID [2022-04-08 06:02:23,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {19415#(< ~counter~0 97)} assume !(~r~0 < 0); {19415#(< ~counter~0 97)} is VALID [2022-04-08 06:02:23,232 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19064#true} {19415#(< ~counter~0 97)} #98#return; {19415#(< ~counter~0 97)} is VALID [2022-04-08 06:02:23,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,232 INFO L272 TraceCheckUtils]: 43: Hoare triple {19415#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {19415#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {19415#(< ~counter~0 97)} is VALID [2022-04-08 06:02:23,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {19440#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19415#(< ~counter~0 97)} is VALID [2022-04-08 06:02:23,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {19440#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19440#(< ~counter~0 96)} is VALID [2022-04-08 06:02:23,234 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19064#true} {19440#(< ~counter~0 96)} #98#return; {19440#(< ~counter~0 96)} is VALID [2022-04-08 06:02:23,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,234 INFO L272 TraceCheckUtils]: 35: Hoare triple {19440#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {19440#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {19440#(< ~counter~0 96)} is VALID [2022-04-08 06:02:23,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {19465#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19440#(< ~counter~0 96)} is VALID [2022-04-08 06:02:23,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {19465#(< ~counter~0 95)} assume !(~r~0 > 0); {19465#(< ~counter~0 95)} is VALID [2022-04-08 06:02:23,236 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19064#true} {19465#(< ~counter~0 95)} #96#return; {19465#(< ~counter~0 95)} is VALID [2022-04-08 06:02:23,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,236 INFO L272 TraceCheckUtils]: 27: Hoare triple {19465#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {19465#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {19465#(< ~counter~0 95)} is VALID [2022-04-08 06:02:23,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {19490#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19465#(< ~counter~0 95)} is VALID [2022-04-08 06:02:23,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {19490#(< ~counter~0 94)} assume !!(0 != ~r~0); {19490#(< ~counter~0 94)} is VALID [2022-04-08 06:02:23,237 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19064#true} {19490#(< ~counter~0 94)} #94#return; {19490#(< ~counter~0 94)} is VALID [2022-04-08 06:02:23,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,237 INFO L272 TraceCheckUtils]: 19: Hoare triple {19490#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {19490#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {19490#(< ~counter~0 94)} is VALID [2022-04-08 06:02:23,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {19515#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19490#(< ~counter~0 94)} is VALID [2022-04-08 06:02:23,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {19515#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,239 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19064#true} {19515#(< ~counter~0 93)} #92#return; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {19515#(< ~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)); {19064#true} is VALID [2022-04-08 06:02:23,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19064#true} {19515#(< ~counter~0 93)} #90#return; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-08 06:02:23,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-08 06:02:23,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-08 06:02:23,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {19515#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19064#true} is VALID [2022-04-08 06:02:23,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {19515#(< ~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; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {19515#(< ~counter~0 93)} call #t~ret9 := main(); {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19515#(< ~counter~0 93)} {19064#true} #102#return; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {19515#(< ~counter~0 93)} assume true; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {19064#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19515#(< ~counter~0 93)} is VALID [2022-04-08 06:02:23,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {19064#true} call ULTIMATE.init(); {19064#true} is VALID [2022-04-08 06:02:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:02:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:23,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672040795] [2022-04-08 06:02:23,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:23,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732527827] [2022-04-08 06:02:23,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732527827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:23,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:23,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:02:23,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:23,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208928655] [2022-04-08 06:02:23,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208928655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:23,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:23,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:02:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222416148] [2022-04-08 06:02:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 06:02:23,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:23,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:23,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:23,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:02:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:23,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:02:23,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:02:23,314 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:24,353 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-08 06:02:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 06:02:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 06:02:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:02:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:02:24,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-08 06:02:24,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:24,481 INFO L225 Difference]: With dead ends: 213 [2022-04-08 06:02:24,481 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 06:02:24,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-08 06:02:24,482 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:24,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 195 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 06:02:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-08 06:02:24,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:24,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:24,916 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:24,916 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:24,918 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:02:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:02:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:02:24,920 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:02:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:24,922 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:02:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:02:24,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:24,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:24,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:24,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-08 06:02:24,931 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-08 06:02:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:24,931 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-08 06:02:24,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:24,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-08 06:02:27,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 201 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 06:02:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 06:02:27,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:27,152 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:27,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:27,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:27,353 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-08 06:02:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:27,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66616003] [2022-04-08 06:02:27,353 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-08 06:02:27,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202016529] [2022-04-08 06:02:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:27,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:27,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692574053] [2022-04-08 06:02:27,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:27,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:27,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:27,376 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 06:02:27,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:02:27,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:27,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:02:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:27,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:27,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {20653#true} call ULTIMATE.init(); {20653#true} is VALID [2022-04-08 06:02:27,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {20653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20661#(<= ~counter~0 0)} {20653#true} #102#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {20661#(<= ~counter~0 0)} call #t~ret9 := main(); {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {20661#(<= ~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; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,937 INFO L272 TraceCheckUtils]: 6: Hoare triple {20661#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {20661#(<= ~counter~0 0)} ~cond := #in~cond; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {20661#(<= ~counter~0 0)} assume !(0 == ~cond); {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20661#(<= ~counter~0 0)} {20661#(<= ~counter~0 0)} #90#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,938 INFO L272 TraceCheckUtils]: 11: Hoare triple {20661#(<= ~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)); {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {20661#(<= ~counter~0 0)} ~cond := #in~cond; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {20661#(<= ~counter~0 0)} assume !(0 == ~cond); {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,940 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20661#(<= ~counter~0 0)} {20661#(<= ~counter~0 0)} #92#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {20661#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20661#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:27,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {20661#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {20710#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,941 INFO L272 TraceCheckUtils]: 19: Hoare triple {20710#(<= ~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)); {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {20710#(<= ~counter~0 1)} ~cond := #in~cond; {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {20710#(<= ~counter~0 1)} assume !(0 == ~cond); {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {20710#(<= ~counter~0 1)} assume true; {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,943 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20710#(<= ~counter~0 1)} {20710#(<= ~counter~0 1)} #94#return; {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {20710#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20710#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:27,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {20710#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {20735#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,944 INFO L272 TraceCheckUtils]: 27: Hoare triple {20735#(<= ~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)); {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {20735#(<= ~counter~0 2)} ~cond := #in~cond; {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {20735#(<= ~counter~0 2)} assume !(0 == ~cond); {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {20735#(<= ~counter~0 2)} assume true; {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,946 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20735#(<= ~counter~0 2)} {20735#(<= ~counter~0 2)} #96#return; {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {20735#(<= ~counter~0 2)} assume !(~r~0 > 0); {20735#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:27,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {20735#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {20760#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,947 INFO L272 TraceCheckUtils]: 35: Hoare triple {20760#(<= ~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)); {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {20760#(<= ~counter~0 3)} ~cond := #in~cond; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {20760#(<= ~counter~0 3)} assume !(0 == ~cond); {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {20760#(<= ~counter~0 3)} assume true; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,948 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20760#(<= ~counter~0 3)} {20760#(<= ~counter~0 3)} #98#return; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {20760#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20760#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:27,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {20760#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {20785#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,950 INFO L272 TraceCheckUtils]: 43: Hoare triple {20785#(<= ~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)); {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {20785#(<= ~counter~0 4)} ~cond := #in~cond; {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {20785#(<= ~counter~0 4)} assume !(0 == ~cond); {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {20785#(<= ~counter~0 4)} assume true; {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,951 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20785#(<= ~counter~0 4)} {20785#(<= ~counter~0 4)} #98#return; {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {20785#(<= ~counter~0 4)} assume !(~r~0 < 0); {20785#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:27,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {20785#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {20810#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,953 INFO L272 TraceCheckUtils]: 51: Hoare triple {20810#(<= ~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)); {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,953 INFO L290 TraceCheckUtils]: 52: Hoare triple {20810#(<= ~counter~0 5)} ~cond := #in~cond; {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {20810#(<= ~counter~0 5)} assume !(0 == ~cond); {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,953 INFO L290 TraceCheckUtils]: 54: Hoare triple {20810#(<= ~counter~0 5)} assume true; {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,954 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20810#(<= ~counter~0 5)} {20810#(<= ~counter~0 5)} #94#return; {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {20810#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20810#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:27,955 INFO L290 TraceCheckUtils]: 57: Hoare triple {20810#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {20835#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,955 INFO L272 TraceCheckUtils]: 59: Hoare triple {20835#(<= ~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)); {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {20835#(<= ~counter~0 6)} ~cond := #in~cond; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {20835#(<= ~counter~0 6)} assume !(0 == ~cond); {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {20835#(<= ~counter~0 6)} assume true; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,957 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20835#(<= ~counter~0 6)} {20835#(<= ~counter~0 6)} #96#return; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {20835#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20835#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:27,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {20835#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {20860#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,979 INFO L272 TraceCheckUtils]: 67: Hoare triple {20860#(<= ~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)); {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {20860#(<= ~counter~0 7)} ~cond := #in~cond; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {20860#(<= ~counter~0 7)} assume !(0 == ~cond); {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,980 INFO L290 TraceCheckUtils]: 70: Hoare triple {20860#(<= ~counter~0 7)} assume true; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,980 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20860#(<= ~counter~0 7)} {20860#(<= ~counter~0 7)} #96#return; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {20860#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20860#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 73: Hoare triple {20860#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20885#(<= |main_#t~post7| 7)} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 74: Hoare triple {20885#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 75: Hoare triple {20654#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {20654#false} assume !(#t~post8 < 100);havoc #t~post8; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {20654#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {20654#false} assume !(#t~post6 < 100);havoc #t~post6; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L272 TraceCheckUtils]: 79: Hoare triple {20654#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 80: Hoare triple {20654#false} ~cond := #in~cond; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {20654#false} assume 0 == ~cond; {20654#false} is VALID [2022-04-08 06:02:27,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {20654#false} assume !false; {20654#false} is VALID [2022-04-08 06:02:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:27,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {20654#false} assume !false; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {20654#false} assume 0 == ~cond; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {20654#false} ~cond := #in~cond; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L272 TraceCheckUtils]: 79: Hoare triple {20654#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {20654#false} assume !(#t~post6 < 100);havoc #t~post6; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {20654#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {20654#false} assume !(#t~post8 < 100);havoc #t~post8; {20654#false} is VALID [2022-04-08 06:02:28,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {20654#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20654#false} is VALID [2022-04-08 06:02:28,472 INFO L290 TraceCheckUtils]: 74: Hoare triple {20937#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {20654#false} is VALID [2022-04-08 06:02:28,472 INFO L290 TraceCheckUtils]: 73: Hoare triple {20941#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20937#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:02:28,472 INFO L290 TraceCheckUtils]: 72: Hoare triple {20941#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20941#(< ~counter~0 100)} is VALID [2022-04-08 06:02:28,473 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20653#true} {20941#(< ~counter~0 100)} #96#return; {20941#(< ~counter~0 100)} is VALID [2022-04-08 06:02:28,473 INFO L290 TraceCheckUtils]: 70: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,473 INFO L290 TraceCheckUtils]: 69: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,473 INFO L272 TraceCheckUtils]: 67: Hoare triple {20941#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {20941#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {20941#(< ~counter~0 100)} is VALID [2022-04-08 06:02:28,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {20966#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20941#(< ~counter~0 100)} is VALID [2022-04-08 06:02:28,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {20966#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20966#(< ~counter~0 99)} is VALID [2022-04-08 06:02:28,475 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20653#true} {20966#(< ~counter~0 99)} #96#return; {20966#(< ~counter~0 99)} is VALID [2022-04-08 06:02:28,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,475 INFO L272 TraceCheckUtils]: 59: Hoare triple {20966#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {20966#(< ~counter~0 99)} is VALID [2022-04-08 06:02:28,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {20991#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20966#(< ~counter~0 99)} is VALID [2022-04-08 06:02:28,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {20991#(< ~counter~0 98)} assume !!(0 != ~r~0); {20991#(< ~counter~0 98)} is VALID [2022-04-08 06:02:28,477 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20653#true} {20991#(< ~counter~0 98)} #94#return; {20991#(< ~counter~0 98)} is VALID [2022-04-08 06:02:28,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,477 INFO L272 TraceCheckUtils]: 51: Hoare triple {20991#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {20991#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {20991#(< ~counter~0 98)} is VALID [2022-04-08 06:02:28,478 INFO L290 TraceCheckUtils]: 49: Hoare triple {21016#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20991#(< ~counter~0 98)} is VALID [2022-04-08 06:02:28,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {21016#(< ~counter~0 97)} assume !(~r~0 < 0); {21016#(< ~counter~0 97)} is VALID [2022-04-08 06:02:28,478 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20653#true} {21016#(< ~counter~0 97)} #98#return; {21016#(< ~counter~0 97)} is VALID [2022-04-08 06:02:28,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,479 INFO L290 TraceCheckUtils]: 44: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,479 INFO L272 TraceCheckUtils]: 43: Hoare triple {21016#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {21016#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {21016#(< ~counter~0 97)} is VALID [2022-04-08 06:02:28,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {21041#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21016#(< ~counter~0 97)} is VALID [2022-04-08 06:02:28,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {21041#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21041#(< ~counter~0 96)} is VALID [2022-04-08 06:02:28,480 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20653#true} {21041#(< ~counter~0 96)} #98#return; {21041#(< ~counter~0 96)} is VALID [2022-04-08 06:02:28,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,481 INFO L272 TraceCheckUtils]: 35: Hoare triple {21041#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {21041#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {21041#(< ~counter~0 96)} is VALID [2022-04-08 06:02:28,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {21066#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21041#(< ~counter~0 96)} is VALID [2022-04-08 06:02:28,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {21066#(< ~counter~0 95)} assume !(~r~0 > 0); {21066#(< ~counter~0 95)} is VALID [2022-04-08 06:02:28,482 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20653#true} {21066#(< ~counter~0 95)} #96#return; {21066#(< ~counter~0 95)} is VALID [2022-04-08 06:02:28,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,482 INFO L272 TraceCheckUtils]: 27: Hoare triple {21066#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {21066#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {21066#(< ~counter~0 95)} is VALID [2022-04-08 06:02:28,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {21091#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21066#(< ~counter~0 95)} is VALID [2022-04-08 06:02:28,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {21091#(< ~counter~0 94)} assume !!(0 != ~r~0); {21091#(< ~counter~0 94)} is VALID [2022-04-08 06:02:28,484 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20653#true} {21091#(< ~counter~0 94)} #94#return; {21091#(< ~counter~0 94)} is VALID [2022-04-08 06:02:28,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,484 INFO L272 TraceCheckUtils]: 19: Hoare triple {21091#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {21091#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {21091#(< ~counter~0 94)} is VALID [2022-04-08 06:02:28,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {21116#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21091#(< ~counter~0 94)} is VALID [2022-04-08 06:02:28,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {21116#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,485 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20653#true} {21116#(< ~counter~0 93)} #92#return; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {21116#(< ~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)); {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20653#true} {21116#(< ~counter~0 93)} #90#return; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-08 06:02:28,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {21116#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20653#true} is VALID [2022-04-08 06:02:28,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {21116#(< ~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; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {21116#(< ~counter~0 93)} call #t~ret9 := main(); {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21116#(< ~counter~0 93)} {20653#true} #102#return; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {21116#(< ~counter~0 93)} assume true; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {20653#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21116#(< ~counter~0 93)} is VALID [2022-04-08 06:02:28,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {20653#true} call ULTIMATE.init(); {20653#true} is VALID [2022-04-08 06:02:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:02:28,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:28,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202016529] [2022-04-08 06:02:28,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:28,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692574053] [2022-04-08 06:02:28,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692574053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:28,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:28,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:02:28,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:28,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66616003] [2022-04-08 06:02:28,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66616003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:28,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:28,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:02:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188660833] [2022-04-08 06:02:28,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 06:02:28,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:28,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:28,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:28,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:02:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:02:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:02:28,548 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:29,077 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-08 06:02:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:02:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 06:02:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:02:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:02:29,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 06:02:29,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:29,177 INFO L225 Difference]: With dead ends: 215 [2022-04-08 06:02:29,177 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 06:02:29,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:02:29,178 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:29,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 210 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:02:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 06:02:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-08 06:02:29,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:29,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:29,324 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:29,325 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:29,327 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:02:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:02:29,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:29,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:29,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:02:29,328 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:02:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:29,330 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:02:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:02:29,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:29,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:29,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:29,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:02:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-08 06:02:29,333 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-08 06:02:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:29,333 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-08 06:02:29,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:02:29,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-08 06:02:30,727 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-08 06:02:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:02:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 06:02:30,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:30,728 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:30,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:30,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:30,928 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-08 06:02:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:30,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935482297] [2022-04-08 06:02:30,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-08 06:02:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:30,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226931784] [2022-04-08 06:02:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:31,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30542582] [2022-04-08 06:02:31,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:31,107 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:31,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 06:02:31,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:31,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:31,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:02:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:31,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:31,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {22276#true} call ULTIMATE.init(); {22276#true} is VALID [2022-04-08 06:02:31,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {22276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22284#(<= ~counter~0 0)} {22276#true} #102#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {22284#(<= ~counter~0 0)} call #t~ret9 := main(); {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {22284#(<= ~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; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {22284#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {22284#(<= ~counter~0 0)} ~cond := #in~cond; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {22284#(<= ~counter~0 0)} assume !(0 == ~cond); {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22284#(<= ~counter~0 0)} {22284#(<= ~counter~0 0)} #90#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {22284#(<= ~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)); {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {22284#(<= ~counter~0 0)} ~cond := #in~cond; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {22284#(<= ~counter~0 0)} assume !(0 == ~cond); {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22284#(<= ~counter~0 0)} {22284#(<= ~counter~0 0)} #92#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {22284#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22284#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:31,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {22284#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {22333#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,412 INFO L272 TraceCheckUtils]: 19: Hoare triple {22333#(<= ~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)); {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {22333#(<= ~counter~0 1)} ~cond := #in~cond; {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {22333#(<= ~counter~0 1)} assume !(0 == ~cond); {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {22333#(<= ~counter~0 1)} assume true; {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,413 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22333#(<= ~counter~0 1)} {22333#(<= ~counter~0 1)} #94#return; {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#(<= ~counter~0 1)} assume !!(0 != ~r~0); {22333#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:31,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {22358#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,414 INFO L272 TraceCheckUtils]: 27: Hoare triple {22358#(<= ~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)); {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {22358#(<= ~counter~0 2)} ~cond := #in~cond; {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {22358#(<= ~counter~0 2)} assume !(0 == ~cond); {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {22358#(<= ~counter~0 2)} assume true; {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22358#(<= ~counter~0 2)} {22358#(<= ~counter~0 2)} #96#return; {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {22358#(<= ~counter~0 2)} assume !(~r~0 > 0); {22358#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:31,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {22358#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {22383#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,416 INFO L272 TraceCheckUtils]: 35: Hoare triple {22383#(<= ~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)); {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {22383#(<= ~counter~0 3)} ~cond := #in~cond; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {22383#(<= ~counter~0 3)} assume !(0 == ~cond); {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {22383#(<= ~counter~0 3)} assume true; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,417 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22383#(<= ~counter~0 3)} {22383#(<= ~counter~0 3)} #98#return; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {22383#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22383#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:31,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {22383#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {22408#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,424 INFO L272 TraceCheckUtils]: 43: Hoare triple {22408#(<= ~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)); {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {22408#(<= ~counter~0 4)} ~cond := #in~cond; {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {22408#(<= ~counter~0 4)} assume !(0 == ~cond); {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {22408#(<= ~counter~0 4)} assume true; {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22408#(<= ~counter~0 4)} {22408#(<= ~counter~0 4)} #98#return; {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {22408#(<= ~counter~0 4)} assume !(~r~0 < 0); {22408#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:31,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {22408#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {22433#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,426 INFO L272 TraceCheckUtils]: 51: Hoare triple {22433#(<= ~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)); {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {22433#(<= ~counter~0 5)} ~cond := #in~cond; {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {22433#(<= ~counter~0 5)} assume !(0 == ~cond); {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {22433#(<= ~counter~0 5)} assume true; {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,427 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22433#(<= ~counter~0 5)} {22433#(<= ~counter~0 5)} #94#return; {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {22433#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22433#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:31,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {22433#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {22458#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,428 INFO L272 TraceCheckUtils]: 59: Hoare triple {22458#(<= ~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)); {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {22458#(<= ~counter~0 6)} ~cond := #in~cond; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {22458#(<= ~counter~0 6)} assume !(0 == ~cond); {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {22458#(<= ~counter~0 6)} assume true; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,429 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22458#(<= ~counter~0 6)} {22458#(<= ~counter~0 6)} #96#return; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {22458#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22458#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:31,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {22458#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {22483#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,430 INFO L272 TraceCheckUtils]: 67: Hoare triple {22483#(<= ~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)); {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {22483#(<= ~counter~0 7)} ~cond := #in~cond; {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {22483#(<= ~counter~0 7)} assume !(0 == ~cond); {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {22483#(<= ~counter~0 7)} assume true; {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,431 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22483#(<= ~counter~0 7)} {22483#(<= ~counter~0 7)} #96#return; {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {22483#(<= ~counter~0 7)} assume !(~r~0 > 0); {22483#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:31,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {22483#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {22508#(<= ~counter~0 8)} assume !!(#t~post8 < 100);havoc #t~post8; {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,432 INFO L272 TraceCheckUtils]: 75: Hoare triple {22508#(<= ~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)); {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {22508#(<= ~counter~0 8)} ~cond := #in~cond; {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {22508#(<= ~counter~0 8)} assume !(0 == ~cond); {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {22508#(<= ~counter~0 8)} assume true; {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,433 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22508#(<= ~counter~0 8)} {22508#(<= ~counter~0 8)} #98#return; {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {22508#(<= ~counter~0 8)} assume !(~r~0 < 0); {22508#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:31,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {22508#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22533#(<= |main_#t~post6| 8)} is VALID [2022-04-08 06:02:31,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {22533#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {22277#false} is VALID [2022-04-08 06:02:31,433 INFO L272 TraceCheckUtils]: 83: Hoare triple {22277#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22277#false} is VALID [2022-04-08 06:02:31,433 INFO L290 TraceCheckUtils]: 84: Hoare triple {22277#false} ~cond := #in~cond; {22277#false} is VALID [2022-04-08 06:02:31,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {22277#false} assume 0 == ~cond; {22277#false} is VALID [2022-04-08 06:02:31,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {22277#false} assume !false; {22277#false} is VALID [2022-04-08 06:02:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:31,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:31,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {22277#false} assume !false; {22277#false} is VALID [2022-04-08 06:02:31,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {22277#false} assume 0 == ~cond; {22277#false} is VALID [2022-04-08 06:02:31,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {22277#false} ~cond := #in~cond; {22277#false} is VALID [2022-04-08 06:02:31,763 INFO L272 TraceCheckUtils]: 83: Hoare triple {22277#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22277#false} is VALID [2022-04-08 06:02:31,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {22561#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {22277#false} is VALID [2022-04-08 06:02:31,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {22565#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22561#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:02:31,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {22565#(< ~counter~0 100)} assume !(~r~0 < 0); {22565#(< ~counter~0 100)} is VALID [2022-04-08 06:02:31,764 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22276#true} {22565#(< ~counter~0 100)} #98#return; {22565#(< ~counter~0 100)} is VALID [2022-04-08 06:02:31,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,764 INFO L272 TraceCheckUtils]: 75: Hoare triple {22565#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {22565#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {22565#(< ~counter~0 100)} is VALID [2022-04-08 06:02:31,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {22590#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22565#(< ~counter~0 100)} is VALID [2022-04-08 06:02:31,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {22590#(< ~counter~0 99)} assume !(~r~0 > 0); {22590#(< ~counter~0 99)} is VALID [2022-04-08 06:02:31,780 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22276#true} {22590#(< ~counter~0 99)} #96#return; {22590#(< ~counter~0 99)} is VALID [2022-04-08 06:02:31,780 INFO L290 TraceCheckUtils]: 70: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,781 INFO L272 TraceCheckUtils]: 67: Hoare triple {22590#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {22590#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {22590#(< ~counter~0 99)} is VALID [2022-04-08 06:02:31,781 INFO L290 TraceCheckUtils]: 65: Hoare triple {22615#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22590#(< ~counter~0 99)} is VALID [2022-04-08 06:02:31,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {22615#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22615#(< ~counter~0 98)} is VALID [2022-04-08 06:02:31,782 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22276#true} {22615#(< ~counter~0 98)} #96#return; {22615#(< ~counter~0 98)} is VALID [2022-04-08 06:02:31,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,782 INFO L290 TraceCheckUtils]: 60: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,782 INFO L272 TraceCheckUtils]: 59: Hoare triple {22615#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,782 INFO L290 TraceCheckUtils]: 58: Hoare triple {22615#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {22615#(< ~counter~0 98)} is VALID [2022-04-08 06:02:31,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {22640#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22615#(< ~counter~0 98)} is VALID [2022-04-08 06:02:31,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {22640#(< ~counter~0 97)} assume !!(0 != ~r~0); {22640#(< ~counter~0 97)} is VALID [2022-04-08 06:02:31,794 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22276#true} {22640#(< ~counter~0 97)} #94#return; {22640#(< ~counter~0 97)} is VALID [2022-04-08 06:02:31,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,795 INFO L272 TraceCheckUtils]: 51: Hoare triple {22640#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {22640#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {22640#(< ~counter~0 97)} is VALID [2022-04-08 06:02:31,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {22665#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22640#(< ~counter~0 97)} is VALID [2022-04-08 06:02:31,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {22665#(< ~counter~0 96)} assume !(~r~0 < 0); {22665#(< ~counter~0 96)} is VALID [2022-04-08 06:02:31,797 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22276#true} {22665#(< ~counter~0 96)} #98#return; {22665#(< ~counter~0 96)} is VALID [2022-04-08 06:02:31,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,797 INFO L272 TraceCheckUtils]: 43: Hoare triple {22665#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {22665#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {22665#(< ~counter~0 96)} is VALID [2022-04-08 06:02:31,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {22690#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22665#(< ~counter~0 96)} is VALID [2022-04-08 06:02:31,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {22690#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22690#(< ~counter~0 95)} is VALID [2022-04-08 06:02:31,798 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22276#true} {22690#(< ~counter~0 95)} #98#return; {22690#(< ~counter~0 95)} is VALID [2022-04-08 06:02:31,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,799 INFO L272 TraceCheckUtils]: 35: Hoare triple {22690#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {22690#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {22690#(< ~counter~0 95)} is VALID [2022-04-08 06:02:31,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {22715#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22690#(< ~counter~0 95)} is VALID [2022-04-08 06:02:31,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {22715#(< ~counter~0 94)} assume !(~r~0 > 0); {22715#(< ~counter~0 94)} is VALID [2022-04-08 06:02:31,800 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22276#true} {22715#(< ~counter~0 94)} #96#return; {22715#(< ~counter~0 94)} is VALID [2022-04-08 06:02:31,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,800 INFO L272 TraceCheckUtils]: 27: Hoare triple {22715#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {22715#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {22715#(< ~counter~0 94)} is VALID [2022-04-08 06:02:31,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {22740#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22715#(< ~counter~0 94)} is VALID [2022-04-08 06:02:31,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {22740#(< ~counter~0 93)} assume !!(0 != ~r~0); {22740#(< ~counter~0 93)} is VALID [2022-04-08 06:02:31,802 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22276#true} {22740#(< ~counter~0 93)} #94#return; {22740#(< ~counter~0 93)} is VALID [2022-04-08 06:02:31,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,802 INFO L272 TraceCheckUtils]: 19: Hoare triple {22740#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {22740#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {22740#(< ~counter~0 93)} is VALID [2022-04-08 06:02:31,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {22765#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22740#(< ~counter~0 93)} is VALID [2022-04-08 06:02:31,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {22765#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22276#true} {22765#(< ~counter~0 92)} #92#return; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {22765#(< ~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)); {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22276#true} {22765#(< ~counter~0 92)} #90#return; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {22765#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22276#true} is VALID [2022-04-08 06:02:31,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {22765#(< ~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; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {22765#(< ~counter~0 92)} call #t~ret9 := main(); {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22765#(< ~counter~0 92)} {22276#true} #102#return; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {22765#(< ~counter~0 92)} assume true; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {22276#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22765#(< ~counter~0 92)} is VALID [2022-04-08 06:02:31,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {22276#true} call ULTIMATE.init(); {22276#true} is VALID [2022-04-08 06:02:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:02:31,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226931784] [2022-04-08 06:02:31,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:31,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30542582] [2022-04-08 06:02:31,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30542582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:31,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:31,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 06:02:31,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:31,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935482297] [2022-04-08 06:02:31,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935482297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:31,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:02:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635642869] [2022-04-08 06:02:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 06:02:31,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:31,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:31,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:31,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:02:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:02:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:02:31,867 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:32,529 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-08 06:02:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:02:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 06:02:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:02:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:02:32,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-08 06:02:32,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:32,670 INFO L225 Difference]: With dead ends: 188 [2022-04-08 06:02:32,670 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 06:02:32,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-08 06:02:32,672 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:32,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 222 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 06:02:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-08 06:02:32,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:32,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:02:32,872 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:02:32,872 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:02:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:32,875 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:02:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:02:32,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:32,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:32,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:02:32,876 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:02:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:32,878 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:02:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:02:32,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:32,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:32,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:32,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:02:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-08 06:02:32,881 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-08 06:02:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:32,881 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-08 06:02:32,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:32,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-08 06:02:35,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 222 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-08 06:02:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:02:35,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:35,132 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:35,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:35,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:35,332 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-08 06:02:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817628531] [2022-04-08 06:02:35,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-08 06:02:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458585292] [2022-04-08 06:02:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:35,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600331460] [2022-04-08 06:02:35,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:35,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:35,349 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:35,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 06:02:35,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:02:35,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:35,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 06:02:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:35,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:35,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {23925#true} call ULTIMATE.init(); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {23925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23925#true} {23925#true} #102#return; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {23925#true} call #t~ret9 := main(); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {23925#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; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {23925#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23925#true} {23925#true} #90#return; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L272 TraceCheckUtils]: 11: Hoare triple {23925#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)); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,699 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23925#true} {23925#true} #92#return; {23925#true} is VALID [2022-04-08 06:02:35,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {23925#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {23978#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,700 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {23978#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,701 INFO L272 TraceCheckUtils]: 27: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,701 INFO L290 TraceCheckUtils]: 28: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,702 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 > 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {23978#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,702 INFO L272 TraceCheckUtils]: 35: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,703 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {23978#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {23978#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,704 INFO L272 TraceCheckUtils]: 43: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,705 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 < 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {23978#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,705 INFO L290 TraceCheckUtils]: 50: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,705 INFO L272 TraceCheckUtils]: 51: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,706 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {23978#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,714 INFO L272 TraceCheckUtils]: 59: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:35,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,715 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:35,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {23978#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {24123#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,716 INFO L272 TraceCheckUtils]: 67: Hoare triple {24123#(< 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)); {23925#true} is VALID [2022-04-08 06:02:35,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,717 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23925#true} {24123#(< 0 (+ main_~r~0 1))} #96#return; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,718 INFO L290 TraceCheckUtils]: 73: Hoare triple {24123#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,718 INFO L272 TraceCheckUtils]: 75: Hoare triple {24123#(< 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)); {23925#true} is VALID [2022-04-08 06:02:35,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,718 INFO L290 TraceCheckUtils]: 77: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,718 INFO L290 TraceCheckUtils]: 78: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,719 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23925#true} {24123#(< 0 (+ main_~r~0 1))} #98#return; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23926#false} is VALID [2022-04-08 06:02:35,731 INFO L290 TraceCheckUtils]: 81: Hoare triple {23926#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23926#false} is VALID [2022-04-08 06:02:35,731 INFO L290 TraceCheckUtils]: 82: Hoare triple {23926#false} assume !(#t~post8 < 100);havoc #t~post8; {23926#false} is VALID [2022-04-08 06:02:35,731 INFO L290 TraceCheckUtils]: 83: Hoare triple {23926#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L290 TraceCheckUtils]: 84: Hoare triple {23926#false} assume !(#t~post6 < 100);havoc #t~post6; {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L272 TraceCheckUtils]: 85: Hoare triple {23926#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L290 TraceCheckUtils]: 86: Hoare triple {23926#false} ~cond := #in~cond; {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L290 TraceCheckUtils]: 87: Hoare triple {23926#false} assume 0 == ~cond; {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L290 TraceCheckUtils]: 88: Hoare triple {23926#false} assume !false; {23926#false} is VALID [2022-04-08 06:02:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 06:02:35,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 88: Hoare triple {23926#false} assume !false; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 87: Hoare triple {23926#false} assume 0 == ~cond; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 86: Hoare triple {23926#false} ~cond := #in~cond; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L272 TraceCheckUtils]: 85: Hoare triple {23926#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 84: Hoare triple {23926#false} assume !(#t~post6 < 100);havoc #t~post6; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 83: Hoare triple {23926#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 82: Hoare triple {23926#false} assume !(#t~post8 < 100);havoc #t~post8; {23926#false} is VALID [2022-04-08 06:02:35,979 INFO L290 TraceCheckUtils]: 81: Hoare triple {23926#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23926#false} is VALID [2022-04-08 06:02:35,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23926#false} is VALID [2022-04-08 06:02:35,980 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23925#true} {24123#(< 0 (+ main_~r~0 1))} #98#return; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,981 INFO L272 TraceCheckUtils]: 75: Hoare triple {24123#(< 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)); {23925#true} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 74: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 73: Hoare triple {24123#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,982 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23925#true} {24123#(< 0 (+ main_~r~0 1))} #96#return; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:35,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:35,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:35,982 INFO L272 TraceCheckUtils]: 67: Hoare triple {24123#(< 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)); {23925#true} is VALID [2022-04-08 06:02:35,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,983 INFO L290 TraceCheckUtils]: 65: Hoare triple {24123#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,983 INFO L290 TraceCheckUtils]: 64: Hoare triple {23978#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:02:35,999 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,000 INFO L272 TraceCheckUtils]: 59: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,000 INFO L290 TraceCheckUtils]: 57: Hoare triple {23978#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,001 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,001 INFO L272 TraceCheckUtils]: 51: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {23978#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 < 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,003 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,003 INFO L290 TraceCheckUtils]: 44: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,003 INFO L272 TraceCheckUtils]: 43: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {23978#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {23978#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,004 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,004 INFO L272 TraceCheckUtils]: 35: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {23978#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 > 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,006 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,006 INFO L272 TraceCheckUtils]: 27: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {23978#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,007 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,007 INFO L272 TraceCheckUtils]: 19: Hoare triple {23978#(<= 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)); {23925#true} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {23978#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {23925#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23978#(<= main_~v~0 1)} is VALID [2022-04-08 06:02:36,008 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23925#true} {23925#true} #92#return; {23925#true} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,008 INFO L272 TraceCheckUtils]: 11: Hoare triple {23925#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)); {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23925#true} {23925#true} #90#return; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {23925#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {23925#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; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {23925#true} call #t~ret9 := main(); {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23925#true} {23925#true} #102#return; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {23925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {23925#true} call ULTIMATE.init(); {23925#true} is VALID [2022-04-08 06:02:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 06:02:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:36,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458585292] [2022-04-08 06:02:36,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:36,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600331460] [2022-04-08 06:02:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600331460] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:36,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-08 06:02:36,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:36,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817628531] [2022-04-08 06:02:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817628531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:36,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081804568] [2022-04-08 06:02:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 06:02:36,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:36,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:36,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:36,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:02:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:02:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:36,054 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:36,692 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-08 06:02:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:02:36,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 06:02:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:02:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:02:36,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-08 06:02:36,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:36,818 INFO L225 Difference]: With dead ends: 407 [2022-04-08 06:02:36,818 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 06:02:36,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:02:36,826 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:36,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:02:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 06:02:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-08 06:02:37,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:37,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:02:37,299 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:02:37,300 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:02:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:37,305 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:02:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:02:37,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:37,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:37,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:02:37,306 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:02:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:37,311 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:02:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:02:37,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:37,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:37,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:37,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:02:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-08 06:02:37,318 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-08 06:02:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:37,318 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-08 06:02:37,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:37,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-08 06:02:39,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-08 06:02:39,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:02:39,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:39,562 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:39,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:39,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 06:02:39,762 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-08 06:02:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:39,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524182887] [2022-04-08 06:02:39,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-08 06:02:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:39,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672155622] [2022-04-08 06:02:39,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:39,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:39,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116542939] [2022-04-08 06:02:39,774 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:02:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:39,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:39,779 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:39,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 06:02:39,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:02:39,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:39,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:02:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:39,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:40,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {26472#true} call ULTIMATE.init(); {26472#true} is VALID [2022-04-08 06:02:40,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {26472#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26480#(<= ~counter~0 0)} {26472#true} #102#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {26480#(<= ~counter~0 0)} call #t~ret9 := main(); {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {26480#(<= ~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; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {26480#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {26480#(<= ~counter~0 0)} ~cond := #in~cond; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {26480#(<= ~counter~0 0)} assume !(0 == ~cond); {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26480#(<= ~counter~0 0)} {26480#(<= ~counter~0 0)} #90#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,362 INFO L272 TraceCheckUtils]: 11: Hoare triple {26480#(<= ~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)); {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {26480#(<= ~counter~0 0)} ~cond := #in~cond; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {26480#(<= ~counter~0 0)} assume !(0 == ~cond); {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,363 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26480#(<= ~counter~0 0)} {26480#(<= ~counter~0 0)} #92#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {26480#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26480#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:40,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {26480#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {26529#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {26529#(<= ~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)); {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {26529#(<= ~counter~0 1)} ~cond := #in~cond; {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {26529#(<= ~counter~0 1)} assume !(0 == ~cond); {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {26529#(<= ~counter~0 1)} assume true; {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,366 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26529#(<= ~counter~0 1)} {26529#(<= ~counter~0 1)} #94#return; {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {26529#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26529#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:40,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {26529#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {26554#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {26554#(<= ~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)); {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {26554#(<= ~counter~0 2)} ~cond := #in~cond; {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {26554#(<= ~counter~0 2)} assume !(0 == ~cond); {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {26554#(<= ~counter~0 2)} assume true; {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,368 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26554#(<= ~counter~0 2)} {26554#(<= ~counter~0 2)} #96#return; {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {26554#(<= ~counter~0 2)} assume !(~r~0 > 0); {26554#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:40,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {26554#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {26579#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {26579#(<= ~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)); {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {26579#(<= ~counter~0 3)} ~cond := #in~cond; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {26579#(<= ~counter~0 3)} assume !(0 == ~cond); {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {26579#(<= ~counter~0 3)} assume true; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,371 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26579#(<= ~counter~0 3)} {26579#(<= ~counter~0 3)} #98#return; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {26579#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26579#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:40,372 INFO L290 TraceCheckUtils]: 41: Hoare triple {26579#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {26604#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,373 INFO L272 TraceCheckUtils]: 43: Hoare triple {26604#(<= ~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)); {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {26604#(<= ~counter~0 4)} ~cond := #in~cond; {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {26604#(<= ~counter~0 4)} assume !(0 == ~cond); {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {26604#(<= ~counter~0 4)} assume true; {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,374 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26604#(<= ~counter~0 4)} {26604#(<= ~counter~0 4)} #98#return; {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {26604#(<= ~counter~0 4)} assume !(~r~0 < 0); {26604#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:40,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {26604#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {26629#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,375 INFO L272 TraceCheckUtils]: 51: Hoare triple {26629#(<= ~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)); {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {26629#(<= ~counter~0 5)} ~cond := #in~cond; {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {26629#(<= ~counter~0 5)} assume !(0 == ~cond); {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {26629#(<= ~counter~0 5)} assume true; {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,376 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26629#(<= ~counter~0 5)} {26629#(<= ~counter~0 5)} #94#return; {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {26629#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26629#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:40,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {26629#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {26654#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,378 INFO L272 TraceCheckUtils]: 59: Hoare triple {26654#(<= ~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)); {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {26654#(<= ~counter~0 6)} ~cond := #in~cond; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {26654#(<= ~counter~0 6)} assume !(0 == ~cond); {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {26654#(<= ~counter~0 6)} assume true; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,379 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26654#(<= ~counter~0 6)} {26654#(<= ~counter~0 6)} #96#return; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {26654#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26654#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:40,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {26654#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {26679#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,381 INFO L272 TraceCheckUtils]: 67: Hoare triple {26679#(<= ~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)); {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {26679#(<= ~counter~0 7)} ~cond := #in~cond; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {26679#(<= ~counter~0 7)} assume !(0 == ~cond); {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {26679#(<= ~counter~0 7)} assume true; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,382 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26679#(<= ~counter~0 7)} {26679#(<= ~counter~0 7)} #96#return; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,382 INFO L290 TraceCheckUtils]: 72: Hoare triple {26679#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26679#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:40,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {26679#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {26704#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,383 INFO L272 TraceCheckUtils]: 75: Hoare triple {26704#(<= ~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)); {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {26704#(<= ~counter~0 8)} ~cond := #in~cond; {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {26704#(<= ~counter~0 8)} assume !(0 == ~cond); {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {26704#(<= ~counter~0 8)} assume true; {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,385 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26704#(<= ~counter~0 8)} {26704#(<= ~counter~0 8)} #96#return; {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,385 INFO L290 TraceCheckUtils]: 80: Hoare triple {26704#(<= ~counter~0 8)} assume !(~r~0 > 0); {26704#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:40,385 INFO L290 TraceCheckUtils]: 81: Hoare triple {26704#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26729#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:40,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {26729#(<= ~counter~0 9)} assume !(#t~post8 < 100);havoc #t~post8; {26729#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:40,386 INFO L290 TraceCheckUtils]: 83: Hoare triple {26729#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26736#(<= |main_#t~post6| 9)} is VALID [2022-04-08 06:02:40,388 INFO L290 TraceCheckUtils]: 84: Hoare triple {26736#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {26473#false} is VALID [2022-04-08 06:02:40,388 INFO L272 TraceCheckUtils]: 85: Hoare triple {26473#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26473#false} is VALID [2022-04-08 06:02:40,388 INFO L290 TraceCheckUtils]: 86: Hoare triple {26473#false} ~cond := #in~cond; {26473#false} is VALID [2022-04-08 06:02:40,388 INFO L290 TraceCheckUtils]: 87: Hoare triple {26473#false} assume 0 == ~cond; {26473#false} is VALID [2022-04-08 06:02:40,388 INFO L290 TraceCheckUtils]: 88: Hoare triple {26473#false} assume !false; {26473#false} is VALID [2022-04-08 06:02:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:40,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:40,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {26473#false} assume !false; {26473#false} is VALID [2022-04-08 06:02:40,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {26473#false} assume 0 == ~cond; {26473#false} is VALID [2022-04-08 06:02:40,888 INFO L290 TraceCheckUtils]: 86: Hoare triple {26473#false} ~cond := #in~cond; {26473#false} is VALID [2022-04-08 06:02:40,888 INFO L272 TraceCheckUtils]: 85: Hoare triple {26473#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26473#false} is VALID [2022-04-08 06:02:40,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {26764#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {26473#false} is VALID [2022-04-08 06:02:40,890 INFO L290 TraceCheckUtils]: 83: Hoare triple {26768#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26764#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:02:40,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {26768#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {26768#(< ~counter~0 100)} is VALID [2022-04-08 06:02:40,892 INFO L290 TraceCheckUtils]: 81: Hoare triple {26775#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26768#(< ~counter~0 100)} is VALID [2022-04-08 06:02:40,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {26775#(< ~counter~0 99)} assume !(~r~0 > 0); {26775#(< ~counter~0 99)} is VALID [2022-04-08 06:02:40,893 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26472#true} {26775#(< ~counter~0 99)} #96#return; {26775#(< ~counter~0 99)} is VALID [2022-04-08 06:02:40,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,893 INFO L290 TraceCheckUtils]: 77: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,893 INFO L290 TraceCheckUtils]: 76: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,893 INFO L272 TraceCheckUtils]: 75: Hoare triple {26775#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,893 INFO L290 TraceCheckUtils]: 74: Hoare triple {26775#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {26775#(< ~counter~0 99)} is VALID [2022-04-08 06:02:40,894 INFO L290 TraceCheckUtils]: 73: Hoare triple {26800#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26775#(< ~counter~0 99)} is VALID [2022-04-08 06:02:40,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {26800#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26800#(< ~counter~0 98)} is VALID [2022-04-08 06:02:40,895 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26472#true} {26800#(< ~counter~0 98)} #96#return; {26800#(< ~counter~0 98)} is VALID [2022-04-08 06:02:40,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,895 INFO L290 TraceCheckUtils]: 69: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,895 INFO L290 TraceCheckUtils]: 68: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,895 INFO L272 TraceCheckUtils]: 67: Hoare triple {26800#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {26800#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {26800#(< ~counter~0 98)} is VALID [2022-04-08 06:02:40,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {26825#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26800#(< ~counter~0 98)} is VALID [2022-04-08 06:02:40,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {26825#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26825#(< ~counter~0 97)} is VALID [2022-04-08 06:02:40,896 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26472#true} {26825#(< ~counter~0 97)} #96#return; {26825#(< ~counter~0 97)} is VALID [2022-04-08 06:02:40,896 INFO L290 TraceCheckUtils]: 62: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,896 INFO L290 TraceCheckUtils]: 61: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,897 INFO L272 TraceCheckUtils]: 59: Hoare triple {26825#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {26825#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {26825#(< ~counter~0 97)} is VALID [2022-04-08 06:02:40,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {26850#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26825#(< ~counter~0 97)} is VALID [2022-04-08 06:02:40,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {26850#(< ~counter~0 96)} assume !!(0 != ~r~0); {26850#(< ~counter~0 96)} is VALID [2022-04-08 06:02:40,898 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26472#true} {26850#(< ~counter~0 96)} #94#return; {26850#(< ~counter~0 96)} is VALID [2022-04-08 06:02:40,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,898 INFO L272 TraceCheckUtils]: 51: Hoare triple {26850#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {26850#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {26850#(< ~counter~0 96)} is VALID [2022-04-08 06:02:40,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {26875#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26850#(< ~counter~0 96)} is VALID [2022-04-08 06:02:40,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {26875#(< ~counter~0 95)} assume !(~r~0 < 0); {26875#(< ~counter~0 95)} is VALID [2022-04-08 06:02:40,900 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26472#true} {26875#(< ~counter~0 95)} #98#return; {26875#(< ~counter~0 95)} is VALID [2022-04-08 06:02:40,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,900 INFO L272 TraceCheckUtils]: 43: Hoare triple {26875#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {26875#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {26875#(< ~counter~0 95)} is VALID [2022-04-08 06:02:40,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {26900#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26875#(< ~counter~0 95)} is VALID [2022-04-08 06:02:40,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {26900#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26900#(< ~counter~0 94)} is VALID [2022-04-08 06:02:40,901 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26472#true} {26900#(< ~counter~0 94)} #98#return; {26900#(< ~counter~0 94)} is VALID [2022-04-08 06:02:40,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,902 INFO L272 TraceCheckUtils]: 35: Hoare triple {26900#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {26900#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {26900#(< ~counter~0 94)} is VALID [2022-04-08 06:02:40,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {26925#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26900#(< ~counter~0 94)} is VALID [2022-04-08 06:02:40,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {26925#(< ~counter~0 93)} assume !(~r~0 > 0); {26925#(< ~counter~0 93)} is VALID [2022-04-08 06:02:40,903 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26472#true} {26925#(< ~counter~0 93)} #96#return; {26925#(< ~counter~0 93)} is VALID [2022-04-08 06:02:40,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,903 INFO L272 TraceCheckUtils]: 27: Hoare triple {26925#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {26925#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {26925#(< ~counter~0 93)} is VALID [2022-04-08 06:02:40,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {26950#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26925#(< ~counter~0 93)} is VALID [2022-04-08 06:02:40,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {26950#(< ~counter~0 92)} assume !!(0 != ~r~0); {26950#(< ~counter~0 92)} is VALID [2022-04-08 06:02:40,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26472#true} {26950#(< ~counter~0 92)} #94#return; {26950#(< ~counter~0 92)} is VALID [2022-04-08 06:02:40,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {26950#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {26950#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {26950#(< ~counter~0 92)} is VALID [2022-04-08 06:02:40,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {26975#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26950#(< ~counter~0 92)} is VALID [2022-04-08 06:02:40,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {26975#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,906 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26472#true} {26975#(< ~counter~0 91)} #92#return; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {26975#(< ~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)); {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26472#true} {26975#(< ~counter~0 91)} #90#return; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {26975#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26472#true} is VALID [2022-04-08 06:02:40,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {26975#(< ~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; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {26975#(< ~counter~0 91)} call #t~ret9 := main(); {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26975#(< ~counter~0 91)} {26472#true} #102#return; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {26975#(< ~counter~0 91)} assume true; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {26472#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26975#(< ~counter~0 91)} is VALID [2022-04-08 06:02:40,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {26472#true} call ULTIMATE.init(); {26472#true} is VALID [2022-04-08 06:02:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:02:40,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:40,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672155622] [2022-04-08 06:02:40,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:40,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116542939] [2022-04-08 06:02:40,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116542939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:40,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:40,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:02:40,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:40,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1524182887] [2022-04-08 06:02:40,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1524182887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:40,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:40,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:02:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314817602] [2022-04-08 06:02:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 06:02:40,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:40,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:40,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:40,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:02:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:02:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:02:40,984 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:42,053 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-08 06:02:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:02:42,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 06:02:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:02:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:02:42,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:02:42,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:42,258 INFO L225 Difference]: With dead ends: 362 [2022-04-08 06:02:42,258 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 06:02:42,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:02:42,261 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 152 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:42,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 249 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 06:02:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-08 06:02:42,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:42,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:42,827 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:42,828 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:42,849 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:02:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:02:42,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:42,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:42,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:02:42,866 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:02:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:42,872 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:02:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:02:42,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:42,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:42,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:42,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-08 06:02:42,880 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-08 06:02:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:42,880 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-08 06:02:42,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:42,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-08 06:02:45,456 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-08 06:02:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-08 06:02:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 06:02:45,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:45,457 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:45,464 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-08 06:02:45,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 06:02:45,658 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-08 06:02:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:45,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566916432] [2022-04-08 06:02:45,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-08 06:02:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358931644] [2022-04-08 06:02:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:45,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:45,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757689094] [2022-04-08 06:02:45,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:02:45,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:45,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:45,704 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:45,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 06:02:45,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:02:45,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:45,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:02:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:45,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:46,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {29163#true} call ULTIMATE.init(); {29163#true} is VALID [2022-04-08 06:02:46,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {29163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29171#(<= ~counter~0 0)} {29163#true} #102#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {29171#(<= ~counter~0 0)} call #t~ret9 := main(); {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {29171#(<= ~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; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {29171#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {29171#(<= ~counter~0 0)} ~cond := #in~cond; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {29171#(<= ~counter~0 0)} assume !(0 == ~cond); {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29171#(<= ~counter~0 0)} {29171#(<= ~counter~0 0)} #90#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,346 INFO L272 TraceCheckUtils]: 11: Hoare triple {29171#(<= ~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)); {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {29171#(<= ~counter~0 0)} ~cond := #in~cond; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {29171#(<= ~counter~0 0)} assume !(0 == ~cond); {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,347 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29171#(<= ~counter~0 0)} {29171#(<= ~counter~0 0)} #92#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {29171#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29171#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:46,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {29171#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {29220#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,349 INFO L272 TraceCheckUtils]: 19: Hoare triple {29220#(<= ~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)); {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {29220#(<= ~counter~0 1)} ~cond := #in~cond; {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {29220#(<= ~counter~0 1)} assume !(0 == ~cond); {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {29220#(<= ~counter~0 1)} assume true; {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,350 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29220#(<= ~counter~0 1)} {29220#(<= ~counter~0 1)} #94#return; {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {29220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {29220#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:46,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {29220#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {29245#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,352 INFO L272 TraceCheckUtils]: 27: Hoare triple {29245#(<= ~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)); {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {29245#(<= ~counter~0 2)} ~cond := #in~cond; {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {29245#(<= ~counter~0 2)} assume !(0 == ~cond); {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {29245#(<= ~counter~0 2)} assume true; {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,353 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29245#(<= ~counter~0 2)} {29245#(<= ~counter~0 2)} #96#return; {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {29245#(<= ~counter~0 2)} assume !(~r~0 > 0); {29245#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:46,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {29245#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {29270#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,354 INFO L272 TraceCheckUtils]: 35: Hoare triple {29270#(<= ~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)); {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {29270#(<= ~counter~0 3)} ~cond := #in~cond; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {29270#(<= ~counter~0 3)} assume !(0 == ~cond); {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {29270#(<= ~counter~0 3)} assume true; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,356 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29270#(<= ~counter~0 3)} {29270#(<= ~counter~0 3)} #98#return; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {29270#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29270#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:46,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {29270#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {29295#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,357 INFO L272 TraceCheckUtils]: 43: Hoare triple {29295#(<= ~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)); {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {29295#(<= ~counter~0 4)} ~cond := #in~cond; {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {29295#(<= ~counter~0 4)} assume !(0 == ~cond); {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,358 INFO L290 TraceCheckUtils]: 46: Hoare triple {29295#(<= ~counter~0 4)} assume true; {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,358 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29295#(<= ~counter~0 4)} {29295#(<= ~counter~0 4)} #98#return; {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {29295#(<= ~counter~0 4)} assume !(~r~0 < 0); {29295#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:46,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {29295#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {29320#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,360 INFO L272 TraceCheckUtils]: 51: Hoare triple {29320#(<= ~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)); {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {29320#(<= ~counter~0 5)} ~cond := #in~cond; {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {29320#(<= ~counter~0 5)} assume !(0 == ~cond); {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {29320#(<= ~counter~0 5)} assume true; {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,361 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29320#(<= ~counter~0 5)} {29320#(<= ~counter~0 5)} #94#return; {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {29320#(<= ~counter~0 5)} assume !!(0 != ~r~0); {29320#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:46,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {29320#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,362 INFO L290 TraceCheckUtils]: 58: Hoare triple {29345#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,363 INFO L272 TraceCheckUtils]: 59: Hoare triple {29345#(<= ~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)); {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,363 INFO L290 TraceCheckUtils]: 60: Hoare triple {29345#(<= ~counter~0 6)} ~cond := #in~cond; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,363 INFO L290 TraceCheckUtils]: 61: Hoare triple {29345#(<= ~counter~0 6)} assume !(0 == ~cond); {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {29345#(<= ~counter~0 6)} assume true; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,364 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29345#(<= ~counter~0 6)} {29345#(<= ~counter~0 6)} #96#return; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {29345#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29345#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:46,365 INFO L290 TraceCheckUtils]: 65: Hoare triple {29345#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,365 INFO L290 TraceCheckUtils]: 66: Hoare triple {29370#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,365 INFO L272 TraceCheckUtils]: 67: Hoare triple {29370#(<= ~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)); {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,366 INFO L290 TraceCheckUtils]: 68: Hoare triple {29370#(<= ~counter~0 7)} ~cond := #in~cond; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,366 INFO L290 TraceCheckUtils]: 69: Hoare triple {29370#(<= ~counter~0 7)} assume !(0 == ~cond); {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {29370#(<= ~counter~0 7)} assume true; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,366 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29370#(<= ~counter~0 7)} {29370#(<= ~counter~0 7)} #96#return; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,367 INFO L290 TraceCheckUtils]: 72: Hoare triple {29370#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29370#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:46,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {29370#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {29395#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,368 INFO L272 TraceCheckUtils]: 75: Hoare triple {29395#(<= ~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)); {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {29395#(<= ~counter~0 8)} ~cond := #in~cond; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {29395#(<= ~counter~0 8)} assume !(0 == ~cond); {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {29395#(<= ~counter~0 8)} assume true; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,369 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29395#(<= ~counter~0 8)} {29395#(<= ~counter~0 8)} #96#return; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,369 INFO L290 TraceCheckUtils]: 80: Hoare triple {29395#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29395#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {29395#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29420#(<= |main_#t~post7| 8)} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {29420#(<= |main_#t~post7| 8)} assume !(#t~post7 < 100);havoc #t~post7; {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 83: Hoare triple {29164#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {29164#false} assume !(#t~post8 < 100);havoc #t~post8; {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {29164#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {29164#false} assume !(#t~post6 < 100);havoc #t~post6; {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L272 TraceCheckUtils]: 87: Hoare triple {29164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29164#false} is VALID [2022-04-08 06:02:46,370 INFO L290 TraceCheckUtils]: 88: Hoare triple {29164#false} ~cond := #in~cond; {29164#false} is VALID [2022-04-08 06:02:46,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {29164#false} assume 0 == ~cond; {29164#false} is VALID [2022-04-08 06:02:46,371 INFO L290 TraceCheckUtils]: 90: Hoare triple {29164#false} assume !false; {29164#false} is VALID [2022-04-08 06:02:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:46,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:46,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {29164#false} assume !false; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 89: Hoare triple {29164#false} assume 0 == ~cond; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 88: Hoare triple {29164#false} ~cond := #in~cond; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L272 TraceCheckUtils]: 87: Hoare triple {29164#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {29164#false} assume !(#t~post6 < 100);havoc #t~post6; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {29164#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {29164#false} assume !(#t~post8 < 100);havoc #t~post8; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 83: Hoare triple {29164#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29164#false} is VALID [2022-04-08 06:02:46,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {29472#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {29164#false} is VALID [2022-04-08 06:02:46,849 INFO L290 TraceCheckUtils]: 81: Hoare triple {29476#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29472#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:02:46,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {29476#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29476#(< ~counter~0 100)} is VALID [2022-04-08 06:02:46,849 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29163#true} {29476#(< ~counter~0 100)} #96#return; {29476#(< ~counter~0 100)} is VALID [2022-04-08 06:02:46,849 INFO L290 TraceCheckUtils]: 78: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,850 INFO L272 TraceCheckUtils]: 75: Hoare triple {29476#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,850 INFO L290 TraceCheckUtils]: 74: Hoare triple {29476#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {29476#(< ~counter~0 100)} is VALID [2022-04-08 06:02:46,851 INFO L290 TraceCheckUtils]: 73: Hoare triple {29501#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29476#(< ~counter~0 100)} is VALID [2022-04-08 06:02:46,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {29501#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29501#(< ~counter~0 99)} is VALID [2022-04-08 06:02:46,852 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29163#true} {29501#(< ~counter~0 99)} #96#return; {29501#(< ~counter~0 99)} is VALID [2022-04-08 06:02:46,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,852 INFO L272 TraceCheckUtils]: 67: Hoare triple {29501#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {29501#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {29501#(< ~counter~0 99)} is VALID [2022-04-08 06:02:46,853 INFO L290 TraceCheckUtils]: 65: Hoare triple {29526#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29501#(< ~counter~0 99)} is VALID [2022-04-08 06:02:46,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {29526#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29526#(< ~counter~0 98)} is VALID [2022-04-08 06:02:46,853 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29163#true} {29526#(< ~counter~0 98)} #96#return; {29526#(< ~counter~0 98)} is VALID [2022-04-08 06:02:46,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {29526#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {29526#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {29526#(< ~counter~0 98)} is VALID [2022-04-08 06:02:46,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {29551#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29526#(< ~counter~0 98)} is VALID [2022-04-08 06:02:46,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {29551#(< ~counter~0 97)} assume !!(0 != ~r~0); {29551#(< ~counter~0 97)} is VALID [2022-04-08 06:02:46,855 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29163#true} {29551#(< ~counter~0 97)} #94#return; {29551#(< ~counter~0 97)} is VALID [2022-04-08 06:02:46,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,856 INFO L272 TraceCheckUtils]: 51: Hoare triple {29551#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {29551#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {29551#(< ~counter~0 97)} is VALID [2022-04-08 06:02:46,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {29576#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29551#(< ~counter~0 97)} is VALID [2022-04-08 06:02:46,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {29576#(< ~counter~0 96)} assume !(~r~0 < 0); {29576#(< ~counter~0 96)} is VALID [2022-04-08 06:02:46,857 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29163#true} {29576#(< ~counter~0 96)} #98#return; {29576#(< ~counter~0 96)} is VALID [2022-04-08 06:02:46,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,857 INFO L272 TraceCheckUtils]: 43: Hoare triple {29576#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {29576#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {29576#(< ~counter~0 96)} is VALID [2022-04-08 06:02:46,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {29601#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29576#(< ~counter~0 96)} is VALID [2022-04-08 06:02:46,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {29601#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29601#(< ~counter~0 95)} is VALID [2022-04-08 06:02:46,859 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29163#true} {29601#(< ~counter~0 95)} #98#return; {29601#(< ~counter~0 95)} is VALID [2022-04-08 06:02:46,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,859 INFO L272 TraceCheckUtils]: 35: Hoare triple {29601#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {29601#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {29601#(< ~counter~0 95)} is VALID [2022-04-08 06:02:46,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {29626#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29601#(< ~counter~0 95)} is VALID [2022-04-08 06:02:46,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {29626#(< ~counter~0 94)} assume !(~r~0 > 0); {29626#(< ~counter~0 94)} is VALID [2022-04-08 06:02:46,861 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29163#true} {29626#(< ~counter~0 94)} #96#return; {29626#(< ~counter~0 94)} is VALID [2022-04-08 06:02:46,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,861 INFO L272 TraceCheckUtils]: 27: Hoare triple {29626#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {29626#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {29626#(< ~counter~0 94)} is VALID [2022-04-08 06:02:46,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {29651#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29626#(< ~counter~0 94)} is VALID [2022-04-08 06:02:46,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {29651#(< ~counter~0 93)} assume !!(0 != ~r~0); {29651#(< ~counter~0 93)} is VALID [2022-04-08 06:02:46,862 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29163#true} {29651#(< ~counter~0 93)} #94#return; {29651#(< ~counter~0 93)} is VALID [2022-04-08 06:02:46,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,863 INFO L272 TraceCheckUtils]: 19: Hoare triple {29651#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {29651#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {29651#(< ~counter~0 93)} is VALID [2022-04-08 06:02:46,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {29676#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29651#(< ~counter~0 93)} is VALID [2022-04-08 06:02:46,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {29676#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29163#true} {29676#(< ~counter~0 92)} #92#return; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,864 INFO L272 TraceCheckUtils]: 11: Hoare triple {29676#(< ~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)); {29163#true} is VALID [2022-04-08 06:02:46,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29163#true} {29676#(< ~counter~0 92)} #90#return; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-08 06:02:46,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-08 06:02:46,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-08 06:02:46,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {29676#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {29163#true} is VALID [2022-04-08 06:02:46,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {29676#(< ~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; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {29676#(< ~counter~0 92)} call #t~ret9 := main(); {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29676#(< ~counter~0 92)} {29163#true} #102#return; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {29676#(< ~counter~0 92)} assume true; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {29163#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29676#(< ~counter~0 92)} is VALID [2022-04-08 06:02:46,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {29163#true} call ULTIMATE.init(); {29163#true} is VALID [2022-04-08 06:02:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:02:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358931644] [2022-04-08 06:02:46,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:46,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757689094] [2022-04-08 06:02:46,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757689094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:46,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:46,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 06:02:46,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:46,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566916432] [2022-04-08 06:02:46,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566916432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:46,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:46,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:02:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618103259] [2022-04-08 06:02:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 06:02:46,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:46,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:46,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:46,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:02:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:02:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:02:46,938 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:48,061 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-08 06:02:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:02:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 06:02:48,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:02:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:02:48,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:02:48,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:48,230 INFO L225 Difference]: With dead ends: 427 [2022-04-08 06:02:48,230 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 06:02:48,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-08 06:02:48,231 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 103 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:48,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 222 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 06:02:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 06:02:48,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:48,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:48,999 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:49,000 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:49,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:49,005 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:02:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:02:49,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:49,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:49,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:02:49,007 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:02:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:49,012 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:02:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:02:49,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:49,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:49,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:49,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-08 06:02:49,036 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-08 06:02:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:49,037 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-08 06:02:49,037 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:02:49,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-08 06:02:51,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 455 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:02:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 06:02:51,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:51,573 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:51,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:51,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 06:02:51,774 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-08 06:02:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1333976611] [2022-04-08 06:02:51,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-08 06:02:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:51,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507296748] [2022-04-08 06:02:51,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:51,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:51,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461018751] [2022-04-08 06:02:51,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:51,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:51,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:51,795 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 06:02:51,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:51,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:51,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:02:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:51,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:52,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {31966#true} call ULTIMATE.init(); {31966#true} is VALID [2022-04-08 06:02:52,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {31966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31974#(<= ~counter~0 0)} {31966#true} #102#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {31974#(<= ~counter~0 0)} call #t~ret9 := main(); {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {31974#(<= ~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; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {31974#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {31974#(<= ~counter~0 0)} ~cond := #in~cond; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {31974#(<= ~counter~0 0)} assume !(0 == ~cond); {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31974#(<= ~counter~0 0)} {31974#(<= ~counter~0 0)} #90#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,436 INFO L272 TraceCheckUtils]: 11: Hoare triple {31974#(<= ~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)); {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {31974#(<= ~counter~0 0)} ~cond := #in~cond; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {31974#(<= ~counter~0 0)} assume !(0 == ~cond); {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,437 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31974#(<= ~counter~0 0)} {31974#(<= ~counter~0 0)} #92#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {31974#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31974#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:52,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {31974#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {32023#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {32023#(<= ~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)); {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {32023#(<= ~counter~0 1)} ~cond := #in~cond; {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {32023#(<= ~counter~0 1)} assume !(0 == ~cond); {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {32023#(<= ~counter~0 1)} assume true; {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,440 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32023#(<= ~counter~0 1)} {32023#(<= ~counter~0 1)} #94#return; {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {32023#(<= ~counter~0 1)} assume !!(0 != ~r~0); {32023#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:52,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {32023#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {32048#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,442 INFO L272 TraceCheckUtils]: 27: Hoare triple {32048#(<= ~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)); {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {32048#(<= ~counter~0 2)} ~cond := #in~cond; {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {32048#(<= ~counter~0 2)} assume !(0 == ~cond); {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {32048#(<= ~counter~0 2)} assume true; {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,443 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32048#(<= ~counter~0 2)} {32048#(<= ~counter~0 2)} #96#return; {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {32048#(<= ~counter~0 2)} assume !(~r~0 > 0); {32048#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:52,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {32048#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {32073#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {32073#(<= ~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)); {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {32073#(<= ~counter~0 3)} ~cond := #in~cond; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {32073#(<= ~counter~0 3)} assume !(0 == ~cond); {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {32073#(<= ~counter~0 3)} assume true; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,446 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32073#(<= ~counter~0 3)} {32073#(<= ~counter~0 3)} #98#return; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {32073#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32073#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:52,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {32073#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {32098#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,447 INFO L272 TraceCheckUtils]: 43: Hoare triple {32098#(<= ~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)); {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {32098#(<= ~counter~0 4)} ~cond := #in~cond; {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {32098#(<= ~counter~0 4)} assume !(0 == ~cond); {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {32098#(<= ~counter~0 4)} assume true; {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,449 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32098#(<= ~counter~0 4)} {32098#(<= ~counter~0 4)} #98#return; {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {32098#(<= ~counter~0 4)} assume !(~r~0 < 0); {32098#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:52,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {32098#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {32123#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,450 INFO L272 TraceCheckUtils]: 51: Hoare triple {32123#(<= ~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)); {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {32123#(<= ~counter~0 5)} ~cond := #in~cond; {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {32123#(<= ~counter~0 5)} assume !(0 == ~cond); {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {32123#(<= ~counter~0 5)} assume true; {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,452 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32123#(<= ~counter~0 5)} {32123#(<= ~counter~0 5)} #94#return; {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {32123#(<= ~counter~0 5)} assume !!(0 != ~r~0); {32123#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:52,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {32123#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {32148#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,453 INFO L272 TraceCheckUtils]: 59: Hoare triple {32148#(<= ~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)); {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {32148#(<= ~counter~0 6)} ~cond := #in~cond; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {32148#(<= ~counter~0 6)} assume !(0 == ~cond); {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {32148#(<= ~counter~0 6)} assume true; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,454 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32148#(<= ~counter~0 6)} {32148#(<= ~counter~0 6)} #96#return; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {32148#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32148#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:52,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {32148#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {32173#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,456 INFO L272 TraceCheckUtils]: 67: Hoare triple {32173#(<= ~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)); {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {32173#(<= ~counter~0 7)} ~cond := #in~cond; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {32173#(<= ~counter~0 7)} assume !(0 == ~cond); {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {32173#(<= ~counter~0 7)} assume true; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,457 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32173#(<= ~counter~0 7)} {32173#(<= ~counter~0 7)} #96#return; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {32173#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32173#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:52,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {32173#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {32198#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,459 INFO L272 TraceCheckUtils]: 75: Hoare triple {32198#(<= ~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)); {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {32198#(<= ~counter~0 8)} ~cond := #in~cond; {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {32198#(<= ~counter~0 8)} assume !(0 == ~cond); {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,460 INFO L290 TraceCheckUtils]: 78: Hoare triple {32198#(<= ~counter~0 8)} assume true; {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,460 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32198#(<= ~counter~0 8)} {32198#(<= ~counter~0 8)} #96#return; {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,460 INFO L290 TraceCheckUtils]: 80: Hoare triple {32198#(<= ~counter~0 8)} assume !(~r~0 > 0); {32198#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:52,461 INFO L290 TraceCheckUtils]: 81: Hoare triple {32198#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,461 INFO L290 TraceCheckUtils]: 82: Hoare triple {32223#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,462 INFO L272 TraceCheckUtils]: 83: Hoare triple {32223#(<= ~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)); {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {32223#(<= ~counter~0 9)} ~cond := #in~cond; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {32223#(<= ~counter~0 9)} assume !(0 == ~cond); {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {32223#(<= ~counter~0 9)} assume true; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,463 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32223#(<= ~counter~0 9)} {32223#(<= ~counter~0 9)} #98#return; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,463 INFO L290 TraceCheckUtils]: 88: Hoare triple {32223#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32223#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:52,463 INFO L290 TraceCheckUtils]: 89: Hoare triple {32223#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32248#(<= |main_#t~post8| 9)} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {32248#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 91: Hoare triple {31967#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 92: Hoare triple {31967#false} assume !(#t~post6 < 100);havoc #t~post6; {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L272 TraceCheckUtils]: 93: Hoare triple {31967#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {31967#false} ~cond := #in~cond; {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {31967#false} assume 0 == ~cond; {31967#false} is VALID [2022-04-08 06:02:52,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {31967#false} assume !false; {31967#false} is VALID [2022-04-08 06:02:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:52,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:53,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {31967#false} assume !false; {31967#false} is VALID [2022-04-08 06:02:53,005 INFO L290 TraceCheckUtils]: 95: Hoare triple {31967#false} assume 0 == ~cond; {31967#false} is VALID [2022-04-08 06:02:53,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {31967#false} ~cond := #in~cond; {31967#false} is VALID [2022-04-08 06:02:53,005 INFO L272 TraceCheckUtils]: 93: Hoare triple {31967#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {31967#false} is VALID [2022-04-08 06:02:53,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {31967#false} assume !(#t~post6 < 100);havoc #t~post6; {31967#false} is VALID [2022-04-08 06:02:53,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {31967#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31967#false} is VALID [2022-04-08 06:02:53,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {32288#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {31967#false} is VALID [2022-04-08 06:02:53,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {32292#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32288#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:02:53,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {32292#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32292#(< ~counter~0 100)} is VALID [2022-04-08 06:02:53,007 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31966#true} {32292#(< ~counter~0 100)} #98#return; {32292#(< ~counter~0 100)} is VALID [2022-04-08 06:02:53,007 INFO L290 TraceCheckUtils]: 86: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,007 INFO L290 TraceCheckUtils]: 84: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,007 INFO L272 TraceCheckUtils]: 83: Hoare triple {32292#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,007 INFO L290 TraceCheckUtils]: 82: Hoare triple {32292#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {32292#(< ~counter~0 100)} is VALID [2022-04-08 06:02:53,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {32317#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32292#(< ~counter~0 100)} is VALID [2022-04-08 06:02:53,008 INFO L290 TraceCheckUtils]: 80: Hoare triple {32317#(< ~counter~0 99)} assume !(~r~0 > 0); {32317#(< ~counter~0 99)} is VALID [2022-04-08 06:02:53,009 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31966#true} {32317#(< ~counter~0 99)} #96#return; {32317#(< ~counter~0 99)} is VALID [2022-04-08 06:02:53,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,009 INFO L290 TraceCheckUtils]: 77: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,009 INFO L290 TraceCheckUtils]: 76: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,009 INFO L272 TraceCheckUtils]: 75: Hoare triple {32317#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,009 INFO L290 TraceCheckUtils]: 74: Hoare triple {32317#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {32317#(< ~counter~0 99)} is VALID [2022-04-08 06:02:53,010 INFO L290 TraceCheckUtils]: 73: Hoare triple {32342#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32317#(< ~counter~0 99)} is VALID [2022-04-08 06:02:53,010 INFO L290 TraceCheckUtils]: 72: Hoare triple {32342#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32342#(< ~counter~0 98)} is VALID [2022-04-08 06:02:53,011 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31966#true} {32342#(< ~counter~0 98)} #96#return; {32342#(< ~counter~0 98)} is VALID [2022-04-08 06:02:53,011 INFO L290 TraceCheckUtils]: 70: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,011 INFO L290 TraceCheckUtils]: 69: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,011 INFO L290 TraceCheckUtils]: 68: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,011 INFO L272 TraceCheckUtils]: 67: Hoare triple {32342#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {32342#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {32342#(< ~counter~0 98)} is VALID [2022-04-08 06:02:53,012 INFO L290 TraceCheckUtils]: 65: Hoare triple {32367#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32342#(< ~counter~0 98)} is VALID [2022-04-08 06:02:53,012 INFO L290 TraceCheckUtils]: 64: Hoare triple {32367#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32367#(< ~counter~0 97)} is VALID [2022-04-08 06:02:53,012 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31966#true} {32367#(< ~counter~0 97)} #96#return; {32367#(< ~counter~0 97)} is VALID [2022-04-08 06:02:53,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,013 INFO L290 TraceCheckUtils]: 61: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,013 INFO L290 TraceCheckUtils]: 60: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,013 INFO L272 TraceCheckUtils]: 59: Hoare triple {32367#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {32367#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {32367#(< ~counter~0 97)} is VALID [2022-04-08 06:02:53,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {32392#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32367#(< ~counter~0 97)} is VALID [2022-04-08 06:02:53,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {32392#(< ~counter~0 96)} assume !!(0 != ~r~0); {32392#(< ~counter~0 96)} is VALID [2022-04-08 06:02:53,014 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31966#true} {32392#(< ~counter~0 96)} #94#return; {32392#(< ~counter~0 96)} is VALID [2022-04-08 06:02:53,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,014 INFO L272 TraceCheckUtils]: 51: Hoare triple {32392#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {32392#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {32392#(< ~counter~0 96)} is VALID [2022-04-08 06:02:53,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {32417#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32392#(< ~counter~0 96)} is VALID [2022-04-08 06:02:53,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {32417#(< ~counter~0 95)} assume !(~r~0 < 0); {32417#(< ~counter~0 95)} is VALID [2022-04-08 06:02:53,016 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31966#true} {32417#(< ~counter~0 95)} #98#return; {32417#(< ~counter~0 95)} is VALID [2022-04-08 06:02:53,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,016 INFO L272 TraceCheckUtils]: 43: Hoare triple {32417#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {32417#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {32417#(< ~counter~0 95)} is VALID [2022-04-08 06:02:53,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {32442#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32417#(< ~counter~0 95)} is VALID [2022-04-08 06:02:53,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {32442#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32442#(< ~counter~0 94)} is VALID [2022-04-08 06:02:53,018 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31966#true} {32442#(< ~counter~0 94)} #98#return; {32442#(< ~counter~0 94)} is VALID [2022-04-08 06:02:53,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,018 INFO L272 TraceCheckUtils]: 35: Hoare triple {32442#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {32442#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {32442#(< ~counter~0 94)} is VALID [2022-04-08 06:02:53,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {32467#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32442#(< ~counter~0 94)} is VALID [2022-04-08 06:02:53,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {32467#(< ~counter~0 93)} assume !(~r~0 > 0); {32467#(< ~counter~0 93)} is VALID [2022-04-08 06:02:53,020 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31966#true} {32467#(< ~counter~0 93)} #96#return; {32467#(< ~counter~0 93)} is VALID [2022-04-08 06:02:53,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,020 INFO L272 TraceCheckUtils]: 27: Hoare triple {32467#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {32467#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {32467#(< ~counter~0 93)} is VALID [2022-04-08 06:02:53,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {32492#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32467#(< ~counter~0 93)} is VALID [2022-04-08 06:02:53,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {32492#(< ~counter~0 92)} assume !!(0 != ~r~0); {32492#(< ~counter~0 92)} is VALID [2022-04-08 06:02:53,021 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31966#true} {32492#(< ~counter~0 92)} #94#return; {32492#(< ~counter~0 92)} is VALID [2022-04-08 06:02:53,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,022 INFO L272 TraceCheckUtils]: 19: Hoare triple {32492#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {32492#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {32492#(< ~counter~0 92)} is VALID [2022-04-08 06:02:53,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {32517#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32492#(< ~counter~0 92)} is VALID [2022-04-08 06:02:53,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {32517#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,023 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31966#true} {32517#(< ~counter~0 91)} #92#return; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,023 INFO L272 TraceCheckUtils]: 11: Hoare triple {32517#(< ~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)); {31966#true} is VALID [2022-04-08 06:02:53,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31966#true} {32517#(< ~counter~0 91)} #90#return; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-08 06:02:53,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-08 06:02:53,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-08 06:02:53,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {32517#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31966#true} is VALID [2022-04-08 06:02:53,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {32517#(< ~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; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {32517#(< ~counter~0 91)} call #t~ret9 := main(); {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32517#(< ~counter~0 91)} {31966#true} #102#return; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {32517#(< ~counter~0 91)} assume true; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {31966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {32517#(< ~counter~0 91)} is VALID [2022-04-08 06:02:53,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {31966#true} call ULTIMATE.init(); {31966#true} is VALID [2022-04-08 06:02:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 06:02:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:53,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507296748] [2022-04-08 06:02:53,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:53,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461018751] [2022-04-08 06:02:53,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461018751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:53,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:53,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:02:53,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:53,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1333976611] [2022-04-08 06:02:53,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1333976611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:53,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:53,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:02:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704007054] [2022-04-08 06:02:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 06:02:53,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:53,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:53,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:53,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:02:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:02:53,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:02:53,094 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:54,319 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-08 06:02:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 06:02:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 06:02:54,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:02:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:02:54,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-08 06:02:54,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:54,539 INFO L225 Difference]: With dead ends: 467 [2022-04-08 06:02:54,539 INFO L226 Difference]: Without dead ends: 352 [2022-04-08 06:02:54,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-08 06:02:54,540 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:54,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 253 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-08 06:02:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-08 06:02:55,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:55,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:55,111 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:55,111 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:55,117 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:02:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:02:55,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:55,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:55,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:02:55,118 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:02:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:55,125 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:02:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:02:55,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:55,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:55,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:55,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-08 06:02:55,133 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-08 06:02:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:55,133 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-08 06:02:55,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:55,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-08 06:02:56,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-08 06:02:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:02:56,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:56,021 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:56,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:56,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 06:02:56,221 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-08 06:02:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477765258] [2022-04-08 06:02:56,222 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-08 06:02:56,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:56,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891367610] [2022-04-08 06:02:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:56,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682044749] [2022-04-08 06:02:56,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:02:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:56,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:56,234 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:56,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 06:02:56,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:02:56,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:56,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:02:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:56,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:56,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {34911#true} call ULTIMATE.init(); {34911#true} is VALID [2022-04-08 06:02:56,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {34911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34911#true} is VALID [2022-04-08 06:02:56,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34911#true} {34911#true} #102#return; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {34911#true} call #t~ret9 := main(); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {34911#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; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {34911#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34911#true} {34911#true} #90#return; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34911#true} {34911#true} #92#return; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {34911#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {34911#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {34911#true} assume !!(#t~post6 < 100);havoc #t~post6; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L272 TraceCheckUtils]: 19: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34911#true} {34911#true} #94#return; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {34911#true} assume !!(0 != ~r~0); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {34911#true} assume !!(#t~post7 < 100);havoc #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L272 TraceCheckUtils]: 27: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {34911#true} assume !(~r~0 > 0); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {34911#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {34911#true} assume !!(#t~post8 < 100);havoc #t~post8; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L272 TraceCheckUtils]: 35: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34911#true} {34911#true} #98#return; {34911#true} is VALID [2022-04-08 06:02:56,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {34911#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {34911#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {34911#true} assume !!(#t~post8 < 100);havoc #t~post8; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L272 TraceCheckUtils]: 43: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34911#true} {34911#true} #98#return; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {34911#true} assume !(~r~0 < 0); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {34911#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {34911#true} assume !!(#t~post6 < 100);havoc #t~post6; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L272 TraceCheckUtils]: 51: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 52: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34911#true} {34911#true} #94#return; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {34911#true} assume !!(0 != ~r~0); {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 57: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {34911#true} assume !!(#t~post7 < 100);havoc #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,541 INFO L272 TraceCheckUtils]: 59: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 64: Hoare triple {34911#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#true} assume !!(#t~post7 < 100);havoc #t~post7; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L272 TraceCheckUtils]: 67: Hoare triple {34911#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)); {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 68: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-08 06:02:56,542 INFO L290 TraceCheckUtils]: 72: Hoare triple {34911#true} assume !(~r~0 > 0); {35132#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:02:56,543 INFO L290 TraceCheckUtils]: 73: Hoare triple {35132#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35132#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:02:56,543 INFO L290 TraceCheckUtils]: 74: Hoare triple {35132#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {35132#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:02:56,543 INFO L272 TraceCheckUtils]: 75: Hoare triple {35132#(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)); {34911#true} is VALID [2022-04-08 06:02:56,543 INFO L290 TraceCheckUtils]: 76: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,543 INFO L290 TraceCheckUtils]: 77: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,543 INFO L290 TraceCheckUtils]: 78: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,544 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34911#true} {35132#(not (< 0 main_~r~0))} #98#return; {35132#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:02:56,544 INFO L290 TraceCheckUtils]: 80: Hoare triple {35132#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:56,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:56,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:56,545 INFO L272 TraceCheckUtils]: 83: Hoare triple {35157#(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)); {34911#true} is VALID [2022-04-08 06:02:56,545 INFO L290 TraceCheckUtils]: 84: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-08 06:02:56,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-08 06:02:56,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-08 06:02:56,546 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34911#true} {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {34912#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {34912#false} assume !(#t~post7 < 100);havoc #t~post7; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {34912#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {34912#false} assume !(#t~post8 < 100);havoc #t~post8; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {34912#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {34912#false} assume !(#t~post6 < 100);havoc #t~post6; {34912#false} is VALID [2022-04-08 06:02:56,546 INFO L272 TraceCheckUtils]: 95: Hoare triple {34912#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34912#false} is VALID [2022-04-08 06:02:56,547 INFO L290 TraceCheckUtils]: 96: Hoare triple {34912#false} ~cond := #in~cond; {34912#false} is VALID [2022-04-08 06:02:56,547 INFO L290 TraceCheckUtils]: 97: Hoare triple {34912#false} assume 0 == ~cond; {34912#false} is VALID [2022-04-08 06:02:56,547 INFO L290 TraceCheckUtils]: 98: Hoare triple {34912#false} assume !false; {34912#false} is VALID [2022-04-08 06:02:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-08 06:02:56,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:02:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:56,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891367610] [2022-04-08 06:02:56,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:56,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682044749] [2022-04-08 06:02:56,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682044749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:56,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:56,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:56,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:56,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477765258] [2022-04-08 06:02:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477765258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:56,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:02:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408525059] [2022-04-08 06:02:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 06:02:56,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:56,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:56,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:56,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:02:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:02:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:56,590 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:57,297 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-08 06:02:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:02:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 06:02:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:02:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:02:57,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:02:57,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:57,374 INFO L225 Difference]: With dead ends: 504 [2022-04-08 06:02:57,374 INFO L226 Difference]: Without dead ends: 362 [2022-04-08 06:02:57,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:02:57,375 INFO L913 BasicCegarLoop]: 52 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, 121 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:57,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:02:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-08 06:02:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-08 06:02:57,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:57,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:57,956 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:57,956 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:57,962 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:02:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:02:57,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:57,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:57,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:02:57,963 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:02:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:57,969 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:02:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:02:57,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:57,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:57,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:57,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-08 06:02:57,977 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-08 06:02:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:57,977 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-08 06:02:57,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:02:57,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-08 06:02:59,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-08 06:02:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:02:59,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:59,753 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:02:59,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:59,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 06:02:59,953 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-08 06:02:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:59,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043813111] [2022-04-08 06:02:59,954 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-08 06:02:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:59,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778715464] [2022-04-08 06:02:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:59,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:59,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:59,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650150560] [2022-04-08 06:02:59,994 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:59,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:00,003 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 06:03:00,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:00,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:00,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:03:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:00,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:00,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {37647#true} call ULTIMATE.init(); {37647#true} is VALID [2022-04-08 06:03:00,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {37647#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37655#(<= ~counter~0 0)} {37647#true} #102#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {37655#(<= ~counter~0 0)} call #t~ret9 := main(); {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {37655#(<= ~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; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {37655#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {37655#(<= ~counter~0 0)} ~cond := #in~cond; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {37655#(<= ~counter~0 0)} assume !(0 == ~cond); {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37655#(<= ~counter~0 0)} {37655#(<= ~counter~0 0)} #90#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {37655#(<= ~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)); {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {37655#(<= ~counter~0 0)} ~cond := #in~cond; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {37655#(<= ~counter~0 0)} assume !(0 == ~cond); {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37655#(<= ~counter~0 0)} {37655#(<= ~counter~0 0)} #92#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {37655#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37655#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:00,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {37655#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {37704#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {37704#(<= ~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)); {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {37704#(<= ~counter~0 1)} ~cond := #in~cond; {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {37704#(<= ~counter~0 1)} assume !(0 == ~cond); {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {37704#(<= ~counter~0 1)} assume true; {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,860 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37704#(<= ~counter~0 1)} {37704#(<= ~counter~0 1)} #94#return; {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {37704#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37704#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:00,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {37704#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {37729#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,861 INFO L272 TraceCheckUtils]: 27: Hoare triple {37729#(<= ~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)); {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {37729#(<= ~counter~0 2)} ~cond := #in~cond; {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {37729#(<= ~counter~0 2)} assume !(0 == ~cond); {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {37729#(<= ~counter~0 2)} assume true; {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,862 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37729#(<= ~counter~0 2)} {37729#(<= ~counter~0 2)} #96#return; {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {37729#(<= ~counter~0 2)} assume !(~r~0 > 0); {37729#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:00,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {37729#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {37754#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,863 INFO L272 TraceCheckUtils]: 35: Hoare triple {37754#(<= ~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)); {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {37754#(<= ~counter~0 3)} ~cond := #in~cond; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {37754#(<= ~counter~0 3)} assume !(0 == ~cond); {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {37754#(<= ~counter~0 3)} assume true; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,864 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37754#(<= ~counter~0 3)} {37754#(<= ~counter~0 3)} #98#return; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {37754#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37754#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:00,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {37754#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {37779#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,865 INFO L272 TraceCheckUtils]: 43: Hoare triple {37779#(<= ~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)); {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {37779#(<= ~counter~0 4)} ~cond := #in~cond; {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {37779#(<= ~counter~0 4)} assume !(0 == ~cond); {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {37779#(<= ~counter~0 4)} assume true; {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,866 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37779#(<= ~counter~0 4)} {37779#(<= ~counter~0 4)} #98#return; {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {37779#(<= ~counter~0 4)} assume !(~r~0 < 0); {37779#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:00,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {37779#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {37804#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {37804#(<= ~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)); {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {37804#(<= ~counter~0 5)} ~cond := #in~cond; {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {37804#(<= ~counter~0 5)} assume !(0 == ~cond); {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {37804#(<= ~counter~0 5)} assume true; {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,868 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37804#(<= ~counter~0 5)} {37804#(<= ~counter~0 5)} #94#return; {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {37804#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37804#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:00,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {37804#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {37829#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {37829#(<= ~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)); {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {37829#(<= ~counter~0 6)} ~cond := #in~cond; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {37829#(<= ~counter~0 6)} assume !(0 == ~cond); {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {37829#(<= ~counter~0 6)} assume true; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,870 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37829#(<= ~counter~0 6)} {37829#(<= ~counter~0 6)} #96#return; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {37829#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37829#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:00,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {37829#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,871 INFO L290 TraceCheckUtils]: 66: Hoare triple {37854#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,871 INFO L272 TraceCheckUtils]: 67: Hoare triple {37854#(<= ~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)); {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {37854#(<= ~counter~0 7)} ~cond := #in~cond; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {37854#(<= ~counter~0 7)} assume !(0 == ~cond); {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {37854#(<= ~counter~0 7)} assume true; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,872 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37854#(<= ~counter~0 7)} {37854#(<= ~counter~0 7)} #96#return; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {37854#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37854#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:00,872 INFO L290 TraceCheckUtils]: 73: Hoare triple {37854#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {37879#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,873 INFO L272 TraceCheckUtils]: 75: Hoare triple {37879#(<= ~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)); {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,873 INFO L290 TraceCheckUtils]: 76: Hoare triple {37879#(<= ~counter~0 8)} ~cond := #in~cond; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {37879#(<= ~counter~0 8)} assume !(0 == ~cond); {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,873 INFO L290 TraceCheckUtils]: 78: Hoare triple {37879#(<= ~counter~0 8)} assume true; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,874 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37879#(<= ~counter~0 8)} {37879#(<= ~counter~0 8)} #96#return; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,874 INFO L290 TraceCheckUtils]: 80: Hoare triple {37879#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37879#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:00,874 INFO L290 TraceCheckUtils]: 81: Hoare triple {37879#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {37904#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,875 INFO L272 TraceCheckUtils]: 83: Hoare triple {37904#(<= ~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)); {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,875 INFO L290 TraceCheckUtils]: 84: Hoare triple {37904#(<= ~counter~0 9)} ~cond := #in~cond; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,875 INFO L290 TraceCheckUtils]: 85: Hoare triple {37904#(<= ~counter~0 9)} assume !(0 == ~cond); {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {37904#(<= ~counter~0 9)} assume true; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,875 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37904#(<= ~counter~0 9)} {37904#(<= ~counter~0 9)} #96#return; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {37904#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37904#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:00,876 INFO L290 TraceCheckUtils]: 89: Hoare triple {37904#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37929#(<= |main_#t~post7| 9)} is VALID [2022-04-08 06:03:00,876 INFO L290 TraceCheckUtils]: 90: Hoare triple {37929#(<= |main_#t~post7| 9)} assume !(#t~post7 < 100);havoc #t~post7; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 91: Hoare triple {37648#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 92: Hoare triple {37648#false} assume !(#t~post8 < 100);havoc #t~post8; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 93: Hoare triple {37648#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 94: Hoare triple {37648#false} assume !(#t~post6 < 100);havoc #t~post6; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L272 TraceCheckUtils]: 95: Hoare triple {37648#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 96: Hoare triple {37648#false} ~cond := #in~cond; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 97: Hoare triple {37648#false} assume 0 == ~cond; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L290 TraceCheckUtils]: 98: Hoare triple {37648#false} assume !false; {37648#false} is VALID [2022-04-08 06:03:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:00,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:01,216 INFO L290 TraceCheckUtils]: 98: Hoare triple {37648#false} assume !false; {37648#false} is VALID [2022-04-08 06:03:01,216 INFO L290 TraceCheckUtils]: 97: Hoare triple {37648#false} assume 0 == ~cond; {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L290 TraceCheckUtils]: 96: Hoare triple {37648#false} ~cond := #in~cond; {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L272 TraceCheckUtils]: 95: Hoare triple {37648#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L290 TraceCheckUtils]: 94: Hoare triple {37648#false} assume !(#t~post6 < 100);havoc #t~post6; {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L290 TraceCheckUtils]: 93: Hoare triple {37648#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L290 TraceCheckUtils]: 92: Hoare triple {37648#false} assume !(#t~post8 < 100);havoc #t~post8; {37648#false} is VALID [2022-04-08 06:03:01,217 INFO L290 TraceCheckUtils]: 91: Hoare triple {37648#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37648#false} is VALID [2022-04-08 06:03:01,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {37981#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {37648#false} is VALID [2022-04-08 06:03:01,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {37985#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37981#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:03:01,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {37985#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37985#(< ~counter~0 100)} is VALID [2022-04-08 06:03:01,219 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37647#true} {37985#(< ~counter~0 100)} #96#return; {37985#(< ~counter~0 100)} is VALID [2022-04-08 06:03:01,219 INFO L290 TraceCheckUtils]: 86: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,219 INFO L290 TraceCheckUtils]: 85: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,219 INFO L290 TraceCheckUtils]: 84: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,219 INFO L272 TraceCheckUtils]: 83: Hoare triple {37985#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {37985#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {37985#(< ~counter~0 100)} is VALID [2022-04-08 06:03:01,220 INFO L290 TraceCheckUtils]: 81: Hoare triple {38010#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37985#(< ~counter~0 100)} is VALID [2022-04-08 06:03:01,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {38010#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38010#(< ~counter~0 99)} is VALID [2022-04-08 06:03:01,221 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37647#true} {38010#(< ~counter~0 99)} #96#return; {38010#(< ~counter~0 99)} is VALID [2022-04-08 06:03:01,221 INFO L290 TraceCheckUtils]: 78: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,221 INFO L272 TraceCheckUtils]: 75: Hoare triple {38010#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,221 INFO L290 TraceCheckUtils]: 74: Hoare triple {38010#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {38010#(< ~counter~0 99)} is VALID [2022-04-08 06:03:01,222 INFO L290 TraceCheckUtils]: 73: Hoare triple {38035#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38010#(< ~counter~0 99)} is VALID [2022-04-08 06:03:01,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {38035#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38035#(< ~counter~0 98)} is VALID [2022-04-08 06:03:01,222 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37647#true} {38035#(< ~counter~0 98)} #96#return; {38035#(< ~counter~0 98)} is VALID [2022-04-08 06:03:01,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,222 INFO L290 TraceCheckUtils]: 69: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,222 INFO L290 TraceCheckUtils]: 68: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,222 INFO L272 TraceCheckUtils]: 67: Hoare triple {38035#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {38035#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {38035#(< ~counter~0 98)} is VALID [2022-04-08 06:03:01,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {38060#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38035#(< ~counter~0 98)} is VALID [2022-04-08 06:03:01,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {38060#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38060#(< ~counter~0 97)} is VALID [2022-04-08 06:03:01,224 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37647#true} {38060#(< ~counter~0 97)} #96#return; {38060#(< ~counter~0 97)} is VALID [2022-04-08 06:03:01,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,224 INFO L272 TraceCheckUtils]: 59: Hoare triple {38060#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {38060#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {38060#(< ~counter~0 97)} is VALID [2022-04-08 06:03:01,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {38085#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38060#(< ~counter~0 97)} is VALID [2022-04-08 06:03:01,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {38085#(< ~counter~0 96)} assume !!(0 != ~r~0); {38085#(< ~counter~0 96)} is VALID [2022-04-08 06:03:01,225 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37647#true} {38085#(< ~counter~0 96)} #94#return; {38085#(< ~counter~0 96)} is VALID [2022-04-08 06:03:01,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,225 INFO L290 TraceCheckUtils]: 52: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,225 INFO L272 TraceCheckUtils]: 51: Hoare triple {38085#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {38085#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {38085#(< ~counter~0 96)} is VALID [2022-04-08 06:03:01,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {38110#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38085#(< ~counter~0 96)} is VALID [2022-04-08 06:03:01,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {38110#(< ~counter~0 95)} assume !(~r~0 < 0); {38110#(< ~counter~0 95)} is VALID [2022-04-08 06:03:01,226 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37647#true} {38110#(< ~counter~0 95)} #98#return; {38110#(< ~counter~0 95)} is VALID [2022-04-08 06:03:01,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,226 INFO L272 TraceCheckUtils]: 43: Hoare triple {38110#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {38110#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {38110#(< ~counter~0 95)} is VALID [2022-04-08 06:03:01,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {38135#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38110#(< ~counter~0 95)} is VALID [2022-04-08 06:03:01,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {38135#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38135#(< ~counter~0 94)} is VALID [2022-04-08 06:03:01,227 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37647#true} {38135#(< ~counter~0 94)} #98#return; {38135#(< ~counter~0 94)} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,228 INFO L272 TraceCheckUtils]: 35: Hoare triple {38135#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {38135#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {38135#(< ~counter~0 94)} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {38160#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38135#(< ~counter~0 94)} is VALID [2022-04-08 06:03:01,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {38160#(< ~counter~0 93)} assume !(~r~0 > 0); {38160#(< ~counter~0 93)} is VALID [2022-04-08 06:03:01,229 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37647#true} {38160#(< ~counter~0 93)} #96#return; {38160#(< ~counter~0 93)} is VALID [2022-04-08 06:03:01,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,229 INFO L272 TraceCheckUtils]: 27: Hoare triple {38160#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {38160#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {38160#(< ~counter~0 93)} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {38185#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38160#(< ~counter~0 93)} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {38185#(< ~counter~0 92)} assume !!(0 != ~r~0); {38185#(< ~counter~0 92)} is VALID [2022-04-08 06:03:01,230 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37647#true} {38185#(< ~counter~0 92)} #94#return; {38185#(< ~counter~0 92)} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,230 INFO L272 TraceCheckUtils]: 19: Hoare triple {38185#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {38185#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {38185#(< ~counter~0 92)} is VALID [2022-04-08 06:03:01,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {38210#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38185#(< ~counter~0 92)} is VALID [2022-04-08 06:03:01,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {38210#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,231 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37647#true} {38210#(< ~counter~0 91)} #92#return; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L272 TraceCheckUtils]: 11: Hoare triple {38210#(< ~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)); {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37647#true} {38210#(< ~counter~0 91)} #90#return; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L272 TraceCheckUtils]: 6: Hoare triple {38210#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37647#true} is VALID [2022-04-08 06:03:01,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {38210#(< ~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; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {38210#(< ~counter~0 91)} call #t~ret9 := main(); {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38210#(< ~counter~0 91)} {37647#true} #102#return; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {38210#(< ~counter~0 91)} assume true; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {37647#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38210#(< ~counter~0 91)} is VALID [2022-04-08 06:03:01,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {37647#true} call ULTIMATE.init(); {37647#true} is VALID [2022-04-08 06:03:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 06:03:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778715464] [2022-04-08 06:03:01,234 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650150560] [2022-04-08 06:03:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650150560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:01,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:01,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 06:03:01,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043813111] [2022-04-08 06:03:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043813111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:01,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:01,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:03:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118626006] [2022-04-08 06:03:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 06:03:01,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:01,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:03:01,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:01,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:03:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:03:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 06:03:01,301 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:03:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,247 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-08 06:03:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:03:02,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 06:03:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:03:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:03:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:03:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:03:02,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-08 06:03:02,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:02,392 INFO L225 Difference]: With dead ends: 471 [2022-04-08 06:03:02,392 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 06:03:02,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:03:02,393 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 110 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:02,393 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 246 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 06:03:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-08 06:03:02,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:02,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:02,856 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:02,856 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,864 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:03:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:03:02,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:02,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:02,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:03:02,866 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:03:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:02,890 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:03:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:03:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:02,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:02,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:02,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:03:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-08 06:03:02,917 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-08 06:03:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:02,917 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-08 06:03:02,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:03:02,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-08 06:03:05,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 479 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:03:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 06:03:05,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:05,437 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:05,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:05,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:05,637 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-08 06:03:05,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:05,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684359149] [2022-04-08 06:03:05,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-08 06:03:05,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:05,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946056887] [2022-04-08 06:03:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:05,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:05,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930599641] [2022-04-08 06:03:05,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:05,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:05,658 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:05,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 06:03:05,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:05,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:05,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:03:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:05,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:06,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {40678#true} call ULTIMATE.init(); {40678#true} is VALID [2022-04-08 06:03:06,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {40678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40686#(<= ~counter~0 0)} {40678#true} #102#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {40686#(<= ~counter~0 0)} call #t~ret9 := main(); {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {40686#(<= ~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; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {40686#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {40686#(<= ~counter~0 0)} ~cond := #in~cond; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {40686#(<= ~counter~0 0)} assume !(0 == ~cond); {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40686#(<= ~counter~0 0)} {40686#(<= ~counter~0 0)} #90#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {40686#(<= ~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)); {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {40686#(<= ~counter~0 0)} ~cond := #in~cond; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {40686#(<= ~counter~0 0)} assume !(0 == ~cond); {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40686#(<= ~counter~0 0)} {40686#(<= ~counter~0 0)} #92#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {40686#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {40686#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:06,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {40686#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {40735#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {40735#(<= ~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)); {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {40735#(<= ~counter~0 1)} ~cond := #in~cond; {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {40735#(<= ~counter~0 1)} assume !(0 == ~cond); {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {40735#(<= ~counter~0 1)} assume true; {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40735#(<= ~counter~0 1)} {40735#(<= ~counter~0 1)} #94#return; {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {40735#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40735#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:06,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {40735#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {40760#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,508 INFO L272 TraceCheckUtils]: 27: Hoare triple {40760#(<= ~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)); {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {40760#(<= ~counter~0 2)} ~cond := #in~cond; {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {40760#(<= ~counter~0 2)} assume !(0 == ~cond); {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {40760#(<= ~counter~0 2)} assume true; {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,510 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40760#(<= ~counter~0 2)} {40760#(<= ~counter~0 2)} #96#return; {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {40760#(<= ~counter~0 2)} assume !(~r~0 > 0); {40760#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:06,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {40760#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {40785#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,511 INFO L272 TraceCheckUtils]: 35: Hoare triple {40785#(<= ~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)); {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {40785#(<= ~counter~0 3)} ~cond := #in~cond; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {40785#(<= ~counter~0 3)} assume !(0 == ~cond); {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {40785#(<= ~counter~0 3)} assume true; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,512 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40785#(<= ~counter~0 3)} {40785#(<= ~counter~0 3)} #98#return; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {40785#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40785#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:06,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {40785#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {40810#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,514 INFO L272 TraceCheckUtils]: 43: Hoare triple {40810#(<= ~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)); {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {40810#(<= ~counter~0 4)} ~cond := #in~cond; {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {40810#(<= ~counter~0 4)} assume !(0 == ~cond); {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {40810#(<= ~counter~0 4)} assume true; {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,515 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40810#(<= ~counter~0 4)} {40810#(<= ~counter~0 4)} #98#return; {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {40810#(<= ~counter~0 4)} assume !(~r~0 < 0); {40810#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:06,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {40810#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {40835#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,517 INFO L272 TraceCheckUtils]: 51: Hoare triple {40835#(<= ~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)); {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {40835#(<= ~counter~0 5)} ~cond := #in~cond; {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {40835#(<= ~counter~0 5)} assume !(0 == ~cond); {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {40835#(<= ~counter~0 5)} assume true; {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,518 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40835#(<= ~counter~0 5)} {40835#(<= ~counter~0 5)} #94#return; {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {40835#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40835#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:06,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {40835#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {40860#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,520 INFO L272 TraceCheckUtils]: 59: Hoare triple {40860#(<= ~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)); {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {40860#(<= ~counter~0 6)} ~cond := #in~cond; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {40860#(<= ~counter~0 6)} assume !(0 == ~cond); {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {40860#(<= ~counter~0 6)} assume true; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,521 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40860#(<= ~counter~0 6)} {40860#(<= ~counter~0 6)} #96#return; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {40860#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40860#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:06,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {40860#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {40885#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,523 INFO L272 TraceCheckUtils]: 67: Hoare triple {40885#(<= ~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)); {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {40885#(<= ~counter~0 7)} ~cond := #in~cond; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {40885#(<= ~counter~0 7)} assume !(0 == ~cond); {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {40885#(<= ~counter~0 7)} assume true; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,524 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40885#(<= ~counter~0 7)} {40885#(<= ~counter~0 7)} #96#return; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {40885#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {40885#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:06,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {40885#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {40910#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,525 INFO L272 TraceCheckUtils]: 75: Hoare triple {40910#(<= ~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)); {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,526 INFO L290 TraceCheckUtils]: 76: Hoare triple {40910#(<= ~counter~0 8)} ~cond := #in~cond; {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,526 INFO L290 TraceCheckUtils]: 77: Hoare triple {40910#(<= ~counter~0 8)} assume !(0 == ~cond); {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {40910#(<= ~counter~0 8)} assume true; {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,527 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40910#(<= ~counter~0 8)} {40910#(<= ~counter~0 8)} #96#return; {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {40910#(<= ~counter~0 8)} assume !(~r~0 > 0); {40910#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:06,528 INFO L290 TraceCheckUtils]: 81: Hoare triple {40910#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,528 INFO L290 TraceCheckUtils]: 82: Hoare triple {40935#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,528 INFO L272 TraceCheckUtils]: 83: Hoare triple {40935#(<= ~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)); {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {40935#(<= ~counter~0 9)} ~cond := #in~cond; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,529 INFO L290 TraceCheckUtils]: 85: Hoare triple {40935#(<= ~counter~0 9)} assume !(0 == ~cond); {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,529 INFO L290 TraceCheckUtils]: 86: Hoare triple {40935#(<= ~counter~0 9)} assume true; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,530 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40935#(<= ~counter~0 9)} {40935#(<= ~counter~0 9)} #98#return; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {40935#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {40935#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:06,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {40935#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,531 INFO L290 TraceCheckUtils]: 90: Hoare triple {40960#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,531 INFO L272 TraceCheckUtils]: 91: Hoare triple {40960#(<= ~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)); {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,531 INFO L290 TraceCheckUtils]: 92: Hoare triple {40960#(<= ~counter~0 10)} ~cond := #in~cond; {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,532 INFO L290 TraceCheckUtils]: 93: Hoare triple {40960#(<= ~counter~0 10)} assume !(0 == ~cond); {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,532 INFO L290 TraceCheckUtils]: 94: Hoare triple {40960#(<= ~counter~0 10)} assume true; {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,532 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40960#(<= ~counter~0 10)} {40960#(<= ~counter~0 10)} #98#return; {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {40960#(<= ~counter~0 10)} assume !(~r~0 < 0); {40960#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:06,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {40960#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {40985#(<= |main_#t~post6| 10)} is VALID [2022-04-08 06:03:06,533 INFO L290 TraceCheckUtils]: 98: Hoare triple {40985#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {40679#false} is VALID [2022-04-08 06:03:06,533 INFO L272 TraceCheckUtils]: 99: Hoare triple {40679#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40679#false} is VALID [2022-04-08 06:03:06,533 INFO L290 TraceCheckUtils]: 100: Hoare triple {40679#false} ~cond := #in~cond; {40679#false} is VALID [2022-04-08 06:03:06,534 INFO L290 TraceCheckUtils]: 101: Hoare triple {40679#false} assume 0 == ~cond; {40679#false} is VALID [2022-04-08 06:03:06,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {40679#false} assume !false; {40679#false} is VALID [2022-04-08 06:03:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:06,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:07,298 INFO L290 TraceCheckUtils]: 102: Hoare triple {40679#false} assume !false; {40679#false} is VALID [2022-04-08 06:03:07,298 INFO L290 TraceCheckUtils]: 101: Hoare triple {40679#false} assume 0 == ~cond; {40679#false} is VALID [2022-04-08 06:03:07,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {40679#false} ~cond := #in~cond; {40679#false} is VALID [2022-04-08 06:03:07,298 INFO L272 TraceCheckUtils]: 99: Hoare triple {40679#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {40679#false} is VALID [2022-04-08 06:03:07,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {41013#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {40679#false} is VALID [2022-04-08 06:03:07,299 INFO L290 TraceCheckUtils]: 97: Hoare triple {41017#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41013#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:03:07,299 INFO L290 TraceCheckUtils]: 96: Hoare triple {41017#(< ~counter~0 100)} assume !(~r~0 < 0); {41017#(< ~counter~0 100)} is VALID [2022-04-08 06:03:07,300 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40678#true} {41017#(< ~counter~0 100)} #98#return; {41017#(< ~counter~0 100)} is VALID [2022-04-08 06:03:07,300 INFO L290 TraceCheckUtils]: 94: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,300 INFO L290 TraceCheckUtils]: 92: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,300 INFO L272 TraceCheckUtils]: 91: Hoare triple {41017#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,300 INFO L290 TraceCheckUtils]: 90: Hoare triple {41017#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {41017#(< ~counter~0 100)} is VALID [2022-04-08 06:03:07,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {41042#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41017#(< ~counter~0 100)} is VALID [2022-04-08 06:03:07,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {41042#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41042#(< ~counter~0 99)} is VALID [2022-04-08 06:03:07,302 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40678#true} {41042#(< ~counter~0 99)} #98#return; {41042#(< ~counter~0 99)} is VALID [2022-04-08 06:03:07,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,302 INFO L272 TraceCheckUtils]: 83: Hoare triple {41042#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {41042#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {41042#(< ~counter~0 99)} is VALID [2022-04-08 06:03:07,303 INFO L290 TraceCheckUtils]: 81: Hoare triple {41067#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41042#(< ~counter~0 99)} is VALID [2022-04-08 06:03:07,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {41067#(< ~counter~0 98)} assume !(~r~0 > 0); {41067#(< ~counter~0 98)} is VALID [2022-04-08 06:03:07,304 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40678#true} {41067#(< ~counter~0 98)} #96#return; {41067#(< ~counter~0 98)} is VALID [2022-04-08 06:03:07,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,304 INFO L272 TraceCheckUtils]: 75: Hoare triple {41067#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {41067#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {41067#(< ~counter~0 98)} is VALID [2022-04-08 06:03:07,305 INFO L290 TraceCheckUtils]: 73: Hoare triple {41092#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41067#(< ~counter~0 98)} is VALID [2022-04-08 06:03:07,305 INFO L290 TraceCheckUtils]: 72: Hoare triple {41092#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41092#(< ~counter~0 97)} is VALID [2022-04-08 06:03:07,305 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40678#true} {41092#(< ~counter~0 97)} #96#return; {41092#(< ~counter~0 97)} is VALID [2022-04-08 06:03:07,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,306 INFO L290 TraceCheckUtils]: 69: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,306 INFO L272 TraceCheckUtils]: 67: Hoare triple {41092#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {41092#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {41092#(< ~counter~0 97)} is VALID [2022-04-08 06:03:07,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {41117#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41092#(< ~counter~0 97)} is VALID [2022-04-08 06:03:07,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {41117#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41117#(< ~counter~0 96)} is VALID [2022-04-08 06:03:07,307 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40678#true} {41117#(< ~counter~0 96)} #96#return; {41117#(< ~counter~0 96)} is VALID [2022-04-08 06:03:07,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,307 INFO L272 TraceCheckUtils]: 59: Hoare triple {41117#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {41117#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {41117#(< ~counter~0 96)} is VALID [2022-04-08 06:03:07,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {41142#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41117#(< ~counter~0 96)} is VALID [2022-04-08 06:03:07,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {41142#(< ~counter~0 95)} assume !!(0 != ~r~0); {41142#(< ~counter~0 95)} is VALID [2022-04-08 06:03:07,309 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40678#true} {41142#(< ~counter~0 95)} #94#return; {41142#(< ~counter~0 95)} is VALID [2022-04-08 06:03:07,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,309 INFO L272 TraceCheckUtils]: 51: Hoare triple {41142#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {41142#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {41142#(< ~counter~0 95)} is VALID [2022-04-08 06:03:07,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {41167#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41142#(< ~counter~0 95)} is VALID [2022-04-08 06:03:07,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {41167#(< ~counter~0 94)} assume !(~r~0 < 0); {41167#(< ~counter~0 94)} is VALID [2022-04-08 06:03:07,311 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40678#true} {41167#(< ~counter~0 94)} #98#return; {41167#(< ~counter~0 94)} is VALID [2022-04-08 06:03:07,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,311 INFO L272 TraceCheckUtils]: 43: Hoare triple {41167#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {41167#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {41167#(< ~counter~0 94)} is VALID [2022-04-08 06:03:07,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {41192#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41167#(< ~counter~0 94)} is VALID [2022-04-08 06:03:07,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {41192#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41192#(< ~counter~0 93)} is VALID [2022-04-08 06:03:07,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40678#true} {41192#(< ~counter~0 93)} #98#return; {41192#(< ~counter~0 93)} is VALID [2022-04-08 06:03:07,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,313 INFO L272 TraceCheckUtils]: 35: Hoare triple {41192#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {41192#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {41192#(< ~counter~0 93)} is VALID [2022-04-08 06:03:07,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {41217#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41192#(< ~counter~0 93)} is VALID [2022-04-08 06:03:07,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {41217#(< ~counter~0 92)} assume !(~r~0 > 0); {41217#(< ~counter~0 92)} is VALID [2022-04-08 06:03:07,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40678#true} {41217#(< ~counter~0 92)} #96#return; {41217#(< ~counter~0 92)} is VALID [2022-04-08 06:03:07,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,315 INFO L272 TraceCheckUtils]: 27: Hoare triple {41217#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {41217#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {41217#(< ~counter~0 92)} is VALID [2022-04-08 06:03:07,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {41242#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41217#(< ~counter~0 92)} is VALID [2022-04-08 06:03:07,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {41242#(< ~counter~0 91)} assume !!(0 != ~r~0); {41242#(< ~counter~0 91)} is VALID [2022-04-08 06:03:07,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40678#true} {41242#(< ~counter~0 91)} #94#return; {41242#(< ~counter~0 91)} is VALID [2022-04-08 06:03:07,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {41242#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {41242#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {41242#(< ~counter~0 91)} is VALID [2022-04-08 06:03:07,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {41267#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41242#(< ~counter~0 91)} is VALID [2022-04-08 06:03:07,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {41267#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40678#true} {41267#(< ~counter~0 90)} #92#return; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {41267#(< ~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)); {40678#true} is VALID [2022-04-08 06:03:07,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40678#true} {41267#(< ~counter~0 90)} #90#return; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-08 06:03:07,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-08 06:03:07,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-08 06:03:07,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {41267#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40678#true} is VALID [2022-04-08 06:03:07,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {41267#(< ~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; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {41267#(< ~counter~0 90)} call #t~ret9 := main(); {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41267#(< ~counter~0 90)} {40678#true} #102#return; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {41267#(< ~counter~0 90)} assume true; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {40678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41267#(< ~counter~0 90)} is VALID [2022-04-08 06:03:07,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {40678#true} call ULTIMATE.init(); {40678#true} is VALID [2022-04-08 06:03:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 06:03:07,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946056887] [2022-04-08 06:03:07,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:07,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930599641] [2022-04-08 06:03:07,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930599641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:07,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:07,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:03:07,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:07,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684359149] [2022-04-08 06:03:07,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684359149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:07,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:07,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:03:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009243668] [2022-04-08 06:03:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:07,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-08 06:03:07,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:07,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:07,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:07,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:03:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:03:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:03:07,400 INFO L87 Difference]: Start difference. First operand 364 states and 480 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,006 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-08 06:03:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:03:09,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-08 06:03:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 06:03:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-08 06:03:09,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-08 06:03:09,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:09,193 INFO L225 Difference]: With dead ends: 407 [2022-04-08 06:03:09,193 INFO L226 Difference]: Without dead ends: 396 [2022-04-08 06:03:09,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 06:03:09,194 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 170 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:09,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 233 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:03:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-08 06:03:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-08 06:03:09,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:09,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:03:09,903 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:03:09,904 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:03:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,911 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 06:03:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 06:03:09,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:09,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:09,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 06:03:09,913 INFO L87 Difference]: Start difference. First operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 396 states. [2022-04-08 06:03:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:09,930 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-08 06:03:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-08 06:03:09,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:09,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:09,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:09,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 281 states have (on average 1.206405693950178) internal successors, (339), 288 states have internal predecessors, (339), 82 states have call successors, (82), 15 states have call predecessors, (82), 13 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-08 06:03:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-08 06:03:09,939 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-08 06:03:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:09,939 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-08 06:03:09,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:09,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-08 06:03:11,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-08 06:03:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 06:03:11,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:11,982 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:12,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:12,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:12,183 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-08 06:03:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:12,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481453121] [2022-04-08 06:03:12,183 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-08 06:03:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:12,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286507219] [2022-04-08 06:03:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:12,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:12,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683026123] [2022-04-08 06:03:12,207 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:12,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:12,208 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:12,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 06:03:12,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:12,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:12,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:03:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:12,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:13,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {43695#true} call ULTIMATE.init(); {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {43695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43695#true} {43695#true} #102#return; {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {43695#true} call #t~ret9 := main(); {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {43695#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; {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L272 TraceCheckUtils]: 6: Hoare triple {43695#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43695#true} {43695#true} #90#return; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43695#true} {43695#true} #92#return; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {43695#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {43695#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {43695#true} assume !!(#t~post6 < 100);havoc #t~post6; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L272 TraceCheckUtils]: 19: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43695#true} {43695#true} #94#return; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#true} assume !!(0 != ~r~0); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {43695#true} assume !!(#t~post7 < 100);havoc #t~post7; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L272 TraceCheckUtils]: 27: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43695#true} {43695#true} #96#return; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {43695#true} assume !(~r~0 > 0); {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {43695#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {43695#true} assume !!(#t~post8 < 100);havoc #t~post8; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L272 TraceCheckUtils]: 35: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,311 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43695#true} {43695#true} #98#return; {43695#true} is VALID [2022-04-08 06:03:13,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {43695#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,313 INFO L272 TraceCheckUtils]: 43: Hoare triple {43820#(< (+ 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)); {43695#true} is VALID [2022-04-08 06:03:13,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,313 INFO L290 TraceCheckUtils]: 45: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,313 INFO L290 TraceCheckUtils]: 46: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,314 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43695#true} {43820#(< (+ main_~r~0 2) main_~u~0)} #98#return; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,315 INFO L290 TraceCheckUtils]: 50: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,315 INFO L272 TraceCheckUtils]: 51: Hoare triple {43820#(< (+ 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)); {43695#true} is VALID [2022-04-08 06:03:13,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,315 INFO L290 TraceCheckUtils]: 53: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,315 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43695#true} {43820#(< (+ main_~r~0 2) main_~u~0)} #94#return; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,316 INFO L290 TraceCheckUtils]: 57: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,316 INFO L272 TraceCheckUtils]: 59: Hoare triple {43820#(< (+ 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)); {43695#true} is VALID [2022-04-08 06:03:13,316 INFO L290 TraceCheckUtils]: 60: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,317 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43695#true} {43820#(< (+ main_~r~0 2) main_~u~0)} #96#return; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:03:13,318 INFO L272 TraceCheckUtils]: 67: Hoare triple {43893#(< (+ 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)); {43695#true} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 69: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,319 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43695#true} {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-08 06:03:13,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,320 INFO L290 TraceCheckUtils]: 74: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,320 INFO L272 TraceCheckUtils]: 75: Hoare triple {43918#(< 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)); {43695#true} is VALID [2022-04-08 06:03:13,320 INFO L290 TraceCheckUtils]: 76: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,320 INFO L290 TraceCheckUtils]: 77: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,320 INFO L290 TraceCheckUtils]: 78: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,321 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43695#true} {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,321 INFO L290 TraceCheckUtils]: 80: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,321 INFO L290 TraceCheckUtils]: 82: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,321 INFO L272 TraceCheckUtils]: 83: Hoare triple {43918#(< 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)); {43695#true} is VALID [2022-04-08 06:03:13,321 INFO L290 TraceCheckUtils]: 84: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,322 INFO L290 TraceCheckUtils]: 85: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,322 INFO L290 TraceCheckUtils]: 86: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,322 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43695#true} {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:13,323 INFO L290 TraceCheckUtils]: 88: Hoare triple {43918#(< 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; {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:03:13,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:03:13,324 INFO L290 TraceCheckUtils]: 90: Hoare triple {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:03:13,324 INFO L272 TraceCheckUtils]: 91: Hoare triple {43967#(< 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)); {43695#true} is VALID [2022-04-08 06:03:13,324 INFO L290 TraceCheckUtils]: 92: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,324 INFO L290 TraceCheckUtils]: 93: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,324 INFO L290 TraceCheckUtils]: 94: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,324 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43695#true} {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 96: Hoare triple {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {43696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 98: Hoare triple {43696#false} assume !(#t~post8 < 100);havoc #t~post8; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 99: Hoare triple {43696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 100: Hoare triple {43696#false} assume !(#t~post6 < 100);havoc #t~post6; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L272 TraceCheckUtils]: 101: Hoare triple {43696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 102: Hoare triple {43696#false} ~cond := #in~cond; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 103: Hoare triple {43696#false} assume 0 == ~cond; {43696#false} is VALID [2022-04-08 06:03:13,325 INFO L290 TraceCheckUtils]: 104: Hoare triple {43696#false} assume !false; {43696#false} is VALID [2022-04-08 06:03:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 06:03:13,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:13,792 INFO L290 TraceCheckUtils]: 104: Hoare triple {43696#false} assume !false; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {43696#false} assume 0 == ~cond; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {43696#false} ~cond := #in~cond; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L272 TraceCheckUtils]: 101: Hoare triple {43696#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {43696#false} assume !(#t~post6 < 100);havoc #t~post6; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {43696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {43696#false} assume !(#t~post8 < 100);havoc #t~post8; {43696#false} is VALID [2022-04-08 06:03:13,793 INFO L290 TraceCheckUtils]: 97: Hoare triple {43696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43696#false} is VALID [2022-04-08 06:03:13,794 INFO L290 TraceCheckUtils]: 96: Hoare triple {44040#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43696#false} is VALID [2022-04-08 06:03:13,794 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {43695#true} {44040#(not (< main_~r~0 0))} #98#return; {44040#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:13,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,794 INFO L272 TraceCheckUtils]: 91: Hoare triple {44040#(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)); {43695#true} is VALID [2022-04-08 06:03:13,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {44040#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {44040#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:13,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {44040#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44040#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:13,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44040#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:13,796 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {43695#true} {44065#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,796 INFO L290 TraceCheckUtils]: 86: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,796 INFO L290 TraceCheckUtils]: 85: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,796 INFO L290 TraceCheckUtils]: 84: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,796 INFO L272 TraceCheckUtils]: 83: Hoare triple {44065#(<= 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)); {43695#true} is VALID [2022-04-08 06:03:13,796 INFO L290 TraceCheckUtils]: 82: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,797 INFO L290 TraceCheckUtils]: 81: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,797 INFO L290 TraceCheckUtils]: 80: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,797 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43695#true} {44065#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,797 INFO L272 TraceCheckUtils]: 75: Hoare triple {44065#(<= 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)); {43695#true} is VALID [2022-04-08 06:03:13,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,799 INFO L290 TraceCheckUtils]: 72: Hoare triple {44114#(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; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:13,799 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {43695#true} {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:13,799 INFO L290 TraceCheckUtils]: 70: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,799 INFO L272 TraceCheckUtils]: 67: Hoare triple {44114#(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)); {43695#true} is VALID [2022-04-08 06:03:13,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:13,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:13,801 INFO L290 TraceCheckUtils]: 64: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:13,801 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {43695#true} {44139#(<= main_~r~0 main_~u~0)} #96#return; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,801 INFO L290 TraceCheckUtils]: 62: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,801 INFO L272 TraceCheckUtils]: 59: Hoare triple {44139#(<= 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)); {43695#true} is VALID [2022-04-08 06:03:13,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {44139#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,803 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {43695#true} {44139#(<= main_~r~0 main_~u~0)} #94#return; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,803 INFO L272 TraceCheckUtils]: 51: Hoare triple {44139#(<= 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)); {43695#true} is VALID [2022-04-08 06:03:13,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {44139#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,804 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {43695#true} {44139#(<= main_~r~0 main_~u~0)} #98#return; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,804 INFO L272 TraceCheckUtils]: 43: Hoare triple {44139#(<= 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)); {43695#true} is VALID [2022-04-08 06:03:13,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {44139#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {43695#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:13,805 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43695#true} {43695#true} #98#return; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 38: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L272 TraceCheckUtils]: 35: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {43695#true} assume !!(#t~post8 < 100);havoc #t~post8; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {43695#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {43695#true} assume !(~r~0 > 0); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43695#true} {43695#true} #96#return; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L272 TraceCheckUtils]: 27: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {43695#true} assume !!(#t~post7 < 100);havoc #t~post7; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#true} assume !!(0 != ~r~0); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43695#true} {43695#true} #94#return; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {43695#true} assume !!(#t~post6 < 100);havoc #t~post6; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {43695#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {43695#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43695#true} {43695#true} #92#return; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {43695#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)); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43695#true} {43695#true} #90#return; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L272 TraceCheckUtils]: 6: Hoare triple {43695#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {43695#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; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {43695#true} call #t~ret9 := main(); {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43695#true} {43695#true} #102#return; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {43695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43695#true} is VALID [2022-04-08 06:03:13,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {43695#true} call ULTIMATE.init(); {43695#true} is VALID [2022-04-08 06:03:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 06:03:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286507219] [2022-04-08 06:03:13,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683026123] [2022-04-08 06:03:13,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683026123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:13,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:13,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:03:13,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:13,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481453121] [2022-04-08 06:03:13,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481453121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:13,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:13,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:03:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877543205] [2022-04-08 06:03:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-08 06:03:13,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:13,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 06:03:13,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:13,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:03:13,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:13,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:03:13,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:03:13,922 INFO L87 Difference]: Start difference. First operand 377 states and 501 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 06:03:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:16,192 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-08 06:03:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:03:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-08 06:03:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 06:03:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 06:03:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 06:03:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-08 06:03:16,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-08 06:03:16,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:16,416 INFO L225 Difference]: With dead ends: 649 [2022-04-08 06:03:16,416 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 06:03:16,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:03:16,418 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 274 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-08 06:03:16,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 274 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 06:03:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-08 06:03:17,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:17,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:17,516 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:17,516 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:17,531 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 06:03:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 06:03:17,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:17,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:17,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 06:03:17,533 INFO L87 Difference]: Start difference. First operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 588 states. [2022-04-08 06:03:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:17,548 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-08 06:03:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-08 06:03:17,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:17,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:17,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:17,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 376 states have (on average 1.247340425531915) internal successors, (469), 386 states have internal predecessors, (469), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-08 06:03:17,563 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-08 06:03:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:17,563 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-08 06:03:17,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 06:03:17,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-08 06:03:20,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-08 06:03:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 06:03:20,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:20,389 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:20,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:20,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:20,589 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-08 06:03:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790834906] [2022-04-08 06:03:20,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-08 06:03:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762645879] [2022-04-08 06:03:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:20,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402544933] [2022-04-08 06:03:20,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:20,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:20,623 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:20,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 06:03:20,743 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:03:20,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:20,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:03:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:20,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:21,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {47822#true} call ULTIMATE.init(); {47822#true} is VALID [2022-04-08 06:03:21,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {47822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47830#(<= ~counter~0 0)} {47822#true} #102#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {47830#(<= ~counter~0 0)} call #t~ret9 := main(); {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {47830#(<= ~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; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {47830#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {47830#(<= ~counter~0 0)} ~cond := #in~cond; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {47830#(<= ~counter~0 0)} assume !(0 == ~cond); {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47830#(<= ~counter~0 0)} {47830#(<= ~counter~0 0)} #90#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {47830#(<= ~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)); {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {47830#(<= ~counter~0 0)} ~cond := #in~cond; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {47830#(<= ~counter~0 0)} assume !(0 == ~cond); {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,389 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47830#(<= ~counter~0 0)} {47830#(<= ~counter~0 0)} #92#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {47830#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {47830#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:21,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {47830#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {47879#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {47879#(<= ~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)); {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {47879#(<= ~counter~0 1)} ~cond := #in~cond; {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {47879#(<= ~counter~0 1)} assume !(0 == ~cond); {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {47879#(<= ~counter~0 1)} assume true; {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47879#(<= ~counter~0 1)} {47879#(<= ~counter~0 1)} #94#return; {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {47879#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47879#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:21,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {47879#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {47904#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,394 INFO L272 TraceCheckUtils]: 27: Hoare triple {47904#(<= ~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)); {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {47904#(<= ~counter~0 2)} ~cond := #in~cond; {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {47904#(<= ~counter~0 2)} assume !(0 == ~cond); {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {47904#(<= ~counter~0 2)} assume true; {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47904#(<= ~counter~0 2)} {47904#(<= ~counter~0 2)} #96#return; {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {47904#(<= ~counter~0 2)} assume !(~r~0 > 0); {47904#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:21,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {47904#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {47929#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,397 INFO L272 TraceCheckUtils]: 35: Hoare triple {47929#(<= ~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)); {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {47929#(<= ~counter~0 3)} ~cond := #in~cond; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {47929#(<= ~counter~0 3)} assume !(0 == ~cond); {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {47929#(<= ~counter~0 3)} assume true; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,398 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47929#(<= ~counter~0 3)} {47929#(<= ~counter~0 3)} #98#return; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {47929#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {47929#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:21,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {47929#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {47954#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {47954#(<= ~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)); {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {47954#(<= ~counter~0 4)} ~cond := #in~cond; {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {47954#(<= ~counter~0 4)} assume !(0 == ~cond); {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {47954#(<= ~counter~0 4)} assume true; {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,401 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47954#(<= ~counter~0 4)} {47954#(<= ~counter~0 4)} #98#return; {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {47954#(<= ~counter~0 4)} assume !(~r~0 < 0); {47954#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:21,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {47954#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,402 INFO L290 TraceCheckUtils]: 50: Hoare triple {47979#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,403 INFO L272 TraceCheckUtils]: 51: Hoare triple {47979#(<= ~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)); {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {47979#(<= ~counter~0 5)} ~cond := #in~cond; {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {47979#(<= ~counter~0 5)} assume !(0 == ~cond); {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {47979#(<= ~counter~0 5)} assume true; {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,404 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47979#(<= ~counter~0 5)} {47979#(<= ~counter~0 5)} #94#return; {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {47979#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47979#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:21,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {47979#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {48004#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,406 INFO L272 TraceCheckUtils]: 59: Hoare triple {48004#(<= ~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)); {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {48004#(<= ~counter~0 6)} ~cond := #in~cond; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {48004#(<= ~counter~0 6)} assume !(0 == ~cond); {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,414 INFO L290 TraceCheckUtils]: 62: Hoare triple {48004#(<= ~counter~0 6)} assume true; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,415 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48004#(<= ~counter~0 6)} {48004#(<= ~counter~0 6)} #96#return; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,415 INFO L290 TraceCheckUtils]: 64: Hoare triple {48004#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48004#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:21,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {48004#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,416 INFO L290 TraceCheckUtils]: 66: Hoare triple {48029#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,416 INFO L272 TraceCheckUtils]: 67: Hoare triple {48029#(<= ~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)); {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {48029#(<= ~counter~0 7)} ~cond := #in~cond; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {48029#(<= ~counter~0 7)} assume !(0 == ~cond); {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {48029#(<= ~counter~0 7)} assume true; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,418 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48029#(<= ~counter~0 7)} {48029#(<= ~counter~0 7)} #96#return; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {48029#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48029#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:21,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {48029#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {48054#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,419 INFO L272 TraceCheckUtils]: 75: Hoare triple {48054#(<= ~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)); {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {48054#(<= ~counter~0 8)} ~cond := #in~cond; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {48054#(<= ~counter~0 8)} assume !(0 == ~cond); {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {48054#(<= ~counter~0 8)} assume true; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,420 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48054#(<= ~counter~0 8)} {48054#(<= ~counter~0 8)} #96#return; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,421 INFO L290 TraceCheckUtils]: 80: Hoare triple {48054#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48054#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:21,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {48054#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,422 INFO L290 TraceCheckUtils]: 82: Hoare triple {48079#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,422 INFO L272 TraceCheckUtils]: 83: Hoare triple {48079#(<= ~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)); {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,422 INFO L290 TraceCheckUtils]: 84: Hoare triple {48079#(<= ~counter~0 9)} ~cond := #in~cond; {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {48079#(<= ~counter~0 9)} assume !(0 == ~cond); {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {48079#(<= ~counter~0 9)} assume true; {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,423 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48079#(<= ~counter~0 9)} {48079#(<= ~counter~0 9)} #96#return; {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,423 INFO L290 TraceCheckUtils]: 88: Hoare triple {48079#(<= ~counter~0 9)} assume !(~r~0 > 0); {48079#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {48079#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,424 INFO L290 TraceCheckUtils]: 90: Hoare triple {48104#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,425 INFO L272 TraceCheckUtils]: 91: Hoare triple {48104#(<= ~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)); {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {48104#(<= ~counter~0 10)} ~cond := #in~cond; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {48104#(<= ~counter~0 10)} assume !(0 == ~cond); {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {48104#(<= ~counter~0 10)} assume true; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,426 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48104#(<= ~counter~0 10)} {48104#(<= ~counter~0 10)} #98#return; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {48104#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48104#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {48104#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48129#(<= |main_#t~post8| 10)} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {48129#(<= |main_#t~post8| 10)} assume !(#t~post8 < 100);havoc #t~post8; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {47823#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {47823#false} assume !(#t~post6 < 100);havoc #t~post6; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L272 TraceCheckUtils]: 101: Hoare triple {47823#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 102: Hoare triple {47823#false} ~cond := #in~cond; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {47823#false} assume 0 == ~cond; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L290 TraceCheckUtils]: 104: Hoare triple {47823#false} assume !false; {47823#false} is VALID [2022-04-08 06:03:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:21,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 104: Hoare triple {47823#false} assume !false; {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 103: Hoare triple {47823#false} assume 0 == ~cond; {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 102: Hoare triple {47823#false} ~cond := #in~cond; {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L272 TraceCheckUtils]: 101: Hoare triple {47823#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 100: Hoare triple {47823#false} assume !(#t~post6 < 100);havoc #t~post6; {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 99: Hoare triple {47823#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47823#false} is VALID [2022-04-08 06:03:21,998 INFO L290 TraceCheckUtils]: 98: Hoare triple {48169#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {47823#false} is VALID [2022-04-08 06:03:21,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {48173#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48169#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:03:21,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {48173#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48173#(< ~counter~0 100)} is VALID [2022-04-08 06:03:22,000 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47822#true} {48173#(< ~counter~0 100)} #98#return; {48173#(< ~counter~0 100)} is VALID [2022-04-08 06:03:22,000 INFO L290 TraceCheckUtils]: 94: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,000 INFO L290 TraceCheckUtils]: 93: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,000 INFO L290 TraceCheckUtils]: 92: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,000 INFO L272 TraceCheckUtils]: 91: Hoare triple {48173#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {48173#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {48173#(< ~counter~0 100)} is VALID [2022-04-08 06:03:22,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {48198#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48173#(< ~counter~0 100)} is VALID [2022-04-08 06:03:22,001 INFO L290 TraceCheckUtils]: 88: Hoare triple {48198#(< ~counter~0 99)} assume !(~r~0 > 0); {48198#(< ~counter~0 99)} is VALID [2022-04-08 06:03:22,002 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47822#true} {48198#(< ~counter~0 99)} #96#return; {48198#(< ~counter~0 99)} is VALID [2022-04-08 06:03:22,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,002 INFO L272 TraceCheckUtils]: 83: Hoare triple {48198#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {48198#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {48198#(< ~counter~0 99)} is VALID [2022-04-08 06:03:22,003 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48198#(< ~counter~0 99)} is VALID [2022-04-08 06:03:22,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48223#(< ~counter~0 98)} is VALID [2022-04-08 06:03:22,004 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47822#true} {48223#(< ~counter~0 98)} #96#return; {48223#(< ~counter~0 98)} is VALID [2022-04-08 06:03:22,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,004 INFO L272 TraceCheckUtils]: 75: Hoare triple {48223#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {48223#(< ~counter~0 98)} is VALID [2022-04-08 06:03:22,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {48248#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48223#(< ~counter~0 98)} is VALID [2022-04-08 06:03:22,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {48248#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48248#(< ~counter~0 97)} is VALID [2022-04-08 06:03:22,006 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47822#true} {48248#(< ~counter~0 97)} #96#return; {48248#(< ~counter~0 97)} is VALID [2022-04-08 06:03:22,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,006 INFO L272 TraceCheckUtils]: 67: Hoare triple {48248#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {48248#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {48248#(< ~counter~0 97)} is VALID [2022-04-08 06:03:22,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {48273#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48248#(< ~counter~0 97)} is VALID [2022-04-08 06:03:22,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {48273#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48273#(< ~counter~0 96)} is VALID [2022-04-08 06:03:22,007 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47822#true} {48273#(< ~counter~0 96)} #96#return; {48273#(< ~counter~0 96)} is VALID [2022-04-08 06:03:22,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,008 INFO L290 TraceCheckUtils]: 60: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,008 INFO L272 TraceCheckUtils]: 59: Hoare triple {48273#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {48273#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {48273#(< ~counter~0 96)} is VALID [2022-04-08 06:03:22,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {48298#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48273#(< ~counter~0 96)} is VALID [2022-04-08 06:03:22,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {48298#(< ~counter~0 95)} assume !!(0 != ~r~0); {48298#(< ~counter~0 95)} is VALID [2022-04-08 06:03:22,009 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47822#true} {48298#(< ~counter~0 95)} #94#return; {48298#(< ~counter~0 95)} is VALID [2022-04-08 06:03:22,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,010 INFO L272 TraceCheckUtils]: 51: Hoare triple {48298#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {48298#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {48298#(< ~counter~0 95)} is VALID [2022-04-08 06:03:22,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {48323#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48298#(< ~counter~0 95)} is VALID [2022-04-08 06:03:22,011 INFO L290 TraceCheckUtils]: 48: Hoare triple {48323#(< ~counter~0 94)} assume !(~r~0 < 0); {48323#(< ~counter~0 94)} is VALID [2022-04-08 06:03:22,011 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47822#true} {48323#(< ~counter~0 94)} #98#return; {48323#(< ~counter~0 94)} is VALID [2022-04-08 06:03:22,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,012 INFO L272 TraceCheckUtils]: 43: Hoare triple {48323#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {48323#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {48323#(< ~counter~0 94)} is VALID [2022-04-08 06:03:22,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {48348#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48323#(< ~counter~0 94)} is VALID [2022-04-08 06:03:22,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {48348#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48348#(< ~counter~0 93)} is VALID [2022-04-08 06:03:22,013 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47822#true} {48348#(< ~counter~0 93)} #98#return; {48348#(< ~counter~0 93)} is VALID [2022-04-08 06:03:22,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,014 INFO L272 TraceCheckUtils]: 35: Hoare triple {48348#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {48348#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {48348#(< ~counter~0 93)} is VALID [2022-04-08 06:03:22,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {48373#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48348#(< ~counter~0 93)} is VALID [2022-04-08 06:03:22,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {48373#(< ~counter~0 92)} assume !(~r~0 > 0); {48373#(< ~counter~0 92)} is VALID [2022-04-08 06:03:22,015 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47822#true} {48373#(< ~counter~0 92)} #96#return; {48373#(< ~counter~0 92)} is VALID [2022-04-08 06:03:22,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,016 INFO L272 TraceCheckUtils]: 27: Hoare triple {48373#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {48373#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {48373#(< ~counter~0 92)} is VALID [2022-04-08 06:03:22,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {48398#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48373#(< ~counter~0 92)} is VALID [2022-04-08 06:03:22,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {48398#(< ~counter~0 91)} assume !!(0 != ~r~0); {48398#(< ~counter~0 91)} is VALID [2022-04-08 06:03:22,017 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47822#true} {48398#(< ~counter~0 91)} #94#return; {48398#(< ~counter~0 91)} is VALID [2022-04-08 06:03:22,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,017 INFO L272 TraceCheckUtils]: 19: Hoare triple {48398#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {48398#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {48398#(< ~counter~0 91)} is VALID [2022-04-08 06:03:22,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {48423#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48398#(< ~counter~0 91)} is VALID [2022-04-08 06:03:22,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {48423#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,019 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47822#true} {48423#(< ~counter~0 90)} #92#return; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {48423#(< ~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)); {47822#true} is VALID [2022-04-08 06:03:22,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47822#true} {48423#(< ~counter~0 90)} #90#return; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-08 06:03:22,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-08 06:03:22,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-08 06:03:22,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {48423#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47822#true} is VALID [2022-04-08 06:03:22,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {48423#(< ~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; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {48423#(< ~counter~0 90)} call #t~ret9 := main(); {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48423#(< ~counter~0 90)} {47822#true} #102#return; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {48423#(< ~counter~0 90)} assume true; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {47822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {48423#(< ~counter~0 90)} is VALID [2022-04-08 06:03:22,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {47822#true} call ULTIMATE.init(); {47822#true} is VALID [2022-04-08 06:03:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 06:03:22,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762645879] [2022-04-08 06:03:22,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402544933] [2022-04-08 06:03:22,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402544933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:22,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:22,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:03:22,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:22,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [790834906] [2022-04-08 06:03:22,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [790834906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:22,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:22,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:03:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601078081] [2022-04-08 06:03:22,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:22,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-08 06:03:22,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:22,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:22,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:22,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:03:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:03:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:03:22,111 INFO L87 Difference]: Start difference. First operand 504 states and 695 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:24,024 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-08 06:03:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 06:03:24,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-08 06:03:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 06:03:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-08 06:03:24,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-08 06:03:24,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:24,220 INFO L225 Difference]: With dead ends: 753 [2022-04-08 06:03:24,220 INFO L226 Difference]: Without dead ends: 532 [2022-04-08 06:03:24,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 06:03:24,222 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 141 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:24,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 251 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-08 06:03:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-08 06:03:25,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:25,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:25,387 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:25,388 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:25,401 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 06:03:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 06:03:25,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:25,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:25,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 06:03:25,403 INFO L87 Difference]: Start difference. First operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 532 states. [2022-04-08 06:03:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:25,414 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-08 06:03:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-08 06:03:25,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:25,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:25,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:25,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 398 states have internal predecessors, (491), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-08 06:03:25,429 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-08 06:03:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:25,429 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-08 06:03:25,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:25,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-08 06:03:28,805 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-08 06:03:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-08 06:03:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 06:03:28,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:28,808 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:28,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 06:03:29,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-08 06:03:29,025 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-08 06:03:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:29,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2055389332] [2022-04-08 06:03:29,026 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-08 06:03:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:29,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311261521] [2022-04-08 06:03:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:29,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:29,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037879515] [2022-04-08 06:03:29,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:29,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:29,483 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:29,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 06:03:29,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:03:29,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:29,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 06:03:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:29,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:30,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {52107#true} call ULTIMATE.init(); {52107#true} is VALID [2022-04-08 06:03:30,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {52107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52115#(<= ~counter~0 0)} {52107#true} #102#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {52115#(<= ~counter~0 0)} call #t~ret9 := main(); {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {52115#(<= ~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; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {52115#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {52115#(<= ~counter~0 0)} ~cond := #in~cond; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {52115#(<= ~counter~0 0)} assume !(0 == ~cond); {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52115#(<= ~counter~0 0)} {52115#(<= ~counter~0 0)} #90#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,376 INFO L272 TraceCheckUtils]: 11: Hoare triple {52115#(<= ~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)); {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {52115#(<= ~counter~0 0)} ~cond := #in~cond; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {52115#(<= ~counter~0 0)} assume !(0 == ~cond); {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,377 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52115#(<= ~counter~0 0)} {52115#(<= ~counter~0 0)} #92#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {52115#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52115#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:30,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {52115#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {52164#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,379 INFO L272 TraceCheckUtils]: 19: Hoare triple {52164#(<= ~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)); {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {52164#(<= ~counter~0 1)} ~cond := #in~cond; {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {52164#(<= ~counter~0 1)} assume !(0 == ~cond); {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {52164#(<= ~counter~0 1)} assume true; {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52164#(<= ~counter~0 1)} {52164#(<= ~counter~0 1)} #94#return; {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {52164#(<= ~counter~0 1)} assume !!(0 != ~r~0); {52164#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:30,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {52164#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {52189#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,382 INFO L272 TraceCheckUtils]: 27: Hoare triple {52189#(<= ~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)); {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {52189#(<= ~counter~0 2)} ~cond := #in~cond; {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {52189#(<= ~counter~0 2)} assume !(0 == ~cond); {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {52189#(<= ~counter~0 2)} assume true; {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,383 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52189#(<= ~counter~0 2)} {52189#(<= ~counter~0 2)} #96#return; {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {52189#(<= ~counter~0 2)} assume !(~r~0 > 0); {52189#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:30,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {52189#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {52214#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,385 INFO L272 TraceCheckUtils]: 35: Hoare triple {52214#(<= ~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)); {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {52214#(<= ~counter~0 3)} ~cond := #in~cond; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {52214#(<= ~counter~0 3)} assume !(0 == ~cond); {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {52214#(<= ~counter~0 3)} assume true; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,386 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52214#(<= ~counter~0 3)} {52214#(<= ~counter~0 3)} #98#return; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {52214#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52214#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:30,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {52214#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {52239#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,388 INFO L272 TraceCheckUtils]: 43: Hoare triple {52239#(<= ~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)); {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {52239#(<= ~counter~0 4)} ~cond := #in~cond; {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {52239#(<= ~counter~0 4)} assume !(0 == ~cond); {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {52239#(<= ~counter~0 4)} assume true; {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,389 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52239#(<= ~counter~0 4)} {52239#(<= ~counter~0 4)} #98#return; {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {52239#(<= ~counter~0 4)} assume !(~r~0 < 0); {52239#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:30,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {52239#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {52264#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,391 INFO L272 TraceCheckUtils]: 51: Hoare triple {52264#(<= ~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)); {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {52264#(<= ~counter~0 5)} ~cond := #in~cond; {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {52264#(<= ~counter~0 5)} assume !(0 == ~cond); {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {52264#(<= ~counter~0 5)} assume true; {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,392 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52264#(<= ~counter~0 5)} {52264#(<= ~counter~0 5)} #94#return; {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {52264#(<= ~counter~0 5)} assume !!(0 != ~r~0); {52264#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:30,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {52264#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {52289#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,394 INFO L272 TraceCheckUtils]: 59: Hoare triple {52289#(<= ~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)); {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {52289#(<= ~counter~0 6)} ~cond := #in~cond; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#(<= ~counter~0 6)} assume !(0 == ~cond); {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#(<= ~counter~0 6)} assume true; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,395 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52289#(<= ~counter~0 6)} {52289#(<= ~counter~0 6)} #96#return; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {52289#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52289#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:30,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {52289#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {52314#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,396 INFO L272 TraceCheckUtils]: 67: Hoare triple {52314#(<= ~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)); {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {52314#(<= ~counter~0 7)} ~cond := #in~cond; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {52314#(<= ~counter~0 7)} assume !(0 == ~cond); {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {52314#(<= ~counter~0 7)} assume true; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,398 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52314#(<= ~counter~0 7)} {52314#(<= ~counter~0 7)} #96#return; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {52314#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52314#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:30,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {52314#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,399 INFO L290 TraceCheckUtils]: 74: Hoare triple {52339#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,399 INFO L272 TraceCheckUtils]: 75: Hoare triple {52339#(<= ~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)); {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {52339#(<= ~counter~0 8)} ~cond := #in~cond; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,400 INFO L290 TraceCheckUtils]: 77: Hoare triple {52339#(<= ~counter~0 8)} assume !(0 == ~cond); {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {52339#(<= ~counter~0 8)} assume true; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,400 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52339#(<= ~counter~0 8)} {52339#(<= ~counter~0 8)} #96#return; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,401 INFO L290 TraceCheckUtils]: 80: Hoare triple {52339#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52339#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:30,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {52339#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {52364#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,402 INFO L272 TraceCheckUtils]: 83: Hoare triple {52364#(<= ~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)); {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {52364#(<= ~counter~0 9)} ~cond := #in~cond; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {52364#(<= ~counter~0 9)} assume !(0 == ~cond); {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {52364#(<= ~counter~0 9)} assume true; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,403 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52364#(<= ~counter~0 9)} {52364#(<= ~counter~0 9)} #96#return; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,404 INFO L290 TraceCheckUtils]: 88: Hoare triple {52364#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52364#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:30,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {52364#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,404 INFO L290 TraceCheckUtils]: 90: Hoare triple {52389#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,405 INFO L272 TraceCheckUtils]: 91: Hoare triple {52389#(<= ~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)); {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,405 INFO L290 TraceCheckUtils]: 92: Hoare triple {52389#(<= ~counter~0 10)} ~cond := #in~cond; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {52389#(<= ~counter~0 10)} assume !(0 == ~cond); {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {52389#(<= ~counter~0 10)} assume true; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,406 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {52389#(<= ~counter~0 10)} {52389#(<= ~counter~0 10)} #96#return; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,406 INFO L290 TraceCheckUtils]: 96: Hoare triple {52389#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52389#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {52389#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52414#(<= |main_#t~post7| 10)} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {52414#(<= |main_#t~post7| 10)} assume !(#t~post7 < 100);havoc #t~post7; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 99: Hoare triple {52108#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 100: Hoare triple {52108#false} assume !(#t~post8 < 100);havoc #t~post8; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 101: Hoare triple {52108#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 102: Hoare triple {52108#false} assume !(#t~post6 < 100);havoc #t~post6; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L272 TraceCheckUtils]: 103: Hoare triple {52108#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 104: Hoare triple {52108#false} ~cond := #in~cond; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 105: Hoare triple {52108#false} assume 0 == ~cond; {52108#false} is VALID [2022-04-08 06:03:30,407 INFO L290 TraceCheckUtils]: 106: Hoare triple {52108#false} assume !false; {52108#false} is VALID [2022-04-08 06:03:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:30,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:30,999 INFO L290 TraceCheckUtils]: 106: Hoare triple {52108#false} assume !false; {52108#false} is VALID [2022-04-08 06:03:30,999 INFO L290 TraceCheckUtils]: 105: Hoare triple {52108#false} assume 0 == ~cond; {52108#false} is VALID [2022-04-08 06:03:30,999 INFO L290 TraceCheckUtils]: 104: Hoare triple {52108#false} ~cond := #in~cond; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L272 TraceCheckUtils]: 103: Hoare triple {52108#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 102: Hoare triple {52108#false} assume !(#t~post6 < 100);havoc #t~post6; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {52108#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 100: Hoare triple {52108#false} assume !(#t~post8 < 100);havoc #t~post8; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 99: Hoare triple {52108#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 98: Hoare triple {52466#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {52108#false} is VALID [2022-04-08 06:03:31,000 INFO L290 TraceCheckUtils]: 97: Hoare triple {52470#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52466#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:03:31,001 INFO L290 TraceCheckUtils]: 96: Hoare triple {52470#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52470#(< ~counter~0 100)} is VALID [2022-04-08 06:03:31,001 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {52107#true} {52470#(< ~counter~0 100)} #96#return; {52470#(< ~counter~0 100)} is VALID [2022-04-08 06:03:31,001 INFO L290 TraceCheckUtils]: 94: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,001 INFO L290 TraceCheckUtils]: 93: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,001 INFO L290 TraceCheckUtils]: 92: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,001 INFO L272 TraceCheckUtils]: 91: Hoare triple {52470#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,002 INFO L290 TraceCheckUtils]: 90: Hoare triple {52470#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {52470#(< ~counter~0 100)} is VALID [2022-04-08 06:03:31,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {52495#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52470#(< ~counter~0 100)} is VALID [2022-04-08 06:03:31,003 INFO L290 TraceCheckUtils]: 88: Hoare triple {52495#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52495#(< ~counter~0 99)} is VALID [2022-04-08 06:03:31,003 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52107#true} {52495#(< ~counter~0 99)} #96#return; {52495#(< ~counter~0 99)} is VALID [2022-04-08 06:03:31,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,004 INFO L272 TraceCheckUtils]: 83: Hoare triple {52495#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,004 INFO L290 TraceCheckUtils]: 82: Hoare triple {52495#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {52495#(< ~counter~0 99)} is VALID [2022-04-08 06:03:31,005 INFO L290 TraceCheckUtils]: 81: Hoare triple {52520#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52495#(< ~counter~0 99)} is VALID [2022-04-08 06:03:31,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {52520#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52520#(< ~counter~0 98)} is VALID [2022-04-08 06:03:31,005 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52107#true} {52520#(< ~counter~0 98)} #96#return; {52520#(< ~counter~0 98)} is VALID [2022-04-08 06:03:31,005 INFO L290 TraceCheckUtils]: 78: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,005 INFO L290 TraceCheckUtils]: 77: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,005 INFO L290 TraceCheckUtils]: 76: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,005 INFO L272 TraceCheckUtils]: 75: Hoare triple {52520#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {52520#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {52520#(< ~counter~0 98)} is VALID [2022-04-08 06:03:31,006 INFO L290 TraceCheckUtils]: 73: Hoare triple {52545#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52520#(< ~counter~0 98)} is VALID [2022-04-08 06:03:31,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {52545#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52545#(< ~counter~0 97)} is VALID [2022-04-08 06:03:31,007 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52107#true} {52545#(< ~counter~0 97)} #96#return; {52545#(< ~counter~0 97)} is VALID [2022-04-08 06:03:31,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,007 INFO L272 TraceCheckUtils]: 67: Hoare triple {52545#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {52545#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {52545#(< ~counter~0 97)} is VALID [2022-04-08 06:03:31,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {52570#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52545#(< ~counter~0 97)} is VALID [2022-04-08 06:03:31,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {52570#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52570#(< ~counter~0 96)} is VALID [2022-04-08 06:03:31,009 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52107#true} {52570#(< ~counter~0 96)} #96#return; {52570#(< ~counter~0 96)} is VALID [2022-04-08 06:03:31,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,009 INFO L272 TraceCheckUtils]: 59: Hoare triple {52570#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {52570#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {52570#(< ~counter~0 96)} is VALID [2022-04-08 06:03:31,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {52595#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52570#(< ~counter~0 96)} is VALID [2022-04-08 06:03:31,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {52595#(< ~counter~0 95)} assume !!(0 != ~r~0); {52595#(< ~counter~0 95)} is VALID [2022-04-08 06:03:31,011 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52107#true} {52595#(< ~counter~0 95)} #94#return; {52595#(< ~counter~0 95)} is VALID [2022-04-08 06:03:31,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,011 INFO L272 TraceCheckUtils]: 51: Hoare triple {52595#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {52595#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {52595#(< ~counter~0 95)} is VALID [2022-04-08 06:03:31,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {52620#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52595#(< ~counter~0 95)} is VALID [2022-04-08 06:03:31,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {52620#(< ~counter~0 94)} assume !(~r~0 < 0); {52620#(< ~counter~0 94)} is VALID [2022-04-08 06:03:31,012 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52107#true} {52620#(< ~counter~0 94)} #98#return; {52620#(< ~counter~0 94)} is VALID [2022-04-08 06:03:31,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,013 INFO L272 TraceCheckUtils]: 43: Hoare triple {52620#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {52620#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {52620#(< ~counter~0 94)} is VALID [2022-04-08 06:03:31,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {52645#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52620#(< ~counter~0 94)} is VALID [2022-04-08 06:03:31,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {52645#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52645#(< ~counter~0 93)} is VALID [2022-04-08 06:03:31,014 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52107#true} {52645#(< ~counter~0 93)} #98#return; {52645#(< ~counter~0 93)} is VALID [2022-04-08 06:03:31,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,014 INFO L272 TraceCheckUtils]: 35: Hoare triple {52645#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {52645#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {52645#(< ~counter~0 93)} is VALID [2022-04-08 06:03:31,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {52670#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52645#(< ~counter~0 93)} is VALID [2022-04-08 06:03:31,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {52670#(< ~counter~0 92)} assume !(~r~0 > 0); {52670#(< ~counter~0 92)} is VALID [2022-04-08 06:03:31,016 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52107#true} {52670#(< ~counter~0 92)} #96#return; {52670#(< ~counter~0 92)} is VALID [2022-04-08 06:03:31,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,016 INFO L272 TraceCheckUtils]: 27: Hoare triple {52670#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {52670#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {52670#(< ~counter~0 92)} is VALID [2022-04-08 06:03:31,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {52695#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52670#(< ~counter~0 92)} is VALID [2022-04-08 06:03:31,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {52695#(< ~counter~0 91)} assume !!(0 != ~r~0); {52695#(< ~counter~0 91)} is VALID [2022-04-08 06:03:31,018 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52107#true} {52695#(< ~counter~0 91)} #94#return; {52695#(< ~counter~0 91)} is VALID [2022-04-08 06:03:31,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,018 INFO L272 TraceCheckUtils]: 19: Hoare triple {52695#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {52695#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {52695#(< ~counter~0 91)} is VALID [2022-04-08 06:03:31,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {52720#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52695#(< ~counter~0 91)} is VALID [2022-04-08 06:03:31,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {52720#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52107#true} {52720#(< ~counter~0 90)} #92#return; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L272 TraceCheckUtils]: 11: Hoare triple {52720#(< ~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)); {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52107#true} {52720#(< ~counter~0 90)} #90#return; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-08 06:03:31,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {52720#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {52107#true} is VALID [2022-04-08 06:03:31,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {52720#(< ~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; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {52720#(< ~counter~0 90)} call #t~ret9 := main(); {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52720#(< ~counter~0 90)} {52107#true} #102#return; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {52720#(< ~counter~0 90)} assume true; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {52107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {52720#(< ~counter~0 90)} is VALID [2022-04-08 06:03:31,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {52107#true} call ULTIMATE.init(); {52107#true} is VALID [2022-04-08 06:03:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-08 06:03:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:31,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311261521] [2022-04-08 06:03:31,022 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:31,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037879515] [2022-04-08 06:03:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037879515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:31,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:31,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-08 06:03:31,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:31,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2055389332] [2022-04-08 06:03:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2055389332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:31,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:31,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 06:03:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038346980] [2022-04-08 06:03:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-08 06:03:31,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:31,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:31,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:31,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 06:03:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 06:03:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-08 06:03:31,095 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:32,884 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-08 06:03:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 06:03:32,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-08 06:03:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 06:03:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-08 06:03:32,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-08 06:03:33,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:33,440 INFO L225 Difference]: With dead ends: 735 [2022-04-08 06:03:33,440 INFO L226 Difference]: Without dead ends: 538 [2022-04-08 06:03:33,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 06:03:33,449 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:33,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 262 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:03:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-08 06:03:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-08 06:03:36,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:36,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:36,076 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:36,076 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:36,088 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 06:03:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:03:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:36,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:36,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 06:03:36,090 INFO L87 Difference]: Start difference. First operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 538 states. [2022-04-08 06:03:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:36,122 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-08 06:03:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:03:36,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:36,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:36,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:36,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 410 states have (on average 1.2365853658536585) internal successors, (507), 410 states have internal predecessors, (507), 114 states have call successors, (114), 15 states have call predecessors, (114), 13 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-08 06:03:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-08 06:03:36,138 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-08 06:03:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:36,138 INFO L478 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-08 06:03:36,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-08 06:03:36,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-08 06:03:39,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 732 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-08 06:03:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 06:03:39,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:39,129 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:39,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-08 06:03:39,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:39,337 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-08 06:03:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:39,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842281319] [2022-04-08 06:03:39,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-08 06:03:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:39,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819774941] [2022-04-08 06:03:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:39,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:39,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759510776] [2022-04-08 06:03:39,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:03:39,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:39,373 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:39,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 06:03:39,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:03:39,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:39,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:03:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:39,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:40,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {56414#true} call ULTIMATE.init(); {56414#true} is VALID [2022-04-08 06:03:40,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {56414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56422#(<= ~counter~0 0)} {56414#true} #102#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {56422#(<= ~counter~0 0)} call #t~ret9 := main(); {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {56422#(<= ~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; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {56422#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {56422#(<= ~counter~0 0)} ~cond := #in~cond; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {56422#(<= ~counter~0 0)} assume !(0 == ~cond); {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,030 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56422#(<= ~counter~0 0)} {56422#(<= ~counter~0 0)} #90#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,030 INFO L272 TraceCheckUtils]: 11: Hoare triple {56422#(<= ~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)); {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {56422#(<= ~counter~0 0)} ~cond := #in~cond; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {56422#(<= ~counter~0 0)} assume !(0 == ~cond); {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,031 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56422#(<= ~counter~0 0)} {56422#(<= ~counter~0 0)} #92#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {56422#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56422#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:40,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {56422#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {56471#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,032 INFO L272 TraceCheckUtils]: 19: Hoare triple {56471#(<= ~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)); {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {56471#(<= ~counter~0 1)} ~cond := #in~cond; {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {56471#(<= ~counter~0 1)} assume !(0 == ~cond); {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {56471#(<= ~counter~0 1)} assume true; {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,033 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56471#(<= ~counter~0 1)} {56471#(<= ~counter~0 1)} #94#return; {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {56471#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56471#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:40,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {56471#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {56496#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,034 INFO L272 TraceCheckUtils]: 27: Hoare triple {56496#(<= ~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)); {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {56496#(<= ~counter~0 2)} ~cond := #in~cond; {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {56496#(<= ~counter~0 2)} assume !(0 == ~cond); {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {56496#(<= ~counter~0 2)} assume true; {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,035 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56496#(<= ~counter~0 2)} {56496#(<= ~counter~0 2)} #96#return; {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {56496#(<= ~counter~0 2)} assume !(~r~0 > 0); {56496#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:40,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {56496#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {56521#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,036 INFO L272 TraceCheckUtils]: 35: Hoare triple {56521#(<= ~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)); {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {56521#(<= ~counter~0 3)} ~cond := #in~cond; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {56521#(<= ~counter~0 3)} assume !(0 == ~cond); {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {56521#(<= ~counter~0 3)} assume true; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,037 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56521#(<= ~counter~0 3)} {56521#(<= ~counter~0 3)} #98#return; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {56521#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56521#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:40,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {56521#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {56546#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,038 INFO L272 TraceCheckUtils]: 43: Hoare triple {56546#(<= ~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)); {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {56546#(<= ~counter~0 4)} ~cond := #in~cond; {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {56546#(<= ~counter~0 4)} assume !(0 == ~cond); {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {56546#(<= ~counter~0 4)} assume true; {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,039 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56546#(<= ~counter~0 4)} {56546#(<= ~counter~0 4)} #98#return; {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {56546#(<= ~counter~0 4)} assume !(~r~0 < 0); {56546#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:40,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {56546#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {56571#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,040 INFO L272 TraceCheckUtils]: 51: Hoare triple {56571#(<= ~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)); {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {56571#(<= ~counter~0 5)} ~cond := #in~cond; {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {56571#(<= ~counter~0 5)} assume !(0 == ~cond); {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {56571#(<= ~counter~0 5)} assume true; {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,041 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56571#(<= ~counter~0 5)} {56571#(<= ~counter~0 5)} #94#return; {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {56571#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56571#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:40,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {56571#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {56596#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,051 INFO L272 TraceCheckUtils]: 59: Hoare triple {56596#(<= ~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)); {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {56596#(<= ~counter~0 6)} ~cond := #in~cond; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {56596#(<= ~counter~0 6)} assume !(0 == ~cond); {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {56596#(<= ~counter~0 6)} assume true; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,052 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56596#(<= ~counter~0 6)} {56596#(<= ~counter~0 6)} #96#return; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {56596#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56596#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:40,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {56596#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,053 INFO L290 TraceCheckUtils]: 66: Hoare triple {56621#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,053 INFO L272 TraceCheckUtils]: 67: Hoare triple {56621#(<= ~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)); {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,053 INFO L290 TraceCheckUtils]: 68: Hoare triple {56621#(<= ~counter~0 7)} ~cond := #in~cond; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {56621#(<= ~counter~0 7)} assume !(0 == ~cond); {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,054 INFO L290 TraceCheckUtils]: 70: Hoare triple {56621#(<= ~counter~0 7)} assume true; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,054 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56621#(<= ~counter~0 7)} {56621#(<= ~counter~0 7)} #96#return; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,054 INFO L290 TraceCheckUtils]: 72: Hoare triple {56621#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56621#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:40,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {56621#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {56646#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,055 INFO L272 TraceCheckUtils]: 75: Hoare triple {56646#(<= ~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)); {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {56646#(<= ~counter~0 8)} ~cond := #in~cond; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {56646#(<= ~counter~0 8)} assume !(0 == ~cond); {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {56646#(<= ~counter~0 8)} assume true; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,056 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56646#(<= ~counter~0 8)} {56646#(<= ~counter~0 8)} #96#return; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,056 INFO L290 TraceCheckUtils]: 80: Hoare triple {56646#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56646#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:40,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {56646#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {56671#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,057 INFO L272 TraceCheckUtils]: 83: Hoare triple {56671#(<= ~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)); {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {56671#(<= ~counter~0 9)} ~cond := #in~cond; {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {56671#(<= ~counter~0 9)} assume !(0 == ~cond); {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,058 INFO L290 TraceCheckUtils]: 86: Hoare triple {56671#(<= ~counter~0 9)} assume true; {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,058 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56671#(<= ~counter~0 9)} {56671#(<= ~counter~0 9)} #96#return; {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,058 INFO L290 TraceCheckUtils]: 88: Hoare triple {56671#(<= ~counter~0 9)} assume !(~r~0 > 0); {56671#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:40,059 INFO L290 TraceCheckUtils]: 89: Hoare triple {56671#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,059 INFO L290 TraceCheckUtils]: 90: Hoare triple {56696#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,059 INFO L272 TraceCheckUtils]: 91: Hoare triple {56696#(<= ~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)); {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,059 INFO L290 TraceCheckUtils]: 92: Hoare triple {56696#(<= ~counter~0 10)} ~cond := #in~cond; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,059 INFO L290 TraceCheckUtils]: 93: Hoare triple {56696#(<= ~counter~0 10)} assume !(0 == ~cond); {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,060 INFO L290 TraceCheckUtils]: 94: Hoare triple {56696#(<= ~counter~0 10)} assume true; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,060 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56696#(<= ~counter~0 10)} {56696#(<= ~counter~0 10)} #98#return; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,060 INFO L290 TraceCheckUtils]: 96: Hoare triple {56696#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56696#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:40,061 INFO L290 TraceCheckUtils]: 97: Hoare triple {56696#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,061 INFO L290 TraceCheckUtils]: 98: Hoare triple {56721#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,061 INFO L272 TraceCheckUtils]: 99: Hoare triple {56721#(<= ~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)); {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,061 INFO L290 TraceCheckUtils]: 100: Hoare triple {56721#(<= ~counter~0 11)} ~cond := #in~cond; {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,061 INFO L290 TraceCheckUtils]: 101: Hoare triple {56721#(<= ~counter~0 11)} assume !(0 == ~cond); {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,062 INFO L290 TraceCheckUtils]: 102: Hoare triple {56721#(<= ~counter~0 11)} assume true; {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,062 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56721#(<= ~counter~0 11)} {56721#(<= ~counter~0 11)} #98#return; {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,062 INFO L290 TraceCheckUtils]: 104: Hoare triple {56721#(<= ~counter~0 11)} assume !(~r~0 < 0); {56721#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:40,062 INFO L290 TraceCheckUtils]: 105: Hoare triple {56721#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56746#(<= |main_#t~post6| 11)} is VALID [2022-04-08 06:03:40,062 INFO L290 TraceCheckUtils]: 106: Hoare triple {56746#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {56415#false} is VALID [2022-04-08 06:03:40,063 INFO L272 TraceCheckUtils]: 107: Hoare triple {56415#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56415#false} is VALID [2022-04-08 06:03:40,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {56415#false} ~cond := #in~cond; {56415#false} is VALID [2022-04-08 06:03:40,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {56415#false} assume 0 == ~cond; {56415#false} is VALID [2022-04-08 06:03:40,063 INFO L290 TraceCheckUtils]: 110: Hoare triple {56415#false} assume !false; {56415#false} is VALID [2022-04-08 06:03:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:40,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:40,479 INFO L290 TraceCheckUtils]: 110: Hoare triple {56415#false} assume !false; {56415#false} is VALID [2022-04-08 06:03:40,480 INFO L290 TraceCheckUtils]: 109: Hoare triple {56415#false} assume 0 == ~cond; {56415#false} is VALID [2022-04-08 06:03:40,480 INFO L290 TraceCheckUtils]: 108: Hoare triple {56415#false} ~cond := #in~cond; {56415#false} is VALID [2022-04-08 06:03:40,480 INFO L272 TraceCheckUtils]: 107: Hoare triple {56415#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56415#false} is VALID [2022-04-08 06:03:40,480 INFO L290 TraceCheckUtils]: 106: Hoare triple {56774#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {56415#false} is VALID [2022-04-08 06:03:40,480 INFO L290 TraceCheckUtils]: 105: Hoare triple {56778#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56774#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:03:40,480 INFO L290 TraceCheckUtils]: 104: Hoare triple {56778#(< ~counter~0 100)} assume !(~r~0 < 0); {56778#(< ~counter~0 100)} is VALID [2022-04-08 06:03:40,481 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56414#true} {56778#(< ~counter~0 100)} #98#return; {56778#(< ~counter~0 100)} is VALID [2022-04-08 06:03:40,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,481 INFO L272 TraceCheckUtils]: 99: Hoare triple {56778#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {56778#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {56778#(< ~counter~0 100)} is VALID [2022-04-08 06:03:40,482 INFO L290 TraceCheckUtils]: 97: Hoare triple {56803#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56778#(< ~counter~0 100)} is VALID [2022-04-08 06:03:40,482 INFO L290 TraceCheckUtils]: 96: Hoare triple {56803#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56803#(< ~counter~0 99)} is VALID [2022-04-08 06:03:40,483 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56414#true} {56803#(< ~counter~0 99)} #98#return; {56803#(< ~counter~0 99)} is VALID [2022-04-08 06:03:40,483 INFO L290 TraceCheckUtils]: 94: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,483 INFO L290 TraceCheckUtils]: 93: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,483 INFO L290 TraceCheckUtils]: 92: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,483 INFO L272 TraceCheckUtils]: 91: Hoare triple {56803#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,483 INFO L290 TraceCheckUtils]: 90: Hoare triple {56803#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {56803#(< ~counter~0 99)} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {56828#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56803#(< ~counter~0 99)} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {56828#(< ~counter~0 98)} assume !(~r~0 > 0); {56828#(< ~counter~0 98)} is VALID [2022-04-08 06:03:40,484 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56414#true} {56828#(< ~counter~0 98)} #96#return; {56828#(< ~counter~0 98)} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,484 INFO L272 TraceCheckUtils]: 83: Hoare triple {56828#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {56828#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {56828#(< ~counter~0 98)} is VALID [2022-04-08 06:03:40,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {56853#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56828#(< ~counter~0 98)} is VALID [2022-04-08 06:03:40,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {56853#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56853#(< ~counter~0 97)} is VALID [2022-04-08 06:03:40,485 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56414#true} {56853#(< ~counter~0 97)} #96#return; {56853#(< ~counter~0 97)} is VALID [2022-04-08 06:03:40,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,486 INFO L290 TraceCheckUtils]: 77: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,486 INFO L290 TraceCheckUtils]: 76: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,486 INFO L272 TraceCheckUtils]: 75: Hoare triple {56853#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,486 INFO L290 TraceCheckUtils]: 74: Hoare triple {56853#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {56853#(< ~counter~0 97)} is VALID [2022-04-08 06:03:40,486 INFO L290 TraceCheckUtils]: 73: Hoare triple {56878#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56853#(< ~counter~0 97)} is VALID [2022-04-08 06:03:40,487 INFO L290 TraceCheckUtils]: 72: Hoare triple {56878#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56878#(< ~counter~0 96)} is VALID [2022-04-08 06:03:40,487 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56414#true} {56878#(< ~counter~0 96)} #96#return; {56878#(< ~counter~0 96)} is VALID [2022-04-08 06:03:40,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,487 INFO L272 TraceCheckUtils]: 67: Hoare triple {56878#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {56878#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {56878#(< ~counter~0 96)} is VALID [2022-04-08 06:03:40,488 INFO L290 TraceCheckUtils]: 65: Hoare triple {56903#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56878#(< ~counter~0 96)} is VALID [2022-04-08 06:03:40,488 INFO L290 TraceCheckUtils]: 64: Hoare triple {56903#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56903#(< ~counter~0 95)} is VALID [2022-04-08 06:03:40,488 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56414#true} {56903#(< ~counter~0 95)} #96#return; {56903#(< ~counter~0 95)} is VALID [2022-04-08 06:03:40,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,488 INFO L272 TraceCheckUtils]: 59: Hoare triple {56903#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {56903#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {56903#(< ~counter~0 95)} is VALID [2022-04-08 06:03:40,489 INFO L290 TraceCheckUtils]: 57: Hoare triple {56928#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56903#(< ~counter~0 95)} is VALID [2022-04-08 06:03:40,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {56928#(< ~counter~0 94)} assume !!(0 != ~r~0); {56928#(< ~counter~0 94)} is VALID [2022-04-08 06:03:40,490 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56414#true} {56928#(< ~counter~0 94)} #94#return; {56928#(< ~counter~0 94)} is VALID [2022-04-08 06:03:40,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,490 INFO L272 TraceCheckUtils]: 51: Hoare triple {56928#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {56928#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {56928#(< ~counter~0 94)} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {56953#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56928#(< ~counter~0 94)} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {56953#(< ~counter~0 93)} assume !(~r~0 < 0); {56953#(< ~counter~0 93)} is VALID [2022-04-08 06:03:40,491 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56414#true} {56953#(< ~counter~0 93)} #98#return; {56953#(< ~counter~0 93)} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,491 INFO L272 TraceCheckUtils]: 43: Hoare triple {56953#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {56953#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {56953#(< ~counter~0 93)} is VALID [2022-04-08 06:03:40,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {56978#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56953#(< ~counter~0 93)} is VALID [2022-04-08 06:03:40,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {56978#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56978#(< ~counter~0 92)} is VALID [2022-04-08 06:03:40,492 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56414#true} {56978#(< ~counter~0 92)} #98#return; {56978#(< ~counter~0 92)} is VALID [2022-04-08 06:03:40,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,493 INFO L272 TraceCheckUtils]: 35: Hoare triple {56978#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {56978#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {56978#(< ~counter~0 92)} is VALID [2022-04-08 06:03:40,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {57003#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56978#(< ~counter~0 92)} is VALID [2022-04-08 06:03:40,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {57003#(< ~counter~0 91)} assume !(~r~0 > 0); {57003#(< ~counter~0 91)} is VALID [2022-04-08 06:03:40,494 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56414#true} {57003#(< ~counter~0 91)} #96#return; {57003#(< ~counter~0 91)} is VALID [2022-04-08 06:03:40,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,494 INFO L272 TraceCheckUtils]: 27: Hoare triple {57003#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {57003#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {57003#(< ~counter~0 91)} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {57028#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57003#(< ~counter~0 91)} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {57028#(< ~counter~0 90)} assume !!(0 != ~r~0); {57028#(< ~counter~0 90)} is VALID [2022-04-08 06:03:40,495 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56414#true} {57028#(< ~counter~0 90)} #94#return; {57028#(< ~counter~0 90)} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,495 INFO L272 TraceCheckUtils]: 19: Hoare triple {57028#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {57028#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {57028#(< ~counter~0 90)} is VALID [2022-04-08 06:03:40,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {57053#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57028#(< ~counter~0 90)} is VALID [2022-04-08 06:03:40,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {57053#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56414#true} {57053#(< ~counter~0 89)} #92#return; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {57053#(< ~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)); {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56414#true} {57053#(< ~counter~0 89)} #90#return; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {57053#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56414#true} is VALID [2022-04-08 06:03:40,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {57053#(< ~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; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {57053#(< ~counter~0 89)} call #t~ret9 := main(); {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57053#(< ~counter~0 89)} {56414#true} #102#return; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {57053#(< ~counter~0 89)} assume true; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {56414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {57053#(< ~counter~0 89)} is VALID [2022-04-08 06:03:40,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {56414#true} call ULTIMATE.init(); {56414#true} is VALID [2022-04-08 06:03:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 06:03:40,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819774941] [2022-04-08 06:03:40,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:40,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759510776] [2022-04-08 06:03:40,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759510776] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:40,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:40,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:03:40,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842281319] [2022-04-08 06:03:40,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842281319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:40,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:40,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:03:40,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155768020] [2022-04-08 06:03:40,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:40,504 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-08 06:03:40,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:40,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:40,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:40,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:03:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:03:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:03:40,684 INFO L87 Difference]: Start difference. First operand 538 states and 733 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:43,398 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-08 06:03:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 06:03:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-08 06:03:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 06:03:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-08 06:03:43,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-08 06:03:43,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:43,640 INFO L225 Difference]: With dead ends: 593 [2022-04-08 06:03:43,640 INFO L226 Difference]: Without dead ends: 582 [2022-04-08 06:03:43,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=525, Invalid=735, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:03:43,656 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 129 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:43,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 299 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:03:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-08 06:03:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-08 06:03:45,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:45,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:45,070 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:45,070 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:45,104 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 06:03:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 06:03:45,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:45,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:45,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 06:03:45,106 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 582 states. [2022-04-08 06:03:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:45,133 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-08 06:03:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-08 06:03:45,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:45,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:45,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:45,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 06:03:45,166 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-08 06:03:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:45,166 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 06:03:45,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:45,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 06:03:48,125 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-08 06:03:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 06:03:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 06:03:48,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:48,126 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:48,132 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-08 06:03:48,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 06:03:48,331 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-08 06:03:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240787709] [2022-04-08 06:03:48,331 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-08 06:03:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443780472] [2022-04-08 06:03:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:48,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496712100] [2022-04-08 06:03:48,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:03:48,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:48,351 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:48,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 06:03:48,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:03:48,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:48,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:03:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:48,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:49,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {60593#true} call ULTIMATE.init(); {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {60593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60593#true} {60593#true} #102#return; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {60593#true} call #t~ret9 := main(); {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {60593#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; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {60593#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60593#true} {60593#true} #90#return; {60593#true} is VALID [2022-04-08 06:03:49,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {60593#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)); {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60593#true} {60593#true} #92#return; {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {60593#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {60646#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,026 INFO L272 TraceCheckUtils]: 19: Hoare triple {60646#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,027 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #94#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {60646#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,027 INFO L272 TraceCheckUtils]: 27: Hoare triple {60646#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,028 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #96#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {60646#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {60646#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,028 INFO L272 TraceCheckUtils]: 35: Hoare triple {60646#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,029 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #98#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-08 06:03:49,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,031 INFO L272 TraceCheckUtils]: 43: Hoare triple {60719#(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)); {60593#true} is VALID [2022-04-08 06:03:49,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,031 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60593#true} {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,032 INFO L272 TraceCheckUtils]: 51: Hoare triple {60719#(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)); {60593#true} is VALID [2022-04-08 06:03:49,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,032 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60593#true} {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,033 INFO L272 TraceCheckUtils]: 59: Hoare triple {60719#(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)); {60593#true} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,034 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60593#true} {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-08 06:03:49,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {60719#(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; {60792#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:03:49,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {60792#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60792#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:03:49,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {60792#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60792#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:03:49,035 INFO L272 TraceCheckUtils]: 67: Hoare triple {60792#(< (+ 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)); {60593#true} is VALID [2022-04-08 06:03:49,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,035 INFO L290 TraceCheckUtils]: 70: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,035 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60593#true} {60792#(< (+ main_~r~0 3) main_~u~0)} #96#return; {60792#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {60792#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 74: Hoare triple {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:03:49,036 INFO L272 TraceCheckUtils]: 75: Hoare triple {60817#(< (+ 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)); {60593#true} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 76: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 77: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,036 INFO L290 TraceCheckUtils]: 78: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,037 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60593#true} {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-08 06:03:49,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {60817#(< (+ 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; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,037 INFO L272 TraceCheckUtils]: 83: Hoare triple {60842#(< 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)); {60593#true} is VALID [2022-04-08 06:03:49,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,038 INFO L290 TraceCheckUtils]: 86: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,038 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60593#true} {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,038 INFO L290 TraceCheckUtils]: 89: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,038 INFO L272 TraceCheckUtils]: 91: Hoare triple {60842#(< 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)); {60593#true} is VALID [2022-04-08 06:03:49,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,039 INFO L290 TraceCheckUtils]: 94: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,039 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60593#true} {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {60842#(< 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; {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 97: Hoare triple {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 98: Hoare triple {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:03:49,040 INFO L272 TraceCheckUtils]: 99: Hoare triple {60891#(< 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)); {60593#true} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 100: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,040 INFO L290 TraceCheckUtils]: 102: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,041 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60593#true} {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 105: Hoare triple {60594#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {60594#false} assume !(#t~post8 < 100);havoc #t~post8; {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 107: Hoare triple {60594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {60594#false} assume !(#t~post6 < 100);havoc #t~post6; {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L272 TraceCheckUtils]: 109: Hoare triple {60594#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60594#false} is VALID [2022-04-08 06:03:49,041 INFO L290 TraceCheckUtils]: 110: Hoare triple {60594#false} ~cond := #in~cond; {60594#false} is VALID [2022-04-08 06:03:49,042 INFO L290 TraceCheckUtils]: 111: Hoare triple {60594#false} assume 0 == ~cond; {60594#false} is VALID [2022-04-08 06:03:49,042 INFO L290 TraceCheckUtils]: 112: Hoare triple {60594#false} assume !false; {60594#false} is VALID [2022-04-08 06:03:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 06:03:49,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {60594#false} assume !false; {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 111: Hoare triple {60594#false} assume 0 == ~cond; {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {60594#false} ~cond := #in~cond; {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L272 TraceCheckUtils]: 109: Hoare triple {60594#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 108: Hoare triple {60594#false} assume !(#t~post6 < 100);havoc #t~post6; {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {60594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60594#false} is VALID [2022-04-08 06:03:49,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {60594#false} assume !(#t~post8 < 100);havoc #t~post8; {60594#false} is VALID [2022-04-08 06:03:49,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {60594#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60594#false} is VALID [2022-04-08 06:03:49,478 INFO L290 TraceCheckUtils]: 104: Hoare triple {60964#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60594#false} is VALID [2022-04-08 06:03:49,478 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {60593#true} {60964#(not (< main_~r~0 0))} #98#return; {60964#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:49,478 INFO L290 TraceCheckUtils]: 102: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,478 INFO L290 TraceCheckUtils]: 101: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,478 INFO L272 TraceCheckUtils]: 99: Hoare triple {60964#(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)); {60593#true} is VALID [2022-04-08 06:03:49,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {60964#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {60964#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:49,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {60964#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60964#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:49,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60964#(not (< main_~r~0 0))} is VALID [2022-04-08 06:03:49,480 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60593#true} {60989#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,480 INFO L272 TraceCheckUtils]: 91: Hoare triple {60989#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,481 INFO L290 TraceCheckUtils]: 89: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,481 INFO L290 TraceCheckUtils]: 88: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,482 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60593#true} {60989#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,482 INFO L290 TraceCheckUtils]: 86: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,482 INFO L272 TraceCheckUtils]: 83: Hoare triple {60989#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,483 INFO L290 TraceCheckUtils]: 80: Hoare triple {61038#(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; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:03:49,483 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60593#true} {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:49,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,484 INFO L290 TraceCheckUtils]: 76: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,484 INFO L272 TraceCheckUtils]: 75: Hoare triple {61038#(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)); {60593#true} is VALID [2022-04-08 06:03:49,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:49,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:49,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {61063#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:03:49,486 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60593#true} {61063#(<= main_~r~0 main_~u~0)} #96#return; {61063#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:49,486 INFO L290 TraceCheckUtils]: 70: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,486 INFO L290 TraceCheckUtils]: 69: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,486 INFO L272 TraceCheckUtils]: 67: Hoare triple {61063#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {61063#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {61063#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:49,487 INFO L290 TraceCheckUtils]: 65: Hoare triple {61063#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61063#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:49,487 INFO L290 TraceCheckUtils]: 64: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61063#(<= main_~r~0 main_~u~0)} is VALID [2022-04-08 06:03:49,488 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60593#true} {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,488 INFO L272 TraceCheckUtils]: 59: Hoare triple {61088#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,489 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60593#true} {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,489 INFO L272 TraceCheckUtils]: 51: Hoare triple {61088#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,491 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60593#true} {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,491 INFO L272 TraceCheckUtils]: 43: Hoare triple {61088#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-08 06:03:49,493 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60593#true} {61161#(<= 0 (+ main_~v~0 3))} #98#return; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,493 INFO L272 TraceCheckUtils]: 35: Hoare triple {61161#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,494 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60593#true} {61161#(<= 0 (+ main_~v~0 3))} #96#return; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,494 INFO L272 TraceCheckUtils]: 27: Hoare triple {61161#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,496 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60593#true} {61161#(<= 0 (+ main_~v~0 3))} #94#return; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,496 INFO L272 TraceCheckUtils]: 19: Hoare triple {61161#(<= 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)); {60593#true} is VALID [2022-04-08 06:03:49,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 100);havoc #t~post6; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {60593#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-08 06:03:49,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60593#true} {60593#true} #92#return; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {60593#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)); {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60593#true} {60593#true} #90#return; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {60593#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {60593#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; {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {60593#true} call #t~ret9 := main(); {60593#true} is VALID [2022-04-08 06:03:49,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60593#true} {60593#true} #102#return; {60593#true} is VALID [2022-04-08 06:03:49,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-08 06:03:49,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {60593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {60593#true} is VALID [2022-04-08 06:03:49,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {60593#true} call ULTIMATE.init(); {60593#true} is VALID [2022-04-08 06:03:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 06:03:49,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443780472] [2022-04-08 06:03:49,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496712100] [2022-04-08 06:03:49,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496712100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:49,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:49,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:03:49,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:49,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240787709] [2022-04-08 06:03:49,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240787709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:49,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:49,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:03:49,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980751261] [2022-04-08 06:03:49,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-08 06:03:49,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:49,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 06:03:49,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:49,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:03:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:03:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:03:49,568 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 06:03:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:52,233 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-08 06:03:52,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:03:52,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-08 06:03:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:03:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 06:03:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 06:03:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 06:03:52,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-08 06:03:52,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-08 06:03:52,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:52,402 INFO L225 Difference]: With dead ends: 862 [2022-04-08 06:03:52,402 INFO L226 Difference]: Without dead ends: 711 [2022-04-08 06:03:52,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:03:52,403 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:03:52,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 354 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:03:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-08 06:03:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-08 06:03:53,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:03:53,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:53,341 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:53,341 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:53,360 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 06:03:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 06:03:53,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:53,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:53,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 06:03:53,362 INFO L87 Difference]: Start difference. First operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 711 states. [2022-04-08 06:03:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:03:53,381 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-08 06:03:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-08 06:03:53,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:03:53,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:03:53,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:03:53,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:03:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 418 states have (on average 1.2344497607655502) internal successors, (516), 428 states have internal predecessors, (516), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:03:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-08 06:03:53,414 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-08 06:03:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:03:53,415 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-08 06:03:53,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-08 06:03:53,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-08 06:03:56,686 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-08 06:03:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-08 06:03:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 06:03:56,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:03:56,687 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:03:56,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-08 06:03:56,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:56,888 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:03:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:03:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-08 06:03:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:56,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578595237] [2022-04-08 06:03:56,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:03:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-08 06:03:56,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:03:56,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998291948] [2022-04-08 06:03:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:03:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:03:56,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:03:56,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1053893954] [2022-04-08 06:03:56,912 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:03:56,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:03:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:03:56,913 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:03:56,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 06:03:57,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:03:57,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:03:57,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:03:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:03:57,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:03:57,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {65560#true} call ULTIMATE.init(); {65560#true} is VALID [2022-04-08 06:03:57,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {65560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65568#(<= ~counter~0 0)} {65560#true} #102#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {65568#(<= ~counter~0 0)} call #t~ret9 := main(); {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {65568#(<= ~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; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {65568#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {65568#(<= ~counter~0 0)} ~cond := #in~cond; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {65568#(<= ~counter~0 0)} assume !(0 == ~cond); {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65568#(<= ~counter~0 0)} {65568#(<= ~counter~0 0)} #90#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {65568#(<= ~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)); {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {65568#(<= ~counter~0 0)} ~cond := #in~cond; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {65568#(<= ~counter~0 0)} assume !(0 == ~cond); {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65568#(<= ~counter~0 0)} {65568#(<= ~counter~0 0)} #92#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {65568#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65568#(<= ~counter~0 0)} is VALID [2022-04-08 06:03:57,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {65568#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {65617#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,927 INFO L272 TraceCheckUtils]: 19: Hoare triple {65617#(<= ~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)); {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {65617#(<= ~counter~0 1)} ~cond := #in~cond; {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {65617#(<= ~counter~0 1)} assume !(0 == ~cond); {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {65617#(<= ~counter~0 1)} assume true; {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,928 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65617#(<= ~counter~0 1)} {65617#(<= ~counter~0 1)} #94#return; {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {65617#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65617#(<= ~counter~0 1)} is VALID [2022-04-08 06:03:57,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {65617#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {65642#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,930 INFO L272 TraceCheckUtils]: 27: Hoare triple {65642#(<= ~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)); {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {65642#(<= ~counter~0 2)} ~cond := #in~cond; {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {65642#(<= ~counter~0 2)} assume !(0 == ~cond); {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {65642#(<= ~counter~0 2)} assume true; {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,931 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65642#(<= ~counter~0 2)} {65642#(<= ~counter~0 2)} #96#return; {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {65642#(<= ~counter~0 2)} assume !(~r~0 > 0); {65642#(<= ~counter~0 2)} is VALID [2022-04-08 06:03:57,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {65642#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {65667#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,933 INFO L272 TraceCheckUtils]: 35: Hoare triple {65667#(<= ~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)); {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {65667#(<= ~counter~0 3)} ~cond := #in~cond; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,934 INFO L290 TraceCheckUtils]: 37: Hoare triple {65667#(<= ~counter~0 3)} assume !(0 == ~cond); {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {65667#(<= ~counter~0 3)} assume true; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,934 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65667#(<= ~counter~0 3)} {65667#(<= ~counter~0 3)} #98#return; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {65667#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65667#(<= ~counter~0 3)} is VALID [2022-04-08 06:03:57,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {65667#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {65692#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,936 INFO L272 TraceCheckUtils]: 43: Hoare triple {65692#(<= ~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)); {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {65692#(<= ~counter~0 4)} ~cond := #in~cond; {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {65692#(<= ~counter~0 4)} assume !(0 == ~cond); {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {65692#(<= ~counter~0 4)} assume true; {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,937 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65692#(<= ~counter~0 4)} {65692#(<= ~counter~0 4)} #98#return; {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {65692#(<= ~counter~0 4)} assume !(~r~0 < 0); {65692#(<= ~counter~0 4)} is VALID [2022-04-08 06:03:57,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {65692#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {65717#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,939 INFO L272 TraceCheckUtils]: 51: Hoare triple {65717#(<= ~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)); {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {65717#(<= ~counter~0 5)} ~cond := #in~cond; {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {65717#(<= ~counter~0 5)} assume !(0 == ~cond); {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {65717#(<= ~counter~0 5)} assume true; {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,940 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65717#(<= ~counter~0 5)} {65717#(<= ~counter~0 5)} #94#return; {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {65717#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65717#(<= ~counter~0 5)} is VALID [2022-04-08 06:03:57,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {65717#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {65742#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,942 INFO L272 TraceCheckUtils]: 59: Hoare triple {65742#(<= ~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)); {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {65742#(<= ~counter~0 6)} ~cond := #in~cond; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {65742#(<= ~counter~0 6)} assume !(0 == ~cond); {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {65742#(<= ~counter~0 6)} assume true; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,943 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65742#(<= ~counter~0 6)} {65742#(<= ~counter~0 6)} #96#return; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {65742#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65742#(<= ~counter~0 6)} is VALID [2022-04-08 06:03:57,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {65742#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {65767#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,945 INFO L272 TraceCheckUtils]: 67: Hoare triple {65767#(<= ~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)); {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,945 INFO L290 TraceCheckUtils]: 68: Hoare triple {65767#(<= ~counter~0 7)} ~cond := #in~cond; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,945 INFO L290 TraceCheckUtils]: 69: Hoare triple {65767#(<= ~counter~0 7)} assume !(0 == ~cond); {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {65767#(<= ~counter~0 7)} assume true; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,946 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65767#(<= ~counter~0 7)} {65767#(<= ~counter~0 7)} #96#return; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {65767#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65767#(<= ~counter~0 7)} is VALID [2022-04-08 06:03:57,947 INFO L290 TraceCheckUtils]: 73: Hoare triple {65767#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {65792#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,948 INFO L272 TraceCheckUtils]: 75: Hoare triple {65792#(<= ~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)); {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {65792#(<= ~counter~0 8)} ~cond := #in~cond; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {65792#(<= ~counter~0 8)} assume !(0 == ~cond); {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,949 INFO L290 TraceCheckUtils]: 78: Hoare triple {65792#(<= ~counter~0 8)} assume true; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,949 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65792#(<= ~counter~0 8)} {65792#(<= ~counter~0 8)} #96#return; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {65792#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65792#(<= ~counter~0 8)} is VALID [2022-04-08 06:03:57,950 INFO L290 TraceCheckUtils]: 81: Hoare triple {65792#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,950 INFO L290 TraceCheckUtils]: 82: Hoare triple {65817#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,951 INFO L272 TraceCheckUtils]: 83: Hoare triple {65817#(<= ~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)); {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,951 INFO L290 TraceCheckUtils]: 84: Hoare triple {65817#(<= ~counter~0 9)} ~cond := #in~cond; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,951 INFO L290 TraceCheckUtils]: 85: Hoare triple {65817#(<= ~counter~0 9)} assume !(0 == ~cond); {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {65817#(<= ~counter~0 9)} assume true; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,952 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65817#(<= ~counter~0 9)} {65817#(<= ~counter~0 9)} #96#return; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {65817#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65817#(<= ~counter~0 9)} is VALID [2022-04-08 06:03:57,953 INFO L290 TraceCheckUtils]: 89: Hoare triple {65817#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,953 INFO L290 TraceCheckUtils]: 90: Hoare triple {65842#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,954 INFO L272 TraceCheckUtils]: 91: Hoare triple {65842#(<= ~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)); {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {65842#(<= ~counter~0 10)} ~cond := #in~cond; {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,954 INFO L290 TraceCheckUtils]: 93: Hoare triple {65842#(<= ~counter~0 10)} assume !(0 == ~cond); {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,954 INFO L290 TraceCheckUtils]: 94: Hoare triple {65842#(<= ~counter~0 10)} assume true; {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,955 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65842#(<= ~counter~0 10)} {65842#(<= ~counter~0 10)} #96#return; {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {65842#(<= ~counter~0 10)} assume !(~r~0 > 0); {65842#(<= ~counter~0 10)} is VALID [2022-04-08 06:03:57,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {65842#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,956 INFO L290 TraceCheckUtils]: 98: Hoare triple {65867#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,957 INFO L272 TraceCheckUtils]: 99: Hoare triple {65867#(<= ~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)); {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,957 INFO L290 TraceCheckUtils]: 100: Hoare triple {65867#(<= ~counter~0 11)} ~cond := #in~cond; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,957 INFO L290 TraceCheckUtils]: 101: Hoare triple {65867#(<= ~counter~0 11)} assume !(0 == ~cond); {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,957 INFO L290 TraceCheckUtils]: 102: Hoare triple {65867#(<= ~counter~0 11)} assume true; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,958 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65867#(<= ~counter~0 11)} {65867#(<= ~counter~0 11)} #98#return; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {65867#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65867#(<= ~counter~0 11)} is VALID [2022-04-08 06:03:57,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {65867#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65892#(<= |main_#t~post8| 11)} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {65892#(<= |main_#t~post8| 11)} assume !(#t~post8 < 100);havoc #t~post8; {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 107: Hoare triple {65561#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 108: Hoare triple {65561#false} assume !(#t~post6 < 100);havoc #t~post6; {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L272 TraceCheckUtils]: 109: Hoare triple {65561#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 110: Hoare triple {65561#false} ~cond := #in~cond; {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 111: Hoare triple {65561#false} assume 0 == ~cond; {65561#false} is VALID [2022-04-08 06:03:57,959 INFO L290 TraceCheckUtils]: 112: Hoare triple {65561#false} assume !false; {65561#false} is VALID [2022-04-08 06:03:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:03:57,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:03:58,603 INFO L290 TraceCheckUtils]: 112: Hoare triple {65561#false} assume !false; {65561#false} is VALID [2022-04-08 06:03:58,603 INFO L290 TraceCheckUtils]: 111: Hoare triple {65561#false} assume 0 == ~cond; {65561#false} is VALID [2022-04-08 06:03:58,603 INFO L290 TraceCheckUtils]: 110: Hoare triple {65561#false} ~cond := #in~cond; {65561#false} is VALID [2022-04-08 06:03:58,603 INFO L272 TraceCheckUtils]: 109: Hoare triple {65561#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65561#false} is VALID [2022-04-08 06:03:58,603 INFO L290 TraceCheckUtils]: 108: Hoare triple {65561#false} assume !(#t~post6 < 100);havoc #t~post6; {65561#false} is VALID [2022-04-08 06:03:58,603 INFO L290 TraceCheckUtils]: 107: Hoare triple {65561#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65561#false} is VALID [2022-04-08 06:03:58,604 INFO L290 TraceCheckUtils]: 106: Hoare triple {65932#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {65561#false} is VALID [2022-04-08 06:03:58,604 INFO L290 TraceCheckUtils]: 105: Hoare triple {65936#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65932#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:03:58,605 INFO L290 TraceCheckUtils]: 104: Hoare triple {65936#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65936#(< ~counter~0 100)} is VALID [2022-04-08 06:03:58,605 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65560#true} {65936#(< ~counter~0 100)} #98#return; {65936#(< ~counter~0 100)} is VALID [2022-04-08 06:03:58,605 INFO L290 TraceCheckUtils]: 102: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,605 INFO L290 TraceCheckUtils]: 101: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,605 INFO L290 TraceCheckUtils]: 100: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,605 INFO L272 TraceCheckUtils]: 99: Hoare triple {65936#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {65936#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {65936#(< ~counter~0 100)} is VALID [2022-04-08 06:03:58,607 INFO L290 TraceCheckUtils]: 97: Hoare triple {65961#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65936#(< ~counter~0 100)} is VALID [2022-04-08 06:03:58,607 INFO L290 TraceCheckUtils]: 96: Hoare triple {65961#(< ~counter~0 99)} assume !(~r~0 > 0); {65961#(< ~counter~0 99)} is VALID [2022-04-08 06:03:58,608 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65560#true} {65961#(< ~counter~0 99)} #96#return; {65961#(< ~counter~0 99)} is VALID [2022-04-08 06:03:58,608 INFO L290 TraceCheckUtils]: 94: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,608 INFO L290 TraceCheckUtils]: 93: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,608 INFO L290 TraceCheckUtils]: 92: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,608 INFO L272 TraceCheckUtils]: 91: Hoare triple {65961#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {65961#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {65961#(< ~counter~0 99)} is VALID [2022-04-08 06:03:58,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {65986#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65961#(< ~counter~0 99)} is VALID [2022-04-08 06:03:58,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {65986#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65986#(< ~counter~0 98)} is VALID [2022-04-08 06:03:58,610 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65560#true} {65986#(< ~counter~0 98)} #96#return; {65986#(< ~counter~0 98)} is VALID [2022-04-08 06:03:58,610 INFO L290 TraceCheckUtils]: 86: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,610 INFO L290 TraceCheckUtils]: 85: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,610 INFO L290 TraceCheckUtils]: 84: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,610 INFO L272 TraceCheckUtils]: 83: Hoare triple {65986#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {65986#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {65986#(< ~counter~0 98)} is VALID [2022-04-08 06:03:58,611 INFO L290 TraceCheckUtils]: 81: Hoare triple {66011#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65986#(< ~counter~0 98)} is VALID [2022-04-08 06:03:58,611 INFO L290 TraceCheckUtils]: 80: Hoare triple {66011#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66011#(< ~counter~0 97)} is VALID [2022-04-08 06:03:58,612 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65560#true} {66011#(< ~counter~0 97)} #96#return; {66011#(< ~counter~0 97)} is VALID [2022-04-08 06:03:58,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,612 INFO L272 TraceCheckUtils]: 75: Hoare triple {66011#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {66011#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {66011#(< ~counter~0 97)} is VALID [2022-04-08 06:03:58,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {66036#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66011#(< ~counter~0 97)} is VALID [2022-04-08 06:03:58,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {66036#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66036#(< ~counter~0 96)} is VALID [2022-04-08 06:03:58,614 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65560#true} {66036#(< ~counter~0 96)} #96#return; {66036#(< ~counter~0 96)} is VALID [2022-04-08 06:03:58,614 INFO L290 TraceCheckUtils]: 70: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,614 INFO L290 TraceCheckUtils]: 69: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,614 INFO L272 TraceCheckUtils]: 67: Hoare triple {66036#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {66036#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {66036#(< ~counter~0 96)} is VALID [2022-04-08 06:03:58,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {66061#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66036#(< ~counter~0 96)} is VALID [2022-04-08 06:03:58,615 INFO L290 TraceCheckUtils]: 64: Hoare triple {66061#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66061#(< ~counter~0 95)} is VALID [2022-04-08 06:03:58,615 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65560#true} {66061#(< ~counter~0 95)} #96#return; {66061#(< ~counter~0 95)} is VALID [2022-04-08 06:03:58,616 INFO L290 TraceCheckUtils]: 62: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,616 INFO L290 TraceCheckUtils]: 61: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,616 INFO L290 TraceCheckUtils]: 60: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,616 INFO L272 TraceCheckUtils]: 59: Hoare triple {66061#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {66061#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {66061#(< ~counter~0 95)} is VALID [2022-04-08 06:03:58,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {66086#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66061#(< ~counter~0 95)} is VALID [2022-04-08 06:03:58,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {66086#(< ~counter~0 94)} assume !!(0 != ~r~0); {66086#(< ~counter~0 94)} is VALID [2022-04-08 06:03:58,617 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65560#true} {66086#(< ~counter~0 94)} #94#return; {66086#(< ~counter~0 94)} is VALID [2022-04-08 06:03:58,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,618 INFO L272 TraceCheckUtils]: 51: Hoare triple {66086#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {66086#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {66086#(< ~counter~0 94)} is VALID [2022-04-08 06:03:58,619 INFO L290 TraceCheckUtils]: 49: Hoare triple {66111#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66086#(< ~counter~0 94)} is VALID [2022-04-08 06:03:58,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {66111#(< ~counter~0 93)} assume !(~r~0 < 0); {66111#(< ~counter~0 93)} is VALID [2022-04-08 06:03:58,619 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65560#true} {66111#(< ~counter~0 93)} #98#return; {66111#(< ~counter~0 93)} is VALID [2022-04-08 06:03:58,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,620 INFO L272 TraceCheckUtils]: 43: Hoare triple {66111#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {66111#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {66111#(< ~counter~0 93)} is VALID [2022-04-08 06:03:58,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {66136#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66111#(< ~counter~0 93)} is VALID [2022-04-08 06:03:58,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {66136#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66136#(< ~counter~0 92)} is VALID [2022-04-08 06:03:58,621 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65560#true} {66136#(< ~counter~0 92)} #98#return; {66136#(< ~counter~0 92)} is VALID [2022-04-08 06:03:58,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,621 INFO L272 TraceCheckUtils]: 35: Hoare triple {66136#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {66136#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {66136#(< ~counter~0 92)} is VALID [2022-04-08 06:03:58,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {66161#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66136#(< ~counter~0 92)} is VALID [2022-04-08 06:03:58,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {66161#(< ~counter~0 91)} assume !(~r~0 > 0); {66161#(< ~counter~0 91)} is VALID [2022-04-08 06:03:58,623 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65560#true} {66161#(< ~counter~0 91)} #96#return; {66161#(< ~counter~0 91)} is VALID [2022-04-08 06:03:58,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,623 INFO L272 TraceCheckUtils]: 27: Hoare triple {66161#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {66161#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {66161#(< ~counter~0 91)} is VALID [2022-04-08 06:03:58,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {66186#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66161#(< ~counter~0 91)} is VALID [2022-04-08 06:03:58,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {66186#(< ~counter~0 90)} assume !!(0 != ~r~0); {66186#(< ~counter~0 90)} is VALID [2022-04-08 06:03:58,625 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65560#true} {66186#(< ~counter~0 90)} #94#return; {66186#(< ~counter~0 90)} is VALID [2022-04-08 06:03:58,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,625 INFO L272 TraceCheckUtils]: 19: Hoare triple {66186#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {66186#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {66186#(< ~counter~0 90)} is VALID [2022-04-08 06:03:58,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {66211#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66186#(< ~counter~0 90)} is VALID [2022-04-08 06:03:58,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {66211#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,627 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65560#true} {66211#(< ~counter~0 89)} #92#return; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {66211#(< ~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)); {65560#true} is VALID [2022-04-08 06:03:58,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65560#true} {66211#(< ~counter~0 89)} #90#return; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-08 06:03:58,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-08 06:03:58,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-08 06:03:58,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {66211#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65560#true} is VALID [2022-04-08 06:03:58,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {66211#(< ~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; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#(< ~counter~0 89)} call #t~ret9 := main(); {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#(< ~counter~0 89)} {65560#true} #102#return; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#(< ~counter~0 89)} assume true; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {65560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {66211#(< ~counter~0 89)} is VALID [2022-04-08 06:03:58,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {65560#true} call ULTIMATE.init(); {65560#true} is VALID [2022-04-08 06:03:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 06:03:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:03:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998291948] [2022-04-08 06:03:58,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:03:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053893954] [2022-04-08 06:03:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053893954] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:03:58,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:03:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:03:58,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:03:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578595237] [2022-04-08 06:03:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578595237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:03:58,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:03:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:03:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427547146] [2022-04-08 06:03:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:03:58,631 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-08 06:03:58,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:03:58,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:03:58,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:03:58,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:03:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:03:58,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:03:58,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:03:58,725 INFO L87 Difference]: Start difference. First operand 560 states and 768 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:01,513 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-08 06:04:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 06:04:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-08 06:04:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 06:04:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-08 06:04:01,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-08 06:04:01,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:01,685 INFO L225 Difference]: With dead ends: 781 [2022-04-08 06:04:01,685 INFO L226 Difference]: Without dead ends: 588 [2022-04-08 06:04:01,686 INFO L912 BasicCegarLoop]: 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-08 06:04:01,689 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 144 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:01,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 289 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:04:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-08 06:04:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-08 06:04:02,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:02,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:02,708 INFO L74 IsIncluded]: Start isIncluded. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:02,708 INFO L87 Difference]: Start difference. First operand 588 states. Second operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:02,721 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 06:04:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 06:04:02,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:02,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:02,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 06:04:02,723 INFO L87 Difference]: Start difference. First operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 588 states. [2022-04-08 06:04:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:02,736 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-08 06:04:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-08 06:04:02,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:02,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:02,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:02,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 436 states have (on average 1.2339449541284404) internal successors, (538), 440 states have internal predecessors, (538), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-08 06:04:02,754 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-08 06:04:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:02,754 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-08 06:04:02,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:02,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-08 06:04:05,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 789 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-08 06:04:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-08 06:04:05,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:05,852 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:05,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:06,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 06:04:06,059 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-08 06:04:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1826507535] [2022-04-08 06:04:06,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-08 06:04:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:06,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550810331] [2022-04-08 06:04:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:06,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:06,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514173258] [2022-04-08 06:04:06,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:06,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:06,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:06,075 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:06,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 06:04:06,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:06,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:06,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 06:04:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:06,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:06,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {70177#true} call ULTIMATE.init(); {70177#true} is VALID [2022-04-08 06:04:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {70177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70185#(<= ~counter~0 0)} {70177#true} #102#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {70185#(<= ~counter~0 0)} call #t~ret9 := main(); {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {70185#(<= ~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; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {70185#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {70185#(<= ~counter~0 0)} ~cond := #in~cond; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {70185#(<= ~counter~0 0)} assume !(0 == ~cond); {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70185#(<= ~counter~0 0)} {70185#(<= ~counter~0 0)} #90#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,755 INFO L272 TraceCheckUtils]: 11: Hoare triple {70185#(<= ~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)); {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {70185#(<= ~counter~0 0)} ~cond := #in~cond; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {70185#(<= ~counter~0 0)} assume !(0 == ~cond); {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70185#(<= ~counter~0 0)} {70185#(<= ~counter~0 0)} #92#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {70185#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70185#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:06,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {70185#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {70234#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,759 INFO L272 TraceCheckUtils]: 19: Hoare triple {70234#(<= ~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)); {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(<= ~counter~0 1)} ~cond := #in~cond; {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {70234#(<= ~counter~0 1)} assume !(0 == ~cond); {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {70234#(<= ~counter~0 1)} assume true; {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,761 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70234#(<= ~counter~0 1)} {70234#(<= ~counter~0 1)} #94#return; {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {70234#(<= ~counter~0 1)} assume !!(0 != ~r~0); {70234#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:06,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {70234#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {70259#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,762 INFO L272 TraceCheckUtils]: 27: Hoare triple {70259#(<= ~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)); {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {70259#(<= ~counter~0 2)} ~cond := #in~cond; {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {70259#(<= ~counter~0 2)} assume !(0 == ~cond); {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {70259#(<= ~counter~0 2)} assume true; {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,764 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70259#(<= ~counter~0 2)} {70259#(<= ~counter~0 2)} #96#return; {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {70259#(<= ~counter~0 2)} assume !(~r~0 > 0); {70259#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:06,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {70259#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {70284#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {70284#(<= ~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)); {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {70284#(<= ~counter~0 3)} ~cond := #in~cond; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {70284#(<= ~counter~0 3)} assume !(0 == ~cond); {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {70284#(<= ~counter~0 3)} assume true; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {70284#(<= ~counter~0 3)} {70284#(<= ~counter~0 3)} #98#return; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {70284#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70284#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:06,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {70284#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {70309#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,768 INFO L272 TraceCheckUtils]: 43: Hoare triple {70309#(<= ~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)); {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {70309#(<= ~counter~0 4)} ~cond := #in~cond; {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {70309#(<= ~counter~0 4)} assume !(0 == ~cond); {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {70309#(<= ~counter~0 4)} assume true; {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,770 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {70309#(<= ~counter~0 4)} {70309#(<= ~counter~0 4)} #98#return; {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {70309#(<= ~counter~0 4)} assume !(~r~0 < 0); {70309#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:06,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {70309#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {70334#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,771 INFO L272 TraceCheckUtils]: 51: Hoare triple {70334#(<= ~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)); {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {70334#(<= ~counter~0 5)} ~cond := #in~cond; {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {70334#(<= ~counter~0 5)} assume !(0 == ~cond); {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {70334#(<= ~counter~0 5)} assume true; {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,773 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {70334#(<= ~counter~0 5)} {70334#(<= ~counter~0 5)} #94#return; {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {70334#(<= ~counter~0 5)} assume !!(0 != ~r~0); {70334#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:06,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {70334#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {70359#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,774 INFO L272 TraceCheckUtils]: 59: Hoare triple {70359#(<= ~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)); {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {70359#(<= ~counter~0 6)} ~cond := #in~cond; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {70359#(<= ~counter~0 6)} assume !(0 == ~cond); {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {70359#(<= ~counter~0 6)} assume true; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,776 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {70359#(<= ~counter~0 6)} {70359#(<= ~counter~0 6)} #96#return; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {70359#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70359#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:06,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {70359#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {70384#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,777 INFO L272 TraceCheckUtils]: 67: Hoare triple {70384#(<= ~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)); {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {70384#(<= ~counter~0 7)} ~cond := #in~cond; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {70384#(<= ~counter~0 7)} assume !(0 == ~cond); {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {70384#(<= ~counter~0 7)} assume true; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,779 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70384#(<= ~counter~0 7)} {70384#(<= ~counter~0 7)} #96#return; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,779 INFO L290 TraceCheckUtils]: 72: Hoare triple {70384#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70384#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:06,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {70384#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {70409#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,780 INFO L272 TraceCheckUtils]: 75: Hoare triple {70409#(<= ~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)); {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {70409#(<= ~counter~0 8)} ~cond := #in~cond; {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {70409#(<= ~counter~0 8)} assume !(0 == ~cond); {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {70409#(<= ~counter~0 8)} assume true; {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,782 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {70409#(<= ~counter~0 8)} {70409#(<= ~counter~0 8)} #96#return; {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {70409#(<= ~counter~0 8)} assume !(~r~0 > 0); {70409#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:06,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {70409#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,783 INFO L290 TraceCheckUtils]: 82: Hoare triple {70434#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,783 INFO L272 TraceCheckUtils]: 83: Hoare triple {70434#(<= ~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)); {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {70434#(<= ~counter~0 9)} ~cond := #in~cond; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,784 INFO L290 TraceCheckUtils]: 85: Hoare triple {70434#(<= ~counter~0 9)} assume !(0 == ~cond); {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,784 INFO L290 TraceCheckUtils]: 86: Hoare triple {70434#(<= ~counter~0 9)} assume true; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,785 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70434#(<= ~counter~0 9)} {70434#(<= ~counter~0 9)} #98#return; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {70434#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70434#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:06,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {70434#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,786 INFO L290 TraceCheckUtils]: 90: Hoare triple {70459#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,787 INFO L272 TraceCheckUtils]: 91: Hoare triple {70459#(<= ~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)); {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,787 INFO L290 TraceCheckUtils]: 92: Hoare triple {70459#(<= ~counter~0 10)} ~cond := #in~cond; {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,787 INFO L290 TraceCheckUtils]: 93: Hoare triple {70459#(<= ~counter~0 10)} assume !(0 == ~cond); {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,787 INFO L290 TraceCheckUtils]: 94: Hoare triple {70459#(<= ~counter~0 10)} assume true; {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,788 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70459#(<= ~counter~0 10)} {70459#(<= ~counter~0 10)} #98#return; {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,788 INFO L290 TraceCheckUtils]: 96: Hoare triple {70459#(<= ~counter~0 10)} assume !(~r~0 < 0); {70459#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:06,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {70459#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {70484#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,790 INFO L272 TraceCheckUtils]: 99: Hoare triple {70484#(<= ~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)); {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {70484#(<= ~counter~0 11)} ~cond := #in~cond; {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {70484#(<= ~counter~0 11)} assume !(0 == ~cond); {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,790 INFO L290 TraceCheckUtils]: 102: Hoare triple {70484#(<= ~counter~0 11)} assume true; {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,791 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70484#(<= ~counter~0 11)} {70484#(<= ~counter~0 11)} #94#return; {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {70484#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70484#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 105: Hoare triple {70484#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70509#(<= |main_#t~post7| 11)} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 106: Hoare triple {70509#(<= |main_#t~post7| 11)} assume !(#t~post7 < 100);havoc #t~post7; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 107: Hoare triple {70178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {70178#false} assume !(#t~post8 < 100);havoc #t~post8; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {70178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 110: Hoare triple {70178#false} assume !(#t~post6 < 100);havoc #t~post6; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L272 TraceCheckUtils]: 111: Hoare triple {70178#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 112: Hoare triple {70178#false} ~cond := #in~cond; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 113: Hoare triple {70178#false} assume 0 == ~cond; {70178#false} is VALID [2022-04-08 06:04:06,792 INFO L290 TraceCheckUtils]: 114: Hoare triple {70178#false} assume !false; {70178#false} is VALID [2022-04-08 06:04:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:06,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 114: Hoare triple {70178#false} assume !false; {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 113: Hoare triple {70178#false} assume 0 == ~cond; {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 112: Hoare triple {70178#false} ~cond := #in~cond; {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L272 TraceCheckUtils]: 111: Hoare triple {70178#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 110: Hoare triple {70178#false} assume !(#t~post6 < 100);havoc #t~post6; {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 109: Hoare triple {70178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70178#false} is VALID [2022-04-08 06:04:07,458 INFO L290 TraceCheckUtils]: 108: Hoare triple {70178#false} assume !(#t~post8 < 100);havoc #t~post8; {70178#false} is VALID [2022-04-08 06:04:07,459 INFO L290 TraceCheckUtils]: 107: Hoare triple {70178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70178#false} is VALID [2022-04-08 06:04:07,459 INFO L290 TraceCheckUtils]: 106: Hoare triple {70561#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {70178#false} is VALID [2022-04-08 06:04:07,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {70565#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70561#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:04:07,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {70565#(< ~counter~0 100)} assume !!(0 != ~r~0); {70565#(< ~counter~0 100)} is VALID [2022-04-08 06:04:07,460 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70177#true} {70565#(< ~counter~0 100)} #94#return; {70565#(< ~counter~0 100)} is VALID [2022-04-08 06:04:07,460 INFO L290 TraceCheckUtils]: 102: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,460 INFO L290 TraceCheckUtils]: 101: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,460 INFO L272 TraceCheckUtils]: 99: Hoare triple {70565#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {70565#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {70565#(< ~counter~0 100)} is VALID [2022-04-08 06:04:07,462 INFO L290 TraceCheckUtils]: 97: Hoare triple {70590#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70565#(< ~counter~0 100)} is VALID [2022-04-08 06:04:07,462 INFO L290 TraceCheckUtils]: 96: Hoare triple {70590#(< ~counter~0 99)} assume !(~r~0 < 0); {70590#(< ~counter~0 99)} is VALID [2022-04-08 06:04:07,463 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70177#true} {70590#(< ~counter~0 99)} #98#return; {70590#(< ~counter~0 99)} is VALID [2022-04-08 06:04:07,463 INFO L290 TraceCheckUtils]: 94: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,463 INFO L272 TraceCheckUtils]: 91: Hoare triple {70590#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,463 INFO L290 TraceCheckUtils]: 90: Hoare triple {70590#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {70590#(< ~counter~0 99)} is VALID [2022-04-08 06:04:07,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {70615#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70590#(< ~counter~0 99)} is VALID [2022-04-08 06:04:07,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {70615#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70615#(< ~counter~0 98)} is VALID [2022-04-08 06:04:07,465 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70177#true} {70615#(< ~counter~0 98)} #98#return; {70615#(< ~counter~0 98)} is VALID [2022-04-08 06:04:07,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,465 INFO L272 TraceCheckUtils]: 83: Hoare triple {70615#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,465 INFO L290 TraceCheckUtils]: 82: Hoare triple {70615#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {70615#(< ~counter~0 98)} is VALID [2022-04-08 06:04:07,466 INFO L290 TraceCheckUtils]: 81: Hoare triple {70640#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70615#(< ~counter~0 98)} is VALID [2022-04-08 06:04:07,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {70640#(< ~counter~0 97)} assume !(~r~0 > 0); {70640#(< ~counter~0 97)} is VALID [2022-04-08 06:04:07,467 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {70177#true} {70640#(< ~counter~0 97)} #96#return; {70640#(< ~counter~0 97)} is VALID [2022-04-08 06:04:07,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,467 INFO L290 TraceCheckUtils]: 77: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,467 INFO L272 TraceCheckUtils]: 75: Hoare triple {70640#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,467 INFO L290 TraceCheckUtils]: 74: Hoare triple {70640#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {70640#(< ~counter~0 97)} is VALID [2022-04-08 06:04:07,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {70665#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70640#(< ~counter~0 97)} is VALID [2022-04-08 06:04:07,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {70665#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70665#(< ~counter~0 96)} is VALID [2022-04-08 06:04:07,469 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70177#true} {70665#(< ~counter~0 96)} #96#return; {70665#(< ~counter~0 96)} is VALID [2022-04-08 06:04:07,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,469 INFO L290 TraceCheckUtils]: 69: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,469 INFO L290 TraceCheckUtils]: 68: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,469 INFO L272 TraceCheckUtils]: 67: Hoare triple {70665#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,469 INFO L290 TraceCheckUtils]: 66: Hoare triple {70665#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {70665#(< ~counter~0 96)} is VALID [2022-04-08 06:04:07,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {70690#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70665#(< ~counter~0 96)} is VALID [2022-04-08 06:04:07,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {70690#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70690#(< ~counter~0 95)} is VALID [2022-04-08 06:04:07,471 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {70177#true} {70690#(< ~counter~0 95)} #96#return; {70690#(< ~counter~0 95)} is VALID [2022-04-08 06:04:07,471 INFO L290 TraceCheckUtils]: 62: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,471 INFO L272 TraceCheckUtils]: 59: Hoare triple {70690#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {70690#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {70690#(< ~counter~0 95)} is VALID [2022-04-08 06:04:07,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {70715#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70690#(< ~counter~0 95)} is VALID [2022-04-08 06:04:07,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {70715#(< ~counter~0 94)} assume !!(0 != ~r~0); {70715#(< ~counter~0 94)} is VALID [2022-04-08 06:04:07,473 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {70177#true} {70715#(< ~counter~0 94)} #94#return; {70715#(< ~counter~0 94)} is VALID [2022-04-08 06:04:07,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,473 INFO L272 TraceCheckUtils]: 51: Hoare triple {70715#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {70715#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {70715#(< ~counter~0 94)} is VALID [2022-04-08 06:04:07,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {70740#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70715#(< ~counter~0 94)} is VALID [2022-04-08 06:04:07,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {70740#(< ~counter~0 93)} assume !(~r~0 < 0); {70740#(< ~counter~0 93)} is VALID [2022-04-08 06:04:07,475 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {70177#true} {70740#(< ~counter~0 93)} #98#return; {70740#(< ~counter~0 93)} is VALID [2022-04-08 06:04:07,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,475 INFO L272 TraceCheckUtils]: 43: Hoare triple {70740#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {70740#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {70740#(< ~counter~0 93)} is VALID [2022-04-08 06:04:07,476 INFO L290 TraceCheckUtils]: 41: Hoare triple {70765#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70740#(< ~counter~0 93)} is VALID [2022-04-08 06:04:07,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {70765#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70765#(< ~counter~0 92)} is VALID [2022-04-08 06:04:07,477 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {70177#true} {70765#(< ~counter~0 92)} #98#return; {70765#(< ~counter~0 92)} is VALID [2022-04-08 06:04:07,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,477 INFO L272 TraceCheckUtils]: 35: Hoare triple {70765#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {70765#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {70765#(< ~counter~0 92)} is VALID [2022-04-08 06:04:07,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {70790#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70765#(< ~counter~0 92)} is VALID [2022-04-08 06:04:07,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {70790#(< ~counter~0 91)} assume !(~r~0 > 0); {70790#(< ~counter~0 91)} is VALID [2022-04-08 06:04:07,479 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70177#true} {70790#(< ~counter~0 91)} #96#return; {70790#(< ~counter~0 91)} is VALID [2022-04-08 06:04:07,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,479 INFO L272 TraceCheckUtils]: 27: Hoare triple {70790#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {70790#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {70790#(< ~counter~0 91)} is VALID [2022-04-08 06:04:07,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {70815#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70790#(< ~counter~0 91)} is VALID [2022-04-08 06:04:07,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {70815#(< ~counter~0 90)} assume !!(0 != ~r~0); {70815#(< ~counter~0 90)} is VALID [2022-04-08 06:04:07,481 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70177#true} {70815#(< ~counter~0 90)} #94#return; {70815#(< ~counter~0 90)} is VALID [2022-04-08 06:04:07,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,481 INFO L272 TraceCheckUtils]: 19: Hoare triple {70815#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {70815#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {70815#(< ~counter~0 90)} is VALID [2022-04-08 06:04:07,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {70840#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70815#(< ~counter~0 90)} is VALID [2022-04-08 06:04:07,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {70840#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,483 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70177#true} {70840#(< ~counter~0 89)} #92#return; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L272 TraceCheckUtils]: 11: Hoare triple {70840#(< ~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)); {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70177#true} {70840#(< ~counter~0 89)} #90#return; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-08 06:04:07,483 INFO L272 TraceCheckUtils]: 6: Hoare triple {70840#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {70177#true} is VALID [2022-04-08 06:04:07,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {70840#(< ~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; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {70840#(< ~counter~0 89)} call #t~ret9 := main(); {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70840#(< ~counter~0 89)} {70177#true} #102#return; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {70840#(< ~counter~0 89)} assume true; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {70177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {70840#(< ~counter~0 89)} is VALID [2022-04-08 06:04:07,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {70177#true} call ULTIMATE.init(); {70177#true} is VALID [2022-04-08 06:04:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-08 06:04:07,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:07,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550810331] [2022-04-08 06:04:07,486 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:07,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514173258] [2022-04-08 06:04:07,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514173258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:07,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:07,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-08 06:04:07,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:07,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1826507535] [2022-04-08 06:04:07,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1826507535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:07,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:07,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 06:04:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6027746] [2022-04-08 06:04:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:07,487 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-08 06:04:07,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:07,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:07,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:07,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 06:04:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:07,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 06:04:07,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-08 06:04:07,575 INFO L87 Difference]: Start difference. First operand 578 states and 790 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:10,021 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-08 06:04:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 06:04:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-08 06:04:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 06:04:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-08 06:04:10,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-08 06:04:10,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:10,264 INFO L225 Difference]: With dead ends: 791 [2022-04-08 06:04:10,265 INFO L226 Difference]: Without dead ends: 594 [2022-04-08 06:04:10,265 INFO L912 BasicCegarLoop]: 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-08 06:04:10,266 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 160 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:10,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 256 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-08 06:04:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-08 06:04:11,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:11,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:11,671 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:11,671 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:11,685 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 06:04:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:04:11,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:11,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:11,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 06:04:11,687 INFO L87 Difference]: Start difference. First operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 594 states. [2022-04-08 06:04:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:11,700 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-08 06:04:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:04:11,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:11,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:11,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:11,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 127 states have call successors, (127), 16 states have call predecessors, (127), 14 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-08 06:04:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-08 06:04:11,719 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-08 06:04:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:11,719 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-08 06:04:11,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-08 06:04:11,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-08 06:04:14,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 806 edges. 806 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-08 06:04:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 06:04:14,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:14,597 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-08 06:04:14,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 06:04:14,797 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-08 06:04:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:14,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266959741] [2022-04-08 06:04:14,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-08 06:04:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:14,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828750111] [2022-04-08 06:04:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:14,810 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:14,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710838862] [2022-04-08 06:04:14,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:14,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:14,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:14,811 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:14,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 06:04:14,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:14,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:14,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:04:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:14,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:15,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {74872#true} call ULTIMATE.init(); {74872#true} is VALID [2022-04-08 06:04:15,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {74872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74880#(<= ~counter~0 0)} {74872#true} #102#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {74880#(<= ~counter~0 0)} call #t~ret9 := main(); {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {74880#(<= ~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; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {74880#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {74880#(<= ~counter~0 0)} ~cond := #in~cond; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {74880#(<= ~counter~0 0)} assume !(0 == ~cond); {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74880#(<= ~counter~0 0)} {74880#(<= ~counter~0 0)} #90#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {74880#(<= ~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)); {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {74880#(<= ~counter~0 0)} ~cond := #in~cond; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {74880#(<= ~counter~0 0)} assume !(0 == ~cond); {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,487 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74880#(<= ~counter~0 0)} {74880#(<= ~counter~0 0)} #92#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {74880#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74880#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:15,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {74880#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {74929#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,490 INFO L272 TraceCheckUtils]: 19: Hoare triple {74929#(<= ~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)); {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {74929#(<= ~counter~0 1)} ~cond := #in~cond; {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {74929#(<= ~counter~0 1)} assume !(0 == ~cond); {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {74929#(<= ~counter~0 1)} assume true; {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,491 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74929#(<= ~counter~0 1)} {74929#(<= ~counter~0 1)} #94#return; {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {74929#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74929#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:15,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {74929#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {74954#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,493 INFO L272 TraceCheckUtils]: 27: Hoare triple {74954#(<= ~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)); {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {74954#(<= ~counter~0 2)} ~cond := #in~cond; {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {74954#(<= ~counter~0 2)} assume !(0 == ~cond); {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {74954#(<= ~counter~0 2)} assume true; {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,494 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74954#(<= ~counter~0 2)} {74954#(<= ~counter~0 2)} #96#return; {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {74954#(<= ~counter~0 2)} assume !(~r~0 > 0); {74954#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:15,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {74954#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {74979#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,496 INFO L272 TraceCheckUtils]: 35: Hoare triple {74979#(<= ~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)); {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {74979#(<= ~counter~0 3)} ~cond := #in~cond; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {74979#(<= ~counter~0 3)} assume !(0 == ~cond); {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {74979#(<= ~counter~0 3)} assume true; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,497 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74979#(<= ~counter~0 3)} {74979#(<= ~counter~0 3)} #98#return; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {74979#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {74979#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:15,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {74979#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {75004#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,499 INFO L272 TraceCheckUtils]: 43: Hoare triple {75004#(<= ~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)); {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {75004#(<= ~counter~0 4)} ~cond := #in~cond; {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {75004#(<= ~counter~0 4)} assume !(0 == ~cond); {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {75004#(<= ~counter~0 4)} assume true; {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,500 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75004#(<= ~counter~0 4)} {75004#(<= ~counter~0 4)} #98#return; {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {75004#(<= ~counter~0 4)} assume !(~r~0 < 0); {75004#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:15,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {75004#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {75029#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,502 INFO L272 TraceCheckUtils]: 51: Hoare triple {75029#(<= ~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)); {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {75029#(<= ~counter~0 5)} ~cond := #in~cond; {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,502 INFO L290 TraceCheckUtils]: 53: Hoare triple {75029#(<= ~counter~0 5)} assume !(0 == ~cond); {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {75029#(<= ~counter~0 5)} assume true; {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,503 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75029#(<= ~counter~0 5)} {75029#(<= ~counter~0 5)} #94#return; {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {75029#(<= ~counter~0 5)} assume !!(0 != ~r~0); {75029#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:15,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {75029#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {75054#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,505 INFO L272 TraceCheckUtils]: 59: Hoare triple {75054#(<= ~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)); {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {75054#(<= ~counter~0 6)} ~cond := #in~cond; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {75054#(<= ~counter~0 6)} assume !(0 == ~cond); {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {75054#(<= ~counter~0 6)} assume true; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,506 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75054#(<= ~counter~0 6)} {75054#(<= ~counter~0 6)} #96#return; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {75054#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75054#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:15,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {75054#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {75079#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,508 INFO L272 TraceCheckUtils]: 67: Hoare triple {75079#(<= ~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)); {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {75079#(<= ~counter~0 7)} ~cond := #in~cond; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {75079#(<= ~counter~0 7)} assume !(0 == ~cond); {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {75079#(<= ~counter~0 7)} assume true; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,509 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75079#(<= ~counter~0 7)} {75079#(<= ~counter~0 7)} #96#return; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {75079#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75079#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:15,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {75079#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,510 INFO L290 TraceCheckUtils]: 74: Hoare triple {75104#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,511 INFO L272 TraceCheckUtils]: 75: Hoare triple {75104#(<= ~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)); {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,511 INFO L290 TraceCheckUtils]: 76: Hoare triple {75104#(<= ~counter~0 8)} ~cond := #in~cond; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,511 INFO L290 TraceCheckUtils]: 77: Hoare triple {75104#(<= ~counter~0 8)} assume !(0 == ~cond); {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {75104#(<= ~counter~0 8)} assume true; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,512 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75104#(<= ~counter~0 8)} {75104#(<= ~counter~0 8)} #96#return; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,512 INFO L290 TraceCheckUtils]: 80: Hoare triple {75104#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75104#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:15,513 INFO L290 TraceCheckUtils]: 81: Hoare triple {75104#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,513 INFO L290 TraceCheckUtils]: 82: Hoare triple {75129#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,514 INFO L272 TraceCheckUtils]: 83: Hoare triple {75129#(<= ~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)); {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {75129#(<= ~counter~0 9)} ~cond := #in~cond; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {75129#(<= ~counter~0 9)} assume !(0 == ~cond); {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,515 INFO L290 TraceCheckUtils]: 86: Hoare triple {75129#(<= ~counter~0 9)} assume true; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,515 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75129#(<= ~counter~0 9)} {75129#(<= ~counter~0 9)} #96#return; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,515 INFO L290 TraceCheckUtils]: 88: Hoare triple {75129#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75129#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:15,516 INFO L290 TraceCheckUtils]: 89: Hoare triple {75129#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {75154#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,517 INFO L272 TraceCheckUtils]: 91: Hoare triple {75154#(<= ~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)); {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,517 INFO L290 TraceCheckUtils]: 92: Hoare triple {75154#(<= ~counter~0 10)} ~cond := #in~cond; {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {75154#(<= ~counter~0 10)} assume !(0 == ~cond); {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {75154#(<= ~counter~0 10)} assume true; {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,518 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75154#(<= ~counter~0 10)} {75154#(<= ~counter~0 10)} #96#return; {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {75154#(<= ~counter~0 10)} assume !(~r~0 > 0); {75154#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:15,519 INFO L290 TraceCheckUtils]: 97: Hoare triple {75154#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,520 INFO L290 TraceCheckUtils]: 98: Hoare triple {75179#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,520 INFO L272 TraceCheckUtils]: 99: Hoare triple {75179#(<= ~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)); {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,520 INFO L290 TraceCheckUtils]: 100: Hoare triple {75179#(<= ~counter~0 11)} ~cond := #in~cond; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,521 INFO L290 TraceCheckUtils]: 101: Hoare triple {75179#(<= ~counter~0 11)} assume !(0 == ~cond); {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,521 INFO L290 TraceCheckUtils]: 102: Hoare triple {75179#(<= ~counter~0 11)} assume true; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,521 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75179#(<= ~counter~0 11)} {75179#(<= ~counter~0 11)} #98#return; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,522 INFO L290 TraceCheckUtils]: 104: Hoare triple {75179#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75179#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:15,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {75179#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {75204#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,523 INFO L272 TraceCheckUtils]: 107: Hoare triple {75204#(<= ~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)); {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {75204#(<= ~counter~0 12)} ~cond := #in~cond; {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,524 INFO L290 TraceCheckUtils]: 109: Hoare triple {75204#(<= ~counter~0 12)} assume !(0 == ~cond); {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {75204#(<= ~counter~0 12)} assume true; {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,524 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {75204#(<= ~counter~0 12)} {75204#(<= ~counter~0 12)} #98#return; {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,525 INFO L290 TraceCheckUtils]: 112: Hoare triple {75204#(<= ~counter~0 12)} assume !(~r~0 < 0); {75204#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:15,525 INFO L290 TraceCheckUtils]: 113: Hoare triple {75204#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75229#(<= |main_#t~post6| 12)} is VALID [2022-04-08 06:04:15,525 INFO L290 TraceCheckUtils]: 114: Hoare triple {75229#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {74873#false} is VALID [2022-04-08 06:04:15,525 INFO L272 TraceCheckUtils]: 115: Hoare triple {74873#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74873#false} is VALID [2022-04-08 06:04:15,525 INFO L290 TraceCheckUtils]: 116: Hoare triple {74873#false} ~cond := #in~cond; {74873#false} is VALID [2022-04-08 06:04:15,526 INFO L290 TraceCheckUtils]: 117: Hoare triple {74873#false} assume 0 == ~cond; {74873#false} is VALID [2022-04-08 06:04:15,526 INFO L290 TraceCheckUtils]: 118: Hoare triple {74873#false} assume !false; {74873#false} is VALID [2022-04-08 06:04:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:15,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:16,136 INFO L290 TraceCheckUtils]: 118: Hoare triple {74873#false} assume !false; {74873#false} is VALID [2022-04-08 06:04:16,136 INFO L290 TraceCheckUtils]: 117: Hoare triple {74873#false} assume 0 == ~cond; {74873#false} is VALID [2022-04-08 06:04:16,136 INFO L290 TraceCheckUtils]: 116: Hoare triple {74873#false} ~cond := #in~cond; {74873#false} is VALID [2022-04-08 06:04:16,136 INFO L272 TraceCheckUtils]: 115: Hoare triple {74873#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74873#false} is VALID [2022-04-08 06:04:16,137 INFO L290 TraceCheckUtils]: 114: Hoare triple {75257#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {74873#false} is VALID [2022-04-08 06:04:16,137 INFO L290 TraceCheckUtils]: 113: Hoare triple {75261#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75257#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:04:16,137 INFO L290 TraceCheckUtils]: 112: Hoare triple {75261#(< ~counter~0 100)} assume !(~r~0 < 0); {75261#(< ~counter~0 100)} is VALID [2022-04-08 06:04:16,137 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74872#true} {75261#(< ~counter~0 100)} #98#return; {75261#(< ~counter~0 100)} is VALID [2022-04-08 06:04:16,138 INFO L290 TraceCheckUtils]: 110: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,138 INFO L290 TraceCheckUtils]: 109: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,138 INFO L290 TraceCheckUtils]: 108: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,138 INFO L272 TraceCheckUtils]: 107: Hoare triple {75261#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,138 INFO L290 TraceCheckUtils]: 106: Hoare triple {75261#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {75261#(< ~counter~0 100)} is VALID [2022-04-08 06:04:16,139 INFO L290 TraceCheckUtils]: 105: Hoare triple {75286#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75261#(< ~counter~0 100)} is VALID [2022-04-08 06:04:16,140 INFO L290 TraceCheckUtils]: 104: Hoare triple {75286#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75286#(< ~counter~0 99)} is VALID [2022-04-08 06:04:16,140 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74872#true} {75286#(< ~counter~0 99)} #98#return; {75286#(< ~counter~0 99)} is VALID [2022-04-08 06:04:16,140 INFO L290 TraceCheckUtils]: 102: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,140 INFO L290 TraceCheckUtils]: 101: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,140 INFO L290 TraceCheckUtils]: 100: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,140 INFO L272 TraceCheckUtils]: 99: Hoare triple {75286#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,140 INFO L290 TraceCheckUtils]: 98: Hoare triple {75286#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {75286#(< ~counter~0 99)} is VALID [2022-04-08 06:04:16,141 INFO L290 TraceCheckUtils]: 97: Hoare triple {75311#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75286#(< ~counter~0 99)} is VALID [2022-04-08 06:04:16,141 INFO L290 TraceCheckUtils]: 96: Hoare triple {75311#(< ~counter~0 98)} assume !(~r~0 > 0); {75311#(< ~counter~0 98)} is VALID [2022-04-08 06:04:16,141 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74872#true} {75311#(< ~counter~0 98)} #96#return; {75311#(< ~counter~0 98)} is VALID [2022-04-08 06:04:16,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,142 INFO L272 TraceCheckUtils]: 91: Hoare triple {75311#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {75311#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {75311#(< ~counter~0 98)} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {75336#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75311#(< ~counter~0 98)} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {75336#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75336#(< ~counter~0 97)} is VALID [2022-04-08 06:04:16,143 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74872#true} {75336#(< ~counter~0 97)} #96#return; {75336#(< ~counter~0 97)} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 86: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 85: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,143 INFO L272 TraceCheckUtils]: 83: Hoare triple {75336#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {75336#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {75336#(< ~counter~0 97)} is VALID [2022-04-08 06:04:16,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {75361#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75336#(< ~counter~0 97)} is VALID [2022-04-08 06:04:16,144 INFO L290 TraceCheckUtils]: 80: Hoare triple {75361#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75361#(< ~counter~0 96)} is VALID [2022-04-08 06:04:16,145 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74872#true} {75361#(< ~counter~0 96)} #96#return; {75361#(< ~counter~0 96)} is VALID [2022-04-08 06:04:16,145 INFO L290 TraceCheckUtils]: 78: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,145 INFO L290 TraceCheckUtils]: 77: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,145 INFO L272 TraceCheckUtils]: 75: Hoare triple {75361#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {75361#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {75361#(< ~counter~0 96)} is VALID [2022-04-08 06:04:16,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {75386#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75361#(< ~counter~0 96)} is VALID [2022-04-08 06:04:16,146 INFO L290 TraceCheckUtils]: 72: Hoare triple {75386#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75386#(< ~counter~0 95)} is VALID [2022-04-08 06:04:16,146 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74872#true} {75386#(< ~counter~0 95)} #96#return; {75386#(< ~counter~0 95)} is VALID [2022-04-08 06:04:16,146 INFO L290 TraceCheckUtils]: 70: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,146 INFO L290 TraceCheckUtils]: 68: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,146 INFO L272 TraceCheckUtils]: 67: Hoare triple {75386#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {75386#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {75386#(< ~counter~0 95)} is VALID [2022-04-08 06:04:16,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {75411#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75386#(< ~counter~0 95)} is VALID [2022-04-08 06:04:16,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {75411#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75411#(< ~counter~0 94)} is VALID [2022-04-08 06:04:16,148 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74872#true} {75411#(< ~counter~0 94)} #96#return; {75411#(< ~counter~0 94)} is VALID [2022-04-08 06:04:16,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,148 INFO L272 TraceCheckUtils]: 59: Hoare triple {75411#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {75411#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {75411#(< ~counter~0 94)} is VALID [2022-04-08 06:04:16,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {75436#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75411#(< ~counter~0 94)} is VALID [2022-04-08 06:04:16,149 INFO L290 TraceCheckUtils]: 56: Hoare triple {75436#(< ~counter~0 93)} assume !!(0 != ~r~0); {75436#(< ~counter~0 93)} is VALID [2022-04-08 06:04:16,149 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74872#true} {75436#(< ~counter~0 93)} #94#return; {75436#(< ~counter~0 93)} is VALID [2022-04-08 06:04:16,149 INFO L290 TraceCheckUtils]: 54: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,149 INFO L272 TraceCheckUtils]: 51: Hoare triple {75436#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,150 INFO L290 TraceCheckUtils]: 50: Hoare triple {75436#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {75436#(< ~counter~0 93)} is VALID [2022-04-08 06:04:16,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {75461#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75436#(< ~counter~0 93)} is VALID [2022-04-08 06:04:16,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {75461#(< ~counter~0 92)} assume !(~r~0 < 0); {75461#(< ~counter~0 92)} is VALID [2022-04-08 06:04:16,151 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74872#true} {75461#(< ~counter~0 92)} #98#return; {75461#(< ~counter~0 92)} is VALID [2022-04-08 06:04:16,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,151 INFO L272 TraceCheckUtils]: 43: Hoare triple {75461#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {75461#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {75461#(< ~counter~0 92)} is VALID [2022-04-08 06:04:16,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {75486#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75461#(< ~counter~0 92)} is VALID [2022-04-08 06:04:16,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {75486#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75486#(< ~counter~0 91)} is VALID [2022-04-08 06:04:16,152 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74872#true} {75486#(< ~counter~0 91)} #98#return; {75486#(< ~counter~0 91)} is VALID [2022-04-08 06:04:16,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,153 INFO L272 TraceCheckUtils]: 35: Hoare triple {75486#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {75486#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {75486#(< ~counter~0 91)} is VALID [2022-04-08 06:04:16,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {75511#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75486#(< ~counter~0 91)} is VALID [2022-04-08 06:04:16,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {75511#(< ~counter~0 90)} assume !(~r~0 > 0); {75511#(< ~counter~0 90)} is VALID [2022-04-08 06:04:16,154 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74872#true} {75511#(< ~counter~0 90)} #96#return; {75511#(< ~counter~0 90)} is VALID [2022-04-08 06:04:16,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,154 INFO L272 TraceCheckUtils]: 27: Hoare triple {75511#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {75511#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {75511#(< ~counter~0 90)} is VALID [2022-04-08 06:04:16,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {75536#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75511#(< ~counter~0 90)} is VALID [2022-04-08 06:04:16,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {75536#(< ~counter~0 89)} assume !!(0 != ~r~0); {75536#(< ~counter~0 89)} is VALID [2022-04-08 06:04:16,155 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74872#true} {75536#(< ~counter~0 89)} #94#return; {75536#(< ~counter~0 89)} is VALID [2022-04-08 06:04:16,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {75536#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {75536#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {75536#(< ~counter~0 89)} is VALID [2022-04-08 06:04:16,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {75561#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75536#(< ~counter~0 89)} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {75561#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,157 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74872#true} {75561#(< ~counter~0 88)} #92#return; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {75561#(< ~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)); {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74872#true} {75561#(< ~counter~0 88)} #90#return; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-08 06:04:16,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-08 06:04:16,158 INFO L272 TraceCheckUtils]: 6: Hoare triple {75561#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74872#true} is VALID [2022-04-08 06:04:16,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {75561#(< ~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; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {75561#(< ~counter~0 88)} call #t~ret9 := main(); {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75561#(< ~counter~0 88)} {74872#true} #102#return; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {75561#(< ~counter~0 88)} assume true; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {74872#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {75561#(< ~counter~0 88)} is VALID [2022-04-08 06:04:16,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {74872#true} call ULTIMATE.init(); {74872#true} is VALID [2022-04-08 06:04:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 06:04:16,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828750111] [2022-04-08 06:04:16,159 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710838862] [2022-04-08 06:04:16,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710838862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:16,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:16,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:04:16,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:16,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266959741] [2022-04-08 06:04:16,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266959741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:16,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:16,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:04:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955744156] [2022-04-08 06:04:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-08 06:04:16,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:16,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:16,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:16,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:04:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:04:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:04:16,226 INFO L87 Difference]: Start difference. First operand 594 states and 806 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:18,419 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-08 06:04:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 06:04:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-08 06:04:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 06:04:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-08 06:04:18,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-08 06:04:18,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:18,577 INFO L225 Difference]: With dead ends: 649 [2022-04-08 06:04:18,577 INFO L226 Difference]: Without dead ends: 638 [2022-04-08 06:04:18,577 INFO L912 BasicCegarLoop]: 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-08 06:04:18,578 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 227 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:18,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 268 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-08 06:04:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-08 06:04:19,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:19,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:19,616 INFO L74 IsIncluded]: Start isIncluded. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:19,616 INFO L87 Difference]: Start difference. First operand 638 states. Second operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:19,631 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 06:04:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 06:04:19,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:19,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:19,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 06:04:19,632 INFO L87 Difference]: Start difference. First operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 638 states. [2022-04-08 06:04:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:19,654 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-08 06:04:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-08 06:04:19,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:19,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:19,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:19,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 460 states have (on average 1.2239130434782608) internal successors, (563), 470 states have internal predecessors, (563), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-08 06:04:19,674 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-08 06:04:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:19,674 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-08 06:04:19,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:19,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-08 06:04:21,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 841 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-08 06:04:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-08 06:04:21,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:21,832 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:21,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-08 06:04:22,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 06:04:22,033 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-08 06:04:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:22,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573009747] [2022-04-08 06:04:22,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-08 06:04:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:22,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227936071] [2022-04-08 06:04:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:22,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:22,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378218985] [2022-04-08 06:04:22,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:04:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:22,062 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:22,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 06:04:22,631 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 06:04:22,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:04:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:22,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:23,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {79439#true} call ULTIMATE.init(); {79439#true} is VALID [2022-04-08 06:04:23,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {79439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79447#(<= ~counter~0 0)} {79439#true} #102#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {79447#(<= ~counter~0 0)} call #t~ret9 := main(); {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {79447#(<= ~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; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {79447#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {79447#(<= ~counter~0 0)} ~cond := #in~cond; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {79447#(<= ~counter~0 0)} assume !(0 == ~cond); {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79447#(<= ~counter~0 0)} {79447#(<= ~counter~0 0)} #90#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L272 TraceCheckUtils]: 11: Hoare triple {79447#(<= ~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)); {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {79447#(<= ~counter~0 0)} ~cond := #in~cond; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {79447#(<= ~counter~0 0)} assume !(0 == ~cond); {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79447#(<= ~counter~0 0)} {79447#(<= ~counter~0 0)} #92#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {79447#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79447#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:23,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {79447#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {79496#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,241 INFO L272 TraceCheckUtils]: 19: Hoare triple {79496#(<= ~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)); {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {79496#(<= ~counter~0 1)} ~cond := #in~cond; {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {79496#(<= ~counter~0 1)} assume !(0 == ~cond); {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {79496#(<= ~counter~0 1)} assume true; {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,241 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79496#(<= ~counter~0 1)} {79496#(<= ~counter~0 1)} #94#return; {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {79496#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79496#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:23,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {79496#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {79521#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,243 INFO L272 TraceCheckUtils]: 27: Hoare triple {79521#(<= ~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)); {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {79521#(<= ~counter~0 2)} ~cond := #in~cond; {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {79521#(<= ~counter~0 2)} assume !(0 == ~cond); {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {79521#(<= ~counter~0 2)} assume true; {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,244 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79521#(<= ~counter~0 2)} {79521#(<= ~counter~0 2)} #96#return; {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {79521#(<= ~counter~0 2)} assume !(~r~0 > 0); {79521#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:23,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {79521#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {79546#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,245 INFO L272 TraceCheckUtils]: 35: Hoare triple {79546#(<= ~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)); {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {79546#(<= ~counter~0 3)} ~cond := #in~cond; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {79546#(<= ~counter~0 3)} assume !(0 == ~cond); {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {79546#(<= ~counter~0 3)} assume true; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,246 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79546#(<= ~counter~0 3)} {79546#(<= ~counter~0 3)} #98#return; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {79546#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79546#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:23,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {79546#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {79571#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,247 INFO L272 TraceCheckUtils]: 43: Hoare triple {79571#(<= ~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)); {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {79571#(<= ~counter~0 4)} ~cond := #in~cond; {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {79571#(<= ~counter~0 4)} assume !(0 == ~cond); {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {79571#(<= ~counter~0 4)} assume true; {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,248 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79571#(<= ~counter~0 4)} {79571#(<= ~counter~0 4)} #98#return; {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {79571#(<= ~counter~0 4)} assume !(~r~0 < 0); {79571#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:23,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {79571#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {79596#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,249 INFO L272 TraceCheckUtils]: 51: Hoare triple {79596#(<= ~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)); {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {79596#(<= ~counter~0 5)} ~cond := #in~cond; {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {79596#(<= ~counter~0 5)} assume !(0 == ~cond); {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {79596#(<= ~counter~0 5)} assume true; {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,250 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79596#(<= ~counter~0 5)} {79596#(<= ~counter~0 5)} #94#return; {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {79596#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79596#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:23,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {79596#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {79621#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,251 INFO L272 TraceCheckUtils]: 59: Hoare triple {79621#(<= ~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)); {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {79621#(<= ~counter~0 6)} ~cond := #in~cond; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,251 INFO L290 TraceCheckUtils]: 61: Hoare triple {79621#(<= ~counter~0 6)} assume !(0 == ~cond); {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {79621#(<= ~counter~0 6)} assume true; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,252 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79621#(<= ~counter~0 6)} {79621#(<= ~counter~0 6)} #96#return; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {79621#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79621#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:23,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {79621#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {79646#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,253 INFO L272 TraceCheckUtils]: 67: Hoare triple {79646#(<= ~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)); {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {79646#(<= ~counter~0 7)} ~cond := #in~cond; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {79646#(<= ~counter~0 7)} assume !(0 == ~cond); {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {79646#(<= ~counter~0 7)} assume true; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,254 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79646#(<= ~counter~0 7)} {79646#(<= ~counter~0 7)} #96#return; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {79646#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79646#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:23,255 INFO L290 TraceCheckUtils]: 73: Hoare triple {79646#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,255 INFO L290 TraceCheckUtils]: 74: Hoare triple {79671#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,255 INFO L272 TraceCheckUtils]: 75: Hoare triple {79671#(<= ~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)); {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,255 INFO L290 TraceCheckUtils]: 76: Hoare triple {79671#(<= ~counter~0 8)} ~cond := #in~cond; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,255 INFO L290 TraceCheckUtils]: 77: Hoare triple {79671#(<= ~counter~0 8)} assume !(0 == ~cond); {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {79671#(<= ~counter~0 8)} assume true; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,256 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79671#(<= ~counter~0 8)} {79671#(<= ~counter~0 8)} #96#return; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,256 INFO L290 TraceCheckUtils]: 80: Hoare triple {79671#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79671#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:23,257 INFO L290 TraceCheckUtils]: 81: Hoare triple {79671#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {79696#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,257 INFO L272 TraceCheckUtils]: 83: Hoare triple {79696#(<= ~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)); {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {79696#(<= ~counter~0 9)} ~cond := #in~cond; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {79696#(<= ~counter~0 9)} assume !(0 == ~cond); {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {79696#(<= ~counter~0 9)} assume true; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,258 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79696#(<= ~counter~0 9)} {79696#(<= ~counter~0 9)} #96#return; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {79696#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79696#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:23,259 INFO L290 TraceCheckUtils]: 89: Hoare triple {79696#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {79721#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,259 INFO L272 TraceCheckUtils]: 91: Hoare triple {79721#(<= ~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)); {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,259 INFO L290 TraceCheckUtils]: 92: Hoare triple {79721#(<= ~counter~0 10)} ~cond := #in~cond; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,260 INFO L290 TraceCheckUtils]: 93: Hoare triple {79721#(<= ~counter~0 10)} assume !(0 == ~cond); {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,260 INFO L290 TraceCheckUtils]: 94: Hoare triple {79721#(<= ~counter~0 10)} assume true; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,260 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79721#(<= ~counter~0 10)} {79721#(<= ~counter~0 10)} #96#return; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,260 INFO L290 TraceCheckUtils]: 96: Hoare triple {79721#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79721#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:23,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {79721#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {79746#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,261 INFO L272 TraceCheckUtils]: 99: Hoare triple {79746#(<= ~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)); {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {79746#(<= ~counter~0 11)} ~cond := #in~cond; {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {79746#(<= ~counter~0 11)} assume !(0 == ~cond); {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {79746#(<= ~counter~0 11)} assume true; {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,262 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79746#(<= ~counter~0 11)} {79746#(<= ~counter~0 11)} #96#return; {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {79746#(<= ~counter~0 11)} assume !(~r~0 > 0); {79746#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:23,263 INFO L290 TraceCheckUtils]: 105: Hoare triple {79746#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,263 INFO L290 TraceCheckUtils]: 106: Hoare triple {79771#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,263 INFO L272 TraceCheckUtils]: 107: Hoare triple {79771#(<= ~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)); {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,263 INFO L290 TraceCheckUtils]: 108: Hoare triple {79771#(<= ~counter~0 12)} ~cond := #in~cond; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {79771#(<= ~counter~0 12)} assume !(0 == ~cond); {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,264 INFO L290 TraceCheckUtils]: 110: Hoare triple {79771#(<= ~counter~0 12)} assume true; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,264 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79771#(<= ~counter~0 12)} {79771#(<= ~counter~0 12)} #98#return; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {79771#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79771#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:23,264 INFO L290 TraceCheckUtils]: 113: Hoare triple {79771#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79796#(<= |main_#t~post8| 12)} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 114: Hoare triple {79796#(<= |main_#t~post8| 12)} assume !(#t~post8 < 100);havoc #t~post8; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 115: Hoare triple {79440#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 116: Hoare triple {79440#false} assume !(#t~post6 < 100);havoc #t~post6; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L272 TraceCheckUtils]: 117: Hoare triple {79440#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 118: Hoare triple {79440#false} ~cond := #in~cond; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 119: Hoare triple {79440#false} assume 0 == ~cond; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L290 TraceCheckUtils]: 120: Hoare triple {79440#false} assume !false; {79440#false} is VALID [2022-04-08 06:04:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:23,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:23,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {79440#false} assume !false; {79440#false} is VALID [2022-04-08 06:04:23,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {79440#false} assume 0 == ~cond; {79440#false} is VALID [2022-04-08 06:04:23,784 INFO L290 TraceCheckUtils]: 118: Hoare triple {79440#false} ~cond := #in~cond; {79440#false} is VALID [2022-04-08 06:04:23,784 INFO L272 TraceCheckUtils]: 117: Hoare triple {79440#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79440#false} is VALID [2022-04-08 06:04:23,784 INFO L290 TraceCheckUtils]: 116: Hoare triple {79440#false} assume !(#t~post6 < 100);havoc #t~post6; {79440#false} is VALID [2022-04-08 06:04:23,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {79440#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79440#false} is VALID [2022-04-08 06:04:23,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {79836#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {79440#false} is VALID [2022-04-08 06:04:23,785 INFO L290 TraceCheckUtils]: 113: Hoare triple {79840#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79836#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:04:23,785 INFO L290 TraceCheckUtils]: 112: Hoare triple {79840#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79840#(< ~counter~0 100)} is VALID [2022-04-08 06:04:23,786 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79439#true} {79840#(< ~counter~0 100)} #98#return; {79840#(< ~counter~0 100)} is VALID [2022-04-08 06:04:23,786 INFO L290 TraceCheckUtils]: 110: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,786 INFO L290 TraceCheckUtils]: 109: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,786 INFO L290 TraceCheckUtils]: 108: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,786 INFO L272 TraceCheckUtils]: 107: Hoare triple {79840#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {79840#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {79840#(< ~counter~0 100)} is VALID [2022-04-08 06:04:23,788 INFO L290 TraceCheckUtils]: 105: Hoare triple {79865#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79840#(< ~counter~0 100)} is VALID [2022-04-08 06:04:23,788 INFO L290 TraceCheckUtils]: 104: Hoare triple {79865#(< ~counter~0 99)} assume !(~r~0 > 0); {79865#(< ~counter~0 99)} is VALID [2022-04-08 06:04:23,789 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79439#true} {79865#(< ~counter~0 99)} #96#return; {79865#(< ~counter~0 99)} is VALID [2022-04-08 06:04:23,789 INFO L290 TraceCheckUtils]: 102: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,789 INFO L290 TraceCheckUtils]: 101: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,789 INFO L290 TraceCheckUtils]: 100: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,789 INFO L272 TraceCheckUtils]: 99: Hoare triple {79865#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {79865#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {79865#(< ~counter~0 99)} is VALID [2022-04-08 06:04:23,790 INFO L290 TraceCheckUtils]: 97: Hoare triple {79890#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79865#(< ~counter~0 99)} is VALID [2022-04-08 06:04:23,790 INFO L290 TraceCheckUtils]: 96: Hoare triple {79890#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79890#(< ~counter~0 98)} is VALID [2022-04-08 06:04:23,790 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79439#true} {79890#(< ~counter~0 98)} #96#return; {79890#(< ~counter~0 98)} is VALID [2022-04-08 06:04:23,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,790 INFO L290 TraceCheckUtils]: 93: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,791 INFO L290 TraceCheckUtils]: 92: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,791 INFO L272 TraceCheckUtils]: 91: Hoare triple {79890#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {79890#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {79890#(< ~counter~0 98)} is VALID [2022-04-08 06:04:23,792 INFO L290 TraceCheckUtils]: 89: Hoare triple {79915#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79890#(< ~counter~0 98)} is VALID [2022-04-08 06:04:23,792 INFO L290 TraceCheckUtils]: 88: Hoare triple {79915#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79915#(< ~counter~0 97)} is VALID [2022-04-08 06:04:23,792 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79439#true} {79915#(< ~counter~0 97)} #96#return; {79915#(< ~counter~0 97)} is VALID [2022-04-08 06:04:23,792 INFO L290 TraceCheckUtils]: 86: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,792 INFO L290 TraceCheckUtils]: 85: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,792 INFO L290 TraceCheckUtils]: 84: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,792 INFO L272 TraceCheckUtils]: 83: Hoare triple {79915#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,793 INFO L290 TraceCheckUtils]: 82: Hoare triple {79915#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {79915#(< ~counter~0 97)} is VALID [2022-04-08 06:04:23,793 INFO L290 TraceCheckUtils]: 81: Hoare triple {79940#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79915#(< ~counter~0 97)} is VALID [2022-04-08 06:04:23,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {79940#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79940#(< ~counter~0 96)} is VALID [2022-04-08 06:04:23,794 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79439#true} {79940#(< ~counter~0 96)} #96#return; {79940#(< ~counter~0 96)} is VALID [2022-04-08 06:04:23,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,794 INFO L272 TraceCheckUtils]: 75: Hoare triple {79940#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {79940#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {79940#(< ~counter~0 96)} is VALID [2022-04-08 06:04:23,795 INFO L290 TraceCheckUtils]: 73: Hoare triple {79965#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79940#(< ~counter~0 96)} is VALID [2022-04-08 06:04:23,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {79965#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79965#(< ~counter~0 95)} is VALID [2022-04-08 06:04:23,796 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79439#true} {79965#(< ~counter~0 95)} #96#return; {79965#(< ~counter~0 95)} is VALID [2022-04-08 06:04:23,796 INFO L290 TraceCheckUtils]: 70: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,796 INFO L272 TraceCheckUtils]: 67: Hoare triple {79965#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {79965#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {79965#(< ~counter~0 95)} is VALID [2022-04-08 06:04:23,797 INFO L290 TraceCheckUtils]: 65: Hoare triple {79990#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79965#(< ~counter~0 95)} is VALID [2022-04-08 06:04:23,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {79990#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79990#(< ~counter~0 94)} is VALID [2022-04-08 06:04:23,798 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79439#true} {79990#(< ~counter~0 94)} #96#return; {79990#(< ~counter~0 94)} is VALID [2022-04-08 06:04:23,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,798 INFO L290 TraceCheckUtils]: 61: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,798 INFO L272 TraceCheckUtils]: 59: Hoare triple {79990#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,798 INFO L290 TraceCheckUtils]: 58: Hoare triple {79990#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {79990#(< ~counter~0 94)} is VALID [2022-04-08 06:04:23,799 INFO L290 TraceCheckUtils]: 57: Hoare triple {80015#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79990#(< ~counter~0 94)} is VALID [2022-04-08 06:04:23,799 INFO L290 TraceCheckUtils]: 56: Hoare triple {80015#(< ~counter~0 93)} assume !!(0 != ~r~0); {80015#(< ~counter~0 93)} is VALID [2022-04-08 06:04:23,799 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79439#true} {80015#(< ~counter~0 93)} #94#return; {80015#(< ~counter~0 93)} is VALID [2022-04-08 06:04:23,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,800 INFO L272 TraceCheckUtils]: 51: Hoare triple {80015#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {80015#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {80015#(< ~counter~0 93)} is VALID [2022-04-08 06:04:23,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {80040#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80015#(< ~counter~0 93)} is VALID [2022-04-08 06:04:23,801 INFO L290 TraceCheckUtils]: 48: Hoare triple {80040#(< ~counter~0 92)} assume !(~r~0 < 0); {80040#(< ~counter~0 92)} is VALID [2022-04-08 06:04:23,801 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79439#true} {80040#(< ~counter~0 92)} #98#return; {80040#(< ~counter~0 92)} is VALID [2022-04-08 06:04:23,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,801 INFO L272 TraceCheckUtils]: 43: Hoare triple {80040#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {80040#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {80040#(< ~counter~0 92)} is VALID [2022-04-08 06:04:23,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {80065#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80040#(< ~counter~0 92)} is VALID [2022-04-08 06:04:23,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {80065#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80065#(< ~counter~0 91)} is VALID [2022-04-08 06:04:23,803 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79439#true} {80065#(< ~counter~0 91)} #98#return; {80065#(< ~counter~0 91)} is VALID [2022-04-08 06:04:23,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,803 INFO L272 TraceCheckUtils]: 35: Hoare triple {80065#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {80065#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {80065#(< ~counter~0 91)} is VALID [2022-04-08 06:04:23,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {80090#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80065#(< ~counter~0 91)} is VALID [2022-04-08 06:04:23,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {80090#(< ~counter~0 90)} assume !(~r~0 > 0); {80090#(< ~counter~0 90)} is VALID [2022-04-08 06:04:23,805 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79439#true} {80090#(< ~counter~0 90)} #96#return; {80090#(< ~counter~0 90)} is VALID [2022-04-08 06:04:23,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,805 INFO L272 TraceCheckUtils]: 27: Hoare triple {80090#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {80090#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {80090#(< ~counter~0 90)} is VALID [2022-04-08 06:04:23,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {80115#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80090#(< ~counter~0 90)} is VALID [2022-04-08 06:04:23,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {80115#(< ~counter~0 89)} assume !!(0 != ~r~0); {80115#(< ~counter~0 89)} is VALID [2022-04-08 06:04:23,807 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79439#true} {80115#(< ~counter~0 89)} #94#return; {80115#(< ~counter~0 89)} is VALID [2022-04-08 06:04:23,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,807 INFO L272 TraceCheckUtils]: 19: Hoare triple {80115#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {80115#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {80115#(< ~counter~0 89)} is VALID [2022-04-08 06:04:23,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {80140#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80115#(< ~counter~0 89)} is VALID [2022-04-08 06:04:23,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {80140#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,808 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79439#true} {80140#(< ~counter~0 88)} #92#return; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L272 TraceCheckUtils]: 11: Hoare triple {80140#(< ~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)); {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79439#true} {80140#(< ~counter~0 88)} #90#return; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {80140#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79439#true} is VALID [2022-04-08 06:04:23,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {80140#(< ~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; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {80140#(< ~counter~0 88)} call #t~ret9 := main(); {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80140#(< ~counter~0 88)} {79439#true} #102#return; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {80140#(< ~counter~0 88)} assume true; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {79439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {80140#(< ~counter~0 88)} is VALID [2022-04-08 06:04:23,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {79439#true} call ULTIMATE.init(); {79439#true} is VALID [2022-04-08 06:04:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 06:04:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227936071] [2022-04-08 06:04:23,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378218985] [2022-04-08 06:04:23,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378218985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:23,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:23,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:04:23,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:23,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573009747] [2022-04-08 06:04:23,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573009747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:23,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:23,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:04:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487169] [2022-04-08 06:04:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:23,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-08 06:04:23,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:23,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:23,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:23,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:04:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:04:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:04:23,946 INFO L87 Difference]: Start difference. First operand 616 states and 841 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:26,503 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-08 06:04:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 06:04:26,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-08 06:04:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 06:04:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-08 06:04:26,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-08 06:04:26,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:26,705 INFO L225 Difference]: With dead ends: 837 [2022-04-08 06:04:26,705 INFO L226 Difference]: Without dead ends: 644 [2022-04-08 06:04:26,706 INFO L912 BasicCegarLoop]: 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-08 06:04:26,706 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 164 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:26,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 285 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:26,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-08 06:04:28,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-08 06:04:28,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:28,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:28,291 INFO L74 IsIncluded]: Start isIncluded. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:28,291 INFO L87 Difference]: Start difference. First operand 644 states. Second operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:28,306 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 06:04:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 06:04:28,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:28,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:28,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 06:04:28,308 INFO L87 Difference]: Start difference. First operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 644 states. [2022-04-08 06:04:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:28,323 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-08 06:04:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-08 06:04:28,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:28,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:28,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:28,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 478 states have (on average 1.2238493723849373) internal successors, (585), 482 states have internal predecessors, (585), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-08 06:04:28,342 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-08 06:04:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:28,343 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-08 06:04:28,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:28,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-08 06:04:31,704 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-08 06:04:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-08 06:04:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 06:04:31,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:31,705 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:31,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-08 06:04:31,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 06:04:31,906 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-08 06:04:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:31,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167646343] [2022-04-08 06:04:31,906 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-08 06:04:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:31,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881308759] [2022-04-08 06:04:31,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:31,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:31,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:31,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398763907] [2022-04-08 06:04:31,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:04:31,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:31,919 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:31,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 06:04:32,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:04:32,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:32,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 06:04:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:32,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:32,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {84444#true} call ULTIMATE.init(); {84444#true} is VALID [2022-04-08 06:04:32,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {84444#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84452#(<= ~counter~0 0)} {84444#true} #102#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {84452#(<= ~counter~0 0)} call #t~ret9 := main(); {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {84452#(<= ~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; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {84452#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {84452#(<= ~counter~0 0)} ~cond := #in~cond; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {84452#(<= ~counter~0 0)} assume !(0 == ~cond); {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,611 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84452#(<= ~counter~0 0)} {84452#(<= ~counter~0 0)} #90#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,612 INFO L272 TraceCheckUtils]: 11: Hoare triple {84452#(<= ~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)); {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {84452#(<= ~counter~0 0)} ~cond := #in~cond; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {84452#(<= ~counter~0 0)} assume !(0 == ~cond); {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,612 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84452#(<= ~counter~0 0)} {84452#(<= ~counter~0 0)} #92#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {84452#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84452#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:32,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {84452#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {84501#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,615 INFO L272 TraceCheckUtils]: 19: Hoare triple {84501#(<= ~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)); {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {84501#(<= ~counter~0 1)} ~cond := #in~cond; {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {84501#(<= ~counter~0 1)} assume !(0 == ~cond); {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {84501#(<= ~counter~0 1)} assume true; {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,616 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84501#(<= ~counter~0 1)} {84501#(<= ~counter~0 1)} #94#return; {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {84501#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84501#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:32,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {84501#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {84526#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,617 INFO L272 TraceCheckUtils]: 27: Hoare triple {84526#(<= ~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)); {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {84526#(<= ~counter~0 2)} ~cond := #in~cond; {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {84526#(<= ~counter~0 2)} assume !(0 == ~cond); {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {84526#(<= ~counter~0 2)} assume true; {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,618 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84526#(<= ~counter~0 2)} {84526#(<= ~counter~0 2)} #96#return; {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {84526#(<= ~counter~0 2)} assume !(~r~0 > 0); {84526#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:32,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {84526#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {84551#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,620 INFO L272 TraceCheckUtils]: 35: Hoare triple {84551#(<= ~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)); {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {84551#(<= ~counter~0 3)} ~cond := #in~cond; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {84551#(<= ~counter~0 3)} assume !(0 == ~cond); {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {84551#(<= ~counter~0 3)} assume true; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,621 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84551#(<= ~counter~0 3)} {84551#(<= ~counter~0 3)} #98#return; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {84551#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84551#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:32,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {84551#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {84576#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,622 INFO L272 TraceCheckUtils]: 43: Hoare triple {84576#(<= ~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)); {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {84576#(<= ~counter~0 4)} ~cond := #in~cond; {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {84576#(<= ~counter~0 4)} assume !(0 == ~cond); {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {84576#(<= ~counter~0 4)} assume true; {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,623 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84576#(<= ~counter~0 4)} {84576#(<= ~counter~0 4)} #98#return; {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {84576#(<= ~counter~0 4)} assume !(~r~0 < 0); {84576#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:32,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {84576#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {84601#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,624 INFO L272 TraceCheckUtils]: 51: Hoare triple {84601#(<= ~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)); {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {84601#(<= ~counter~0 5)} ~cond := #in~cond; {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {84601#(<= ~counter~0 5)} assume !(0 == ~cond); {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {84601#(<= ~counter~0 5)} assume true; {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84601#(<= ~counter~0 5)} {84601#(<= ~counter~0 5)} #94#return; {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,626 INFO L290 TraceCheckUtils]: 56: Hoare triple {84601#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84601#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:32,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {84601#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,627 INFO L290 TraceCheckUtils]: 58: Hoare triple {84626#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,627 INFO L272 TraceCheckUtils]: 59: Hoare triple {84626#(<= ~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)); {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {84626#(<= ~counter~0 6)} ~cond := #in~cond; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {84626#(<= ~counter~0 6)} assume !(0 == ~cond); {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {84626#(<= ~counter~0 6)} assume true; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,628 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84626#(<= ~counter~0 6)} {84626#(<= ~counter~0 6)} #96#return; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,628 INFO L290 TraceCheckUtils]: 64: Hoare triple {84626#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84626#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:32,629 INFO L290 TraceCheckUtils]: 65: Hoare triple {84626#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,629 INFO L290 TraceCheckUtils]: 66: Hoare triple {84651#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,629 INFO L272 TraceCheckUtils]: 67: Hoare triple {84651#(<= ~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)); {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {84651#(<= ~counter~0 7)} ~cond := #in~cond; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,630 INFO L290 TraceCheckUtils]: 69: Hoare triple {84651#(<= ~counter~0 7)} assume !(0 == ~cond); {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,630 INFO L290 TraceCheckUtils]: 70: Hoare triple {84651#(<= ~counter~0 7)} assume true; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,630 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84651#(<= ~counter~0 7)} {84651#(<= ~counter~0 7)} #96#return; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,630 INFO L290 TraceCheckUtils]: 72: Hoare triple {84651#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84651#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:32,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {84651#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {84676#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,632 INFO L272 TraceCheckUtils]: 75: Hoare triple {84676#(<= ~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)); {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,632 INFO L290 TraceCheckUtils]: 76: Hoare triple {84676#(<= ~counter~0 8)} ~cond := #in~cond; {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,632 INFO L290 TraceCheckUtils]: 77: Hoare triple {84676#(<= ~counter~0 8)} assume !(0 == ~cond); {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {84676#(<= ~counter~0 8)} assume true; {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,633 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84676#(<= ~counter~0 8)} {84676#(<= ~counter~0 8)} #96#return; {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {84676#(<= ~counter~0 8)} assume !(~r~0 > 0); {84676#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:32,633 INFO L290 TraceCheckUtils]: 81: Hoare triple {84676#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,634 INFO L290 TraceCheckUtils]: 82: Hoare triple {84701#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,634 INFO L272 TraceCheckUtils]: 83: Hoare triple {84701#(<= ~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)); {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,634 INFO L290 TraceCheckUtils]: 84: Hoare triple {84701#(<= ~counter~0 9)} ~cond := #in~cond; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,634 INFO L290 TraceCheckUtils]: 85: Hoare triple {84701#(<= ~counter~0 9)} assume !(0 == ~cond); {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {84701#(<= ~counter~0 9)} assume true; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,635 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84701#(<= ~counter~0 9)} {84701#(<= ~counter~0 9)} #98#return; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {84701#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84701#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:32,636 INFO L290 TraceCheckUtils]: 89: Hoare triple {84701#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {84726#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,644 INFO L272 TraceCheckUtils]: 91: Hoare triple {84726#(<= ~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)); {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,645 INFO L290 TraceCheckUtils]: 92: Hoare triple {84726#(<= ~counter~0 10)} ~cond := #in~cond; {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,645 INFO L290 TraceCheckUtils]: 93: Hoare triple {84726#(<= ~counter~0 10)} assume !(0 == ~cond); {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,645 INFO L290 TraceCheckUtils]: 94: Hoare triple {84726#(<= ~counter~0 10)} assume true; {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,645 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84726#(<= ~counter~0 10)} {84726#(<= ~counter~0 10)} #98#return; {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {84726#(<= ~counter~0 10)} assume !(~r~0 < 0); {84726#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:32,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {84726#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {84751#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,648 INFO L272 TraceCheckUtils]: 99: Hoare triple {84751#(<= ~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)); {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,648 INFO L290 TraceCheckUtils]: 100: Hoare triple {84751#(<= ~counter~0 11)} ~cond := #in~cond; {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,648 INFO L290 TraceCheckUtils]: 101: Hoare triple {84751#(<= ~counter~0 11)} assume !(0 == ~cond); {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,648 INFO L290 TraceCheckUtils]: 102: Hoare triple {84751#(<= ~counter~0 11)} assume true; {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,648 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84751#(<= ~counter~0 11)} {84751#(<= ~counter~0 11)} #94#return; {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,649 INFO L290 TraceCheckUtils]: 104: Hoare triple {84751#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84751#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:32,649 INFO L290 TraceCheckUtils]: 105: Hoare triple {84751#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,650 INFO L290 TraceCheckUtils]: 106: Hoare triple {84776#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,650 INFO L272 TraceCheckUtils]: 107: Hoare triple {84776#(<= ~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)); {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,650 INFO L290 TraceCheckUtils]: 108: Hoare triple {84776#(<= ~counter~0 12)} ~cond := #in~cond; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,650 INFO L290 TraceCheckUtils]: 109: Hoare triple {84776#(<= ~counter~0 12)} assume !(0 == ~cond); {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,651 INFO L290 TraceCheckUtils]: 110: Hoare triple {84776#(<= ~counter~0 12)} assume true; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,651 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84776#(<= ~counter~0 12)} {84776#(<= ~counter~0 12)} #96#return; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,651 INFO L290 TraceCheckUtils]: 112: Hoare triple {84776#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84776#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:32,651 INFO L290 TraceCheckUtils]: 113: Hoare triple {84776#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84801#(<= |main_#t~post7| 12)} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {84801#(<= |main_#t~post7| 12)} assume !(#t~post7 < 100);havoc #t~post7; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 115: Hoare triple {84445#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 116: Hoare triple {84445#false} assume !(#t~post8 < 100);havoc #t~post8; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 117: Hoare triple {84445#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 118: Hoare triple {84445#false} assume !(#t~post6 < 100);havoc #t~post6; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L272 TraceCheckUtils]: 119: Hoare triple {84445#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 120: Hoare triple {84445#false} ~cond := #in~cond; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 121: Hoare triple {84445#false} assume 0 == ~cond; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L290 TraceCheckUtils]: 122: Hoare triple {84445#false} assume !false; {84445#false} is VALID [2022-04-08 06:04:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:32,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 122: Hoare triple {84445#false} assume !false; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 121: Hoare triple {84445#false} assume 0 == ~cond; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 120: Hoare triple {84445#false} ~cond := #in~cond; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L272 TraceCheckUtils]: 119: Hoare triple {84445#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 118: Hoare triple {84445#false} assume !(#t~post6 < 100);havoc #t~post6; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 117: Hoare triple {84445#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 116: Hoare triple {84445#false} assume !(#t~post8 < 100);havoc #t~post8; {84445#false} is VALID [2022-04-08 06:04:33,076 INFO L290 TraceCheckUtils]: 115: Hoare triple {84445#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84445#false} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 114: Hoare triple {84853#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {84445#false} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 113: Hoare triple {84857#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84853#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 112: Hoare triple {84857#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84857#(< ~counter~0 100)} is VALID [2022-04-08 06:04:33,077 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84444#true} {84857#(< ~counter~0 100)} #96#return; {84857#(< ~counter~0 100)} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 110: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 109: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,077 INFO L290 TraceCheckUtils]: 108: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,078 INFO L272 TraceCheckUtils]: 107: Hoare triple {84857#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,078 INFO L290 TraceCheckUtils]: 106: Hoare triple {84857#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {84857#(< ~counter~0 100)} is VALID [2022-04-08 06:04:33,080 INFO L290 TraceCheckUtils]: 105: Hoare triple {84882#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84857#(< ~counter~0 100)} is VALID [2022-04-08 06:04:33,080 INFO L290 TraceCheckUtils]: 104: Hoare triple {84882#(< ~counter~0 99)} assume !!(0 != ~r~0); {84882#(< ~counter~0 99)} is VALID [2022-04-08 06:04:33,080 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84444#true} {84882#(< ~counter~0 99)} #94#return; {84882#(< ~counter~0 99)} is VALID [2022-04-08 06:04:33,080 INFO L290 TraceCheckUtils]: 102: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,080 INFO L272 TraceCheckUtils]: 99: Hoare triple {84882#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {84882#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {84882#(< ~counter~0 99)} is VALID [2022-04-08 06:04:33,081 INFO L290 TraceCheckUtils]: 97: Hoare triple {84907#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84882#(< ~counter~0 99)} is VALID [2022-04-08 06:04:33,081 INFO L290 TraceCheckUtils]: 96: Hoare triple {84907#(< ~counter~0 98)} assume !(~r~0 < 0); {84907#(< ~counter~0 98)} is VALID [2022-04-08 06:04:33,082 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84444#true} {84907#(< ~counter~0 98)} #98#return; {84907#(< ~counter~0 98)} is VALID [2022-04-08 06:04:33,082 INFO L290 TraceCheckUtils]: 94: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,082 INFO L290 TraceCheckUtils]: 93: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,082 INFO L290 TraceCheckUtils]: 92: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,082 INFO L272 TraceCheckUtils]: 91: Hoare triple {84907#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {84907#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {84907#(< ~counter~0 98)} is VALID [2022-04-08 06:04:33,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {84932#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84907#(< ~counter~0 98)} is VALID [2022-04-08 06:04:33,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {84932#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84932#(< ~counter~0 97)} is VALID [2022-04-08 06:04:33,083 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84444#true} {84932#(< ~counter~0 97)} #98#return; {84932#(< ~counter~0 97)} is VALID [2022-04-08 06:04:33,084 INFO L290 TraceCheckUtils]: 86: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,084 INFO L290 TraceCheckUtils]: 84: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,084 INFO L272 TraceCheckUtils]: 83: Hoare triple {84932#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,084 INFO L290 TraceCheckUtils]: 82: Hoare triple {84932#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {84932#(< ~counter~0 97)} is VALID [2022-04-08 06:04:33,085 INFO L290 TraceCheckUtils]: 81: Hoare triple {84957#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84932#(< ~counter~0 97)} is VALID [2022-04-08 06:04:33,085 INFO L290 TraceCheckUtils]: 80: Hoare triple {84957#(< ~counter~0 96)} assume !(~r~0 > 0); {84957#(< ~counter~0 96)} is VALID [2022-04-08 06:04:33,085 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84444#true} {84957#(< ~counter~0 96)} #96#return; {84957#(< ~counter~0 96)} is VALID [2022-04-08 06:04:33,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,085 INFO L290 TraceCheckUtils]: 77: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,085 INFO L272 TraceCheckUtils]: 75: Hoare triple {84957#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {84957#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {84957#(< ~counter~0 96)} is VALID [2022-04-08 06:04:33,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {84982#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84957#(< ~counter~0 96)} is VALID [2022-04-08 06:04:33,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {84982#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84982#(< ~counter~0 95)} is VALID [2022-04-08 06:04:33,087 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84444#true} {84982#(< ~counter~0 95)} #96#return; {84982#(< ~counter~0 95)} is VALID [2022-04-08 06:04:33,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,087 INFO L290 TraceCheckUtils]: 68: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,087 INFO L272 TraceCheckUtils]: 67: Hoare triple {84982#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,087 INFO L290 TraceCheckUtils]: 66: Hoare triple {84982#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {84982#(< ~counter~0 95)} is VALID [2022-04-08 06:04:33,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {85007#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84982#(< ~counter~0 95)} is VALID [2022-04-08 06:04:33,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {85007#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85007#(< ~counter~0 94)} is VALID [2022-04-08 06:04:33,089 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84444#true} {85007#(< ~counter~0 94)} #96#return; {85007#(< ~counter~0 94)} is VALID [2022-04-08 06:04:33,089 INFO L290 TraceCheckUtils]: 62: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,089 INFO L290 TraceCheckUtils]: 61: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,089 INFO L272 TraceCheckUtils]: 59: Hoare triple {85007#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {85007#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {85007#(< ~counter~0 94)} is VALID [2022-04-08 06:04:33,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {85032#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85007#(< ~counter~0 94)} is VALID [2022-04-08 06:04:33,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {85032#(< ~counter~0 93)} assume !!(0 != ~r~0); {85032#(< ~counter~0 93)} is VALID [2022-04-08 06:04:33,090 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84444#true} {85032#(< ~counter~0 93)} #94#return; {85032#(< ~counter~0 93)} is VALID [2022-04-08 06:04:33,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,090 INFO L272 TraceCheckUtils]: 51: Hoare triple {85032#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {85032#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {85032#(< ~counter~0 93)} is VALID [2022-04-08 06:04:33,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {85057#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85032#(< ~counter~0 93)} is VALID [2022-04-08 06:04:33,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {85057#(< ~counter~0 92)} assume !(~r~0 < 0); {85057#(< ~counter~0 92)} is VALID [2022-04-08 06:04:33,092 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84444#true} {85057#(< ~counter~0 92)} #98#return; {85057#(< ~counter~0 92)} is VALID [2022-04-08 06:04:33,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,092 INFO L272 TraceCheckUtils]: 43: Hoare triple {85057#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,092 INFO L290 TraceCheckUtils]: 42: Hoare triple {85057#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {85057#(< ~counter~0 92)} is VALID [2022-04-08 06:04:33,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {85082#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85057#(< ~counter~0 92)} is VALID [2022-04-08 06:04:33,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {85082#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85082#(< ~counter~0 91)} is VALID [2022-04-08 06:04:33,094 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84444#true} {85082#(< ~counter~0 91)} #98#return; {85082#(< ~counter~0 91)} is VALID [2022-04-08 06:04:33,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,094 INFO L272 TraceCheckUtils]: 35: Hoare triple {85082#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {85082#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {85082#(< ~counter~0 91)} is VALID [2022-04-08 06:04:33,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {85107#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85082#(< ~counter~0 91)} is VALID [2022-04-08 06:04:33,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {85107#(< ~counter~0 90)} assume !(~r~0 > 0); {85107#(< ~counter~0 90)} is VALID [2022-04-08 06:04:33,095 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84444#true} {85107#(< ~counter~0 90)} #96#return; {85107#(< ~counter~0 90)} is VALID [2022-04-08 06:04:33,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {85107#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {85107#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {85107#(< ~counter~0 90)} is VALID [2022-04-08 06:04:33,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {85132#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85107#(< ~counter~0 90)} is VALID [2022-04-08 06:04:33,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {85132#(< ~counter~0 89)} assume !!(0 != ~r~0); {85132#(< ~counter~0 89)} is VALID [2022-04-08 06:04:33,097 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84444#true} {85132#(< ~counter~0 89)} #94#return; {85132#(< ~counter~0 89)} is VALID [2022-04-08 06:04:33,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {85132#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {85132#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {85132#(< ~counter~0 89)} is VALID [2022-04-08 06:04:33,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {85157#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85132#(< ~counter~0 89)} is VALID [2022-04-08 06:04:33,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {85157#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84444#true} {85157#(< ~counter~0 88)} #92#return; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L272 TraceCheckUtils]: 11: Hoare triple {85157#(< ~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)); {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84444#true} {85157#(< ~counter~0 88)} #90#return; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {85157#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84444#true} is VALID [2022-04-08 06:04:33,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {85157#(< ~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; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {85157#(< ~counter~0 88)} call #t~ret9 := main(); {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85157#(< ~counter~0 88)} {84444#true} #102#return; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {85157#(< ~counter~0 88)} assume true; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {84444#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {85157#(< ~counter~0 88)} is VALID [2022-04-08 06:04:33,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {84444#true} call ULTIMATE.init(); {84444#true} is VALID [2022-04-08 06:04:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 06:04:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881308759] [2022-04-08 06:04:33,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398763907] [2022-04-08 06:04:33,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398763907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:33,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:33,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-08 06:04:33,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167646343] [2022-04-08 06:04:33,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167646343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:33,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 06:04:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64546032] [2022-04-08 06:04:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-08 06:04:33,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:33,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:33,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:33,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 06:04:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 06:04:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-08 06:04:33,180 INFO L87 Difference]: Start difference. First operand 634 states and 863 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:35,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:35,570 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-08 06:04:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 06:04:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-08 06:04:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 06:04:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-08 06:04:35,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-08 06:04:35,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:35,817 INFO L225 Difference]: With dead ends: 847 [2022-04-08 06:04:35,817 INFO L226 Difference]: Without dead ends: 650 [2022-04-08 06:04:35,818 INFO L912 BasicCegarLoop]: 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-08 06:04:35,819 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 183 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:35,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 293 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-08 06:04:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-08 06:04:37,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:37,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:37,069 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:37,070 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:37,085 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 06:04:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:04:37,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:37,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:37,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 06:04:37,087 INFO L87 Difference]: Start difference. First operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 650 states. [2022-04-08 06:04:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:37,102 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-08 06:04:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:04:37,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:37,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:37,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:37,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 494 states have (on average 1.2165991902834008) internal successors, (601), 494 states have internal predecessors, (601), 140 states have call successors, (140), 17 states have call predecessors, (140), 15 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-08 06:04:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-08 06:04:37,123 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-08 06:04:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:37,123 INFO L478 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-08 06:04:37,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-08 06:04:37,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-08 06:04:40,601 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-08 06:04:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-08 06:04:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-08 06:04:40,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:40,602 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:40,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:40,803 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:40,803 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-08 06:04:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:40,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476478316] [2022-04-08 06:04:40,804 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-08 06:04:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116607695] [2022-04-08 06:04:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:40,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:40,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746641651] [2022-04-08 06:04:40,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:04:40,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:40,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:40,820 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:40,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 06:04:40,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:04:40,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:40,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:04:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:40,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:41,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {89527#true} call ULTIMATE.init(); {89527#true} is VALID [2022-04-08 06:04:41,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {89527#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89535#(<= ~counter~0 0)} {89527#true} #102#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {89535#(<= ~counter~0 0)} call #t~ret9 := main(); {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {89535#(<= ~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; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {89535#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {89535#(<= ~counter~0 0)} ~cond := #in~cond; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {89535#(<= ~counter~0 0)} assume !(0 == ~cond); {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89535#(<= ~counter~0 0)} {89535#(<= ~counter~0 0)} #90#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {89535#(<= ~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)); {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {89535#(<= ~counter~0 0)} ~cond := #in~cond; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {89535#(<= ~counter~0 0)} assume !(0 == ~cond); {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,554 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89535#(<= ~counter~0 0)} {89535#(<= ~counter~0 0)} #92#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {89535#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89535#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:41,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {89535#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {89584#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,556 INFO L272 TraceCheckUtils]: 19: Hoare triple {89584#(<= ~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)); {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {89584#(<= ~counter~0 1)} ~cond := #in~cond; {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {89584#(<= ~counter~0 1)} assume !(0 == ~cond); {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {89584#(<= ~counter~0 1)} assume true; {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,558 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89584#(<= ~counter~0 1)} {89584#(<= ~counter~0 1)} #94#return; {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {89584#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89584#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:41,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {89584#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {89609#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,560 INFO L272 TraceCheckUtils]: 27: Hoare triple {89609#(<= ~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)); {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {89609#(<= ~counter~0 2)} ~cond := #in~cond; {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {89609#(<= ~counter~0 2)} assume !(0 == ~cond); {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {89609#(<= ~counter~0 2)} assume true; {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,561 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89609#(<= ~counter~0 2)} {89609#(<= ~counter~0 2)} #96#return; {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {89609#(<= ~counter~0 2)} assume !(~r~0 > 0); {89609#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:41,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {89609#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {89634#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {89634#(<= ~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)); {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {89634#(<= ~counter~0 3)} ~cond := #in~cond; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {89634#(<= ~counter~0 3)} assume !(0 == ~cond); {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {89634#(<= ~counter~0 3)} assume true; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,564 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89634#(<= ~counter~0 3)} {89634#(<= ~counter~0 3)} #98#return; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {89634#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89634#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:41,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {89634#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {89659#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,566 INFO L272 TraceCheckUtils]: 43: Hoare triple {89659#(<= ~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)); {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {89659#(<= ~counter~0 4)} ~cond := #in~cond; {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {89659#(<= ~counter~0 4)} assume !(0 == ~cond); {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {89659#(<= ~counter~0 4)} assume true; {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,567 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89659#(<= ~counter~0 4)} {89659#(<= ~counter~0 4)} #98#return; {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {89659#(<= ~counter~0 4)} assume !(~r~0 < 0); {89659#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:41,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {89659#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {89684#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,569 INFO L272 TraceCheckUtils]: 51: Hoare triple {89684#(<= ~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)); {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {89684#(<= ~counter~0 5)} ~cond := #in~cond; {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {89684#(<= ~counter~0 5)} assume !(0 == ~cond); {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {89684#(<= ~counter~0 5)} assume true; {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,582 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89684#(<= ~counter~0 5)} {89684#(<= ~counter~0 5)} #94#return; {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {89684#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89684#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:41,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {89684#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {89709#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,585 INFO L272 TraceCheckUtils]: 59: Hoare triple {89709#(<= ~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)); {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {89709#(<= ~counter~0 6)} ~cond := #in~cond; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {89709#(<= ~counter~0 6)} assume !(0 == ~cond); {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {89709#(<= ~counter~0 6)} assume true; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,587 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89709#(<= ~counter~0 6)} {89709#(<= ~counter~0 6)} #96#return; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {89709#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89709#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:41,588 INFO L290 TraceCheckUtils]: 65: Hoare triple {89709#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {89734#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,588 INFO L272 TraceCheckUtils]: 67: Hoare triple {89734#(<= ~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)); {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {89734#(<= ~counter~0 7)} ~cond := #in~cond; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {89734#(<= ~counter~0 7)} assume !(0 == ~cond); {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {89734#(<= ~counter~0 7)} assume true; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,590 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89734#(<= ~counter~0 7)} {89734#(<= ~counter~0 7)} #96#return; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {89734#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89734#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:41,591 INFO L290 TraceCheckUtils]: 73: Hoare triple {89734#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,591 INFO L290 TraceCheckUtils]: 74: Hoare triple {89759#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,591 INFO L272 TraceCheckUtils]: 75: Hoare triple {89759#(<= ~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)); {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {89759#(<= ~counter~0 8)} ~cond := #in~cond; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,592 INFO L290 TraceCheckUtils]: 77: Hoare triple {89759#(<= ~counter~0 8)} assume !(0 == ~cond); {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,592 INFO L290 TraceCheckUtils]: 78: Hoare triple {89759#(<= ~counter~0 8)} assume true; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,593 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89759#(<= ~counter~0 8)} {89759#(<= ~counter~0 8)} #96#return; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {89759#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89759#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:41,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {89759#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {89784#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,594 INFO L272 TraceCheckUtils]: 83: Hoare triple {89784#(<= ~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)); {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,595 INFO L290 TraceCheckUtils]: 84: Hoare triple {89784#(<= ~counter~0 9)} ~cond := #in~cond; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {89784#(<= ~counter~0 9)} assume !(0 == ~cond); {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,595 INFO L290 TraceCheckUtils]: 86: Hoare triple {89784#(<= ~counter~0 9)} assume true; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,596 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89784#(<= ~counter~0 9)} {89784#(<= ~counter~0 9)} #96#return; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {89784#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89784#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:41,597 INFO L290 TraceCheckUtils]: 89: Hoare triple {89784#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,597 INFO L290 TraceCheckUtils]: 90: Hoare triple {89809#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,598 INFO L272 TraceCheckUtils]: 91: Hoare triple {89809#(<= ~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)); {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,598 INFO L290 TraceCheckUtils]: 92: Hoare triple {89809#(<= ~counter~0 10)} ~cond := #in~cond; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,598 INFO L290 TraceCheckUtils]: 93: Hoare triple {89809#(<= ~counter~0 10)} assume !(0 == ~cond); {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,598 INFO L290 TraceCheckUtils]: 94: Hoare triple {89809#(<= ~counter~0 10)} assume true; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,599 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89809#(<= ~counter~0 10)} {89809#(<= ~counter~0 10)} #96#return; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,599 INFO L290 TraceCheckUtils]: 96: Hoare triple {89809#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89809#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:41,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {89809#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,600 INFO L290 TraceCheckUtils]: 98: Hoare triple {89834#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,601 INFO L272 TraceCheckUtils]: 99: Hoare triple {89834#(<= ~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)); {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,601 INFO L290 TraceCheckUtils]: 100: Hoare triple {89834#(<= ~counter~0 11)} ~cond := #in~cond; {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,601 INFO L290 TraceCheckUtils]: 101: Hoare triple {89834#(<= ~counter~0 11)} assume !(0 == ~cond); {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,601 INFO L290 TraceCheckUtils]: 102: Hoare triple {89834#(<= ~counter~0 11)} assume true; {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,602 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89834#(<= ~counter~0 11)} {89834#(<= ~counter~0 11)} #96#return; {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,602 INFO L290 TraceCheckUtils]: 104: Hoare triple {89834#(<= ~counter~0 11)} assume !(~r~0 > 0); {89834#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:41,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {89834#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,603 INFO L290 TraceCheckUtils]: 106: Hoare triple {89859#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,604 INFO L272 TraceCheckUtils]: 107: Hoare triple {89859#(<= ~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)); {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,604 INFO L290 TraceCheckUtils]: 108: Hoare triple {89859#(<= ~counter~0 12)} ~cond := #in~cond; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,604 INFO L290 TraceCheckUtils]: 109: Hoare triple {89859#(<= ~counter~0 12)} assume !(0 == ~cond); {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,604 INFO L290 TraceCheckUtils]: 110: Hoare triple {89859#(<= ~counter~0 12)} assume true; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,605 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89859#(<= ~counter~0 12)} {89859#(<= ~counter~0 12)} #98#return; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,605 INFO L290 TraceCheckUtils]: 112: Hoare triple {89859#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89859#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:41,606 INFO L290 TraceCheckUtils]: 113: Hoare triple {89859#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,606 INFO L290 TraceCheckUtils]: 114: Hoare triple {89884#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,607 INFO L272 TraceCheckUtils]: 115: Hoare triple {89884#(<= ~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)); {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,607 INFO L290 TraceCheckUtils]: 116: Hoare triple {89884#(<= ~counter~0 13)} ~cond := #in~cond; {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,607 INFO L290 TraceCheckUtils]: 117: Hoare triple {89884#(<= ~counter~0 13)} assume !(0 == ~cond); {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,608 INFO L290 TraceCheckUtils]: 118: Hoare triple {89884#(<= ~counter~0 13)} assume true; {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,608 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89884#(<= ~counter~0 13)} {89884#(<= ~counter~0 13)} #98#return; {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,608 INFO L290 TraceCheckUtils]: 120: Hoare triple {89884#(<= ~counter~0 13)} assume !(~r~0 < 0); {89884#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:41,609 INFO L290 TraceCheckUtils]: 121: Hoare triple {89884#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89909#(<= |main_#t~post6| 13)} is VALID [2022-04-08 06:04:41,609 INFO L290 TraceCheckUtils]: 122: Hoare triple {89909#(<= |main_#t~post6| 13)} assume !(#t~post6 < 100);havoc #t~post6; {89528#false} is VALID [2022-04-08 06:04:41,609 INFO L272 TraceCheckUtils]: 123: Hoare triple {89528#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89528#false} is VALID [2022-04-08 06:04:41,609 INFO L290 TraceCheckUtils]: 124: Hoare triple {89528#false} ~cond := #in~cond; {89528#false} is VALID [2022-04-08 06:04:41,609 INFO L290 TraceCheckUtils]: 125: Hoare triple {89528#false} assume 0 == ~cond; {89528#false} is VALID [2022-04-08 06:04:41,609 INFO L290 TraceCheckUtils]: 126: Hoare triple {89528#false} assume !false; {89528#false} is VALID [2022-04-08 06:04:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:42,336 INFO L290 TraceCheckUtils]: 126: Hoare triple {89528#false} assume !false; {89528#false} is VALID [2022-04-08 06:04:42,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {89528#false} assume 0 == ~cond; {89528#false} is VALID [2022-04-08 06:04:42,336 INFO L290 TraceCheckUtils]: 124: Hoare triple {89528#false} ~cond := #in~cond; {89528#false} is VALID [2022-04-08 06:04:42,336 INFO L272 TraceCheckUtils]: 123: Hoare triple {89528#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89528#false} is VALID [2022-04-08 06:04:42,337 INFO L290 TraceCheckUtils]: 122: Hoare triple {89937#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {89528#false} is VALID [2022-04-08 06:04:42,337 INFO L290 TraceCheckUtils]: 121: Hoare triple {89941#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89937#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:04:42,337 INFO L290 TraceCheckUtils]: 120: Hoare triple {89941#(< ~counter~0 100)} assume !(~r~0 < 0); {89941#(< ~counter~0 100)} is VALID [2022-04-08 06:04:42,338 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89527#true} {89941#(< ~counter~0 100)} #98#return; {89941#(< ~counter~0 100)} is VALID [2022-04-08 06:04:42,338 INFO L290 TraceCheckUtils]: 118: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,338 INFO L272 TraceCheckUtils]: 115: Hoare triple {89941#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,338 INFO L290 TraceCheckUtils]: 114: Hoare triple {89941#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {89941#(< ~counter~0 100)} is VALID [2022-04-08 06:04:42,340 INFO L290 TraceCheckUtils]: 113: Hoare triple {89966#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89941#(< ~counter~0 100)} is VALID [2022-04-08 06:04:42,340 INFO L290 TraceCheckUtils]: 112: Hoare triple {89966#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89966#(< ~counter~0 99)} is VALID [2022-04-08 06:04:42,341 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89527#true} {89966#(< ~counter~0 99)} #98#return; {89966#(< ~counter~0 99)} is VALID [2022-04-08 06:04:42,341 INFO L290 TraceCheckUtils]: 110: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,341 INFO L290 TraceCheckUtils]: 109: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,341 INFO L290 TraceCheckUtils]: 108: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,341 INFO L272 TraceCheckUtils]: 107: Hoare triple {89966#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,341 INFO L290 TraceCheckUtils]: 106: Hoare triple {89966#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {89966#(< ~counter~0 99)} is VALID [2022-04-08 06:04:42,342 INFO L290 TraceCheckUtils]: 105: Hoare triple {89991#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89966#(< ~counter~0 99)} is VALID [2022-04-08 06:04:42,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {89991#(< ~counter~0 98)} assume !(~r~0 > 0); {89991#(< ~counter~0 98)} is VALID [2022-04-08 06:04:42,343 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89527#true} {89991#(< ~counter~0 98)} #96#return; {89991#(< ~counter~0 98)} is VALID [2022-04-08 06:04:42,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,343 INFO L290 TraceCheckUtils]: 100: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,343 INFO L272 TraceCheckUtils]: 99: Hoare triple {89991#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {89991#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {89991#(< ~counter~0 98)} is VALID [2022-04-08 06:04:42,344 INFO L290 TraceCheckUtils]: 97: Hoare triple {90016#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89991#(< ~counter~0 98)} is VALID [2022-04-08 06:04:42,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {90016#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90016#(< ~counter~0 97)} is VALID [2022-04-08 06:04:42,345 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89527#true} {90016#(< ~counter~0 97)} #96#return; {90016#(< ~counter~0 97)} is VALID [2022-04-08 06:04:42,345 INFO L290 TraceCheckUtils]: 94: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,345 INFO L272 TraceCheckUtils]: 91: Hoare triple {90016#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {90016#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {90016#(< ~counter~0 97)} is VALID [2022-04-08 06:04:42,346 INFO L290 TraceCheckUtils]: 89: Hoare triple {90041#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90016#(< ~counter~0 97)} is VALID [2022-04-08 06:04:42,346 INFO L290 TraceCheckUtils]: 88: Hoare triple {90041#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90041#(< ~counter~0 96)} is VALID [2022-04-08 06:04:42,347 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89527#true} {90041#(< ~counter~0 96)} #96#return; {90041#(< ~counter~0 96)} is VALID [2022-04-08 06:04:42,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,347 INFO L272 TraceCheckUtils]: 83: Hoare triple {90041#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {90041#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {90041#(< ~counter~0 96)} is VALID [2022-04-08 06:04:42,348 INFO L290 TraceCheckUtils]: 81: Hoare triple {90066#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90041#(< ~counter~0 96)} is VALID [2022-04-08 06:04:42,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {90066#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90066#(< ~counter~0 95)} is VALID [2022-04-08 06:04:42,349 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89527#true} {90066#(< ~counter~0 95)} #96#return; {90066#(< ~counter~0 95)} is VALID [2022-04-08 06:04:42,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,349 INFO L272 TraceCheckUtils]: 75: Hoare triple {90066#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,349 INFO L290 TraceCheckUtils]: 74: Hoare triple {90066#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {90066#(< ~counter~0 95)} is VALID [2022-04-08 06:04:42,350 INFO L290 TraceCheckUtils]: 73: Hoare triple {90091#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90066#(< ~counter~0 95)} is VALID [2022-04-08 06:04:42,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {90091#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90091#(< ~counter~0 94)} is VALID [2022-04-08 06:04:42,351 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89527#true} {90091#(< ~counter~0 94)} #96#return; {90091#(< ~counter~0 94)} is VALID [2022-04-08 06:04:42,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,351 INFO L272 TraceCheckUtils]: 67: Hoare triple {90091#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {90091#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {90091#(< ~counter~0 94)} is VALID [2022-04-08 06:04:42,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {90116#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90091#(< ~counter~0 94)} is VALID [2022-04-08 06:04:42,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {90116#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90116#(< ~counter~0 93)} is VALID [2022-04-08 06:04:42,353 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89527#true} {90116#(< ~counter~0 93)} #96#return; {90116#(< ~counter~0 93)} is VALID [2022-04-08 06:04:42,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,353 INFO L272 TraceCheckUtils]: 59: Hoare triple {90116#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {90116#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {90116#(< ~counter~0 93)} is VALID [2022-04-08 06:04:42,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {90141#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90116#(< ~counter~0 93)} is VALID [2022-04-08 06:04:42,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {90141#(< ~counter~0 92)} assume !!(0 != ~r~0); {90141#(< ~counter~0 92)} is VALID [2022-04-08 06:04:42,355 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89527#true} {90141#(< ~counter~0 92)} #94#return; {90141#(< ~counter~0 92)} is VALID [2022-04-08 06:04:42,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,355 INFO L272 TraceCheckUtils]: 51: Hoare triple {90141#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {90141#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {90141#(< ~counter~0 92)} is VALID [2022-04-08 06:04:42,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {90166#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90141#(< ~counter~0 92)} is VALID [2022-04-08 06:04:42,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {90166#(< ~counter~0 91)} assume !(~r~0 < 0); {90166#(< ~counter~0 91)} is VALID [2022-04-08 06:04:42,357 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89527#true} {90166#(< ~counter~0 91)} #98#return; {90166#(< ~counter~0 91)} is VALID [2022-04-08 06:04:42,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,357 INFO L272 TraceCheckUtils]: 43: Hoare triple {90166#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {90166#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {90166#(< ~counter~0 91)} is VALID [2022-04-08 06:04:42,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {90191#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90166#(< ~counter~0 91)} is VALID [2022-04-08 06:04:42,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {90191#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90191#(< ~counter~0 90)} is VALID [2022-04-08 06:04:42,359 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89527#true} {90191#(< ~counter~0 90)} #98#return; {90191#(< ~counter~0 90)} is VALID [2022-04-08 06:04:42,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,359 INFO L272 TraceCheckUtils]: 35: Hoare triple {90191#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {90191#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {90191#(< ~counter~0 90)} is VALID [2022-04-08 06:04:42,360 INFO L290 TraceCheckUtils]: 33: Hoare triple {90216#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90191#(< ~counter~0 90)} is VALID [2022-04-08 06:04:42,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {90216#(< ~counter~0 89)} assume !(~r~0 > 0); {90216#(< ~counter~0 89)} is VALID [2022-04-08 06:04:42,361 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89527#true} {90216#(< ~counter~0 89)} #96#return; {90216#(< ~counter~0 89)} is VALID [2022-04-08 06:04:42,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,361 INFO L272 TraceCheckUtils]: 27: Hoare triple {90216#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {90216#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {90216#(< ~counter~0 89)} is VALID [2022-04-08 06:04:42,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {90241#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90216#(< ~counter~0 89)} is VALID [2022-04-08 06:04:42,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {90241#(< ~counter~0 88)} assume !!(0 != ~r~0); {90241#(< ~counter~0 88)} is VALID [2022-04-08 06:04:42,363 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89527#true} {90241#(< ~counter~0 88)} #94#return; {90241#(< ~counter~0 88)} is VALID [2022-04-08 06:04:42,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,363 INFO L272 TraceCheckUtils]: 19: Hoare triple {90241#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {90241#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {90241#(< ~counter~0 88)} is VALID [2022-04-08 06:04:42,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {90266#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90241#(< ~counter~0 88)} is VALID [2022-04-08 06:04:42,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {90266#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,364 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89527#true} {90266#(< ~counter~0 87)} #92#return; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L272 TraceCheckUtils]: 11: Hoare triple {90266#(< ~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)); {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89527#true} {90266#(< ~counter~0 87)} #90#return; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-08 06:04:42,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {90266#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89527#true} is VALID [2022-04-08 06:04:42,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {90266#(< ~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; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {90266#(< ~counter~0 87)} call #t~ret9 := main(); {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90266#(< ~counter~0 87)} {89527#true} #102#return; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {90266#(< ~counter~0 87)} assume true; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {89527#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {90266#(< ~counter~0 87)} is VALID [2022-04-08 06:04:42,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {89527#true} call ULTIMATE.init(); {89527#true} is VALID [2022-04-08 06:04:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 06:04:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:42,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116607695] [2022-04-08 06:04:42,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:42,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746641651] [2022-04-08 06:04:42,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746641651] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:42,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:42,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:04:42,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:42,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476478316] [2022-04-08 06:04:42,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476478316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:42,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:42,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:04:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687156168] [2022-04-08 06:04:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-08 06:04:42,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:42,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:42,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:42,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:04:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:04:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:04:42,469 INFO L87 Difference]: Start difference. First operand 650 states and 879 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:45,230 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-08 06:04:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 06:04:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-08 06:04:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 06:04:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-08 06:04:45,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-08 06:04:45,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:45,426 INFO L225 Difference]: With dead ends: 705 [2022-04-08 06:04:45,426 INFO L226 Difference]: Without dead ends: 694 [2022-04-08 06:04:45,427 INFO L912 BasicCegarLoop]: 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-08 06:04:45,427 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 194 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:45,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 322 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:04:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-08 06:04:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-08 06:04:46,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:46,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:46,679 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:46,679 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:46,704 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 06:04:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 06:04:46,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:46,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:46,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 06:04:46,705 INFO L87 Difference]: Start difference. First operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 694 states. [2022-04-08 06:04:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:46,722 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-08 06:04:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-08 06:04:46,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:46,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:46,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:46,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 502 states have (on average 1.2151394422310757) internal successors, (610), 512 states have internal predecessors, (610), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-08 06:04:46,743 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-08 06:04:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:46,743 INFO L478 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-08 06:04:46,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:46,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-08 06:04:48,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-08 06:04:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-08 06:04:48,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:04:48,975 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:04:48,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 06:04:49,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:49,191 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:04:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:04:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-08 06:04:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994282084] [2022-04-08 06:04:49,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:04:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-08 06:04:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:04:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65328717] [2022-04-08 06:04:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:04:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:04:49,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:04:49,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299025226] [2022-04-08 06:04:49,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:04:49,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:04:49,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:04:49,204 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:04:49,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 06:04:49,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:04:49,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:04:49,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:04:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:04:49,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:04:49,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {94482#true} call ULTIMATE.init(); {94482#true} is VALID [2022-04-08 06:04:49,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {94482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94490#(<= ~counter~0 0)} {94482#true} #102#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {94490#(<= ~counter~0 0)} call #t~ret9 := main(); {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {94490#(<= ~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; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,732 INFO L272 TraceCheckUtils]: 6: Hoare triple {94490#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {94490#(<= ~counter~0 0)} ~cond := #in~cond; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {94490#(<= ~counter~0 0)} assume !(0 == ~cond); {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94490#(<= ~counter~0 0)} {94490#(<= ~counter~0 0)} #90#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,733 INFO L272 TraceCheckUtils]: 11: Hoare triple {94490#(<= ~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)); {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {94490#(<= ~counter~0 0)} ~cond := #in~cond; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {94490#(<= ~counter~0 0)} assume !(0 == ~cond); {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94490#(<= ~counter~0 0)} {94490#(<= ~counter~0 0)} #92#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {94490#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94490#(<= ~counter~0 0)} is VALID [2022-04-08 06:04:49,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {94490#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {94539#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,737 INFO L272 TraceCheckUtils]: 19: Hoare triple {94539#(<= ~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)); {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {94539#(<= ~counter~0 1)} ~cond := #in~cond; {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {94539#(<= ~counter~0 1)} assume !(0 == ~cond); {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {94539#(<= ~counter~0 1)} assume true; {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,737 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94539#(<= ~counter~0 1)} {94539#(<= ~counter~0 1)} #94#return; {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {94539#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94539#(<= ~counter~0 1)} is VALID [2022-04-08 06:04:49,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {94539#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {94564#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,739 INFO L272 TraceCheckUtils]: 27: Hoare triple {94564#(<= ~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)); {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,739 INFO L290 TraceCheckUtils]: 28: Hoare triple {94564#(<= ~counter~0 2)} ~cond := #in~cond; {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {94564#(<= ~counter~0 2)} assume !(0 == ~cond); {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {94564#(<= ~counter~0 2)} assume true; {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,740 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94564#(<= ~counter~0 2)} {94564#(<= ~counter~0 2)} #96#return; {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {94564#(<= ~counter~0 2)} assume !(~r~0 > 0); {94564#(<= ~counter~0 2)} is VALID [2022-04-08 06:04:49,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {94564#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {94589#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,741 INFO L272 TraceCheckUtils]: 35: Hoare triple {94589#(<= ~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)); {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {94589#(<= ~counter~0 3)} ~cond := #in~cond; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {94589#(<= ~counter~0 3)} assume !(0 == ~cond); {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {94589#(<= ~counter~0 3)} assume true; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,742 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94589#(<= ~counter~0 3)} {94589#(<= ~counter~0 3)} #98#return; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {94589#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94589#(<= ~counter~0 3)} is VALID [2022-04-08 06:04:49,743 INFO L290 TraceCheckUtils]: 41: Hoare triple {94589#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {94614#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,743 INFO L272 TraceCheckUtils]: 43: Hoare triple {94614#(<= ~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)); {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {94614#(<= ~counter~0 4)} ~cond := #in~cond; {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {94614#(<= ~counter~0 4)} assume !(0 == ~cond); {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {94614#(<= ~counter~0 4)} assume true; {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,744 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94614#(<= ~counter~0 4)} {94614#(<= ~counter~0 4)} #98#return; {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {94614#(<= ~counter~0 4)} assume !(~r~0 < 0); {94614#(<= ~counter~0 4)} is VALID [2022-04-08 06:04:49,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {94614#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {94639#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,745 INFO L272 TraceCheckUtils]: 51: Hoare triple {94639#(<= ~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)); {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {94639#(<= ~counter~0 5)} ~cond := #in~cond; {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {94639#(<= ~counter~0 5)} assume !(0 == ~cond); {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,746 INFO L290 TraceCheckUtils]: 54: Hoare triple {94639#(<= ~counter~0 5)} assume true; {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,746 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94639#(<= ~counter~0 5)} {94639#(<= ~counter~0 5)} #94#return; {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {94639#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94639#(<= ~counter~0 5)} is VALID [2022-04-08 06:04:49,747 INFO L290 TraceCheckUtils]: 57: Hoare triple {94639#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {94664#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,748 INFO L272 TraceCheckUtils]: 59: Hoare triple {94664#(<= ~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)); {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {94664#(<= ~counter~0 6)} ~cond := #in~cond; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {94664#(<= ~counter~0 6)} assume !(0 == ~cond); {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {94664#(<= ~counter~0 6)} assume true; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,748 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94664#(<= ~counter~0 6)} {94664#(<= ~counter~0 6)} #96#return; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {94664#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94664#(<= ~counter~0 6)} is VALID [2022-04-08 06:04:49,749 INFO L290 TraceCheckUtils]: 65: Hoare triple {94664#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,749 INFO L290 TraceCheckUtils]: 66: Hoare triple {94689#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,750 INFO L272 TraceCheckUtils]: 67: Hoare triple {94689#(<= ~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)); {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,750 INFO L290 TraceCheckUtils]: 68: Hoare triple {94689#(<= ~counter~0 7)} ~cond := #in~cond; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,750 INFO L290 TraceCheckUtils]: 69: Hoare triple {94689#(<= ~counter~0 7)} assume !(0 == ~cond); {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,750 INFO L290 TraceCheckUtils]: 70: Hoare triple {94689#(<= ~counter~0 7)} assume true; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,751 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94689#(<= ~counter~0 7)} {94689#(<= ~counter~0 7)} #96#return; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,751 INFO L290 TraceCheckUtils]: 72: Hoare triple {94689#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94689#(<= ~counter~0 7)} is VALID [2022-04-08 06:04:49,752 INFO L290 TraceCheckUtils]: 73: Hoare triple {94689#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,752 INFO L290 TraceCheckUtils]: 74: Hoare triple {94714#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,752 INFO L272 TraceCheckUtils]: 75: Hoare triple {94714#(<= ~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)); {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,752 INFO L290 TraceCheckUtils]: 76: Hoare triple {94714#(<= ~counter~0 8)} ~cond := #in~cond; {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,752 INFO L290 TraceCheckUtils]: 77: Hoare triple {94714#(<= ~counter~0 8)} assume !(0 == ~cond); {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,753 INFO L290 TraceCheckUtils]: 78: Hoare triple {94714#(<= ~counter~0 8)} assume true; {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,753 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94714#(<= ~counter~0 8)} {94714#(<= ~counter~0 8)} #96#return; {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {94714#(<= ~counter~0 8)} assume !(~r~0 > 0); {94714#(<= ~counter~0 8)} is VALID [2022-04-08 06:04:49,754 INFO L290 TraceCheckUtils]: 81: Hoare triple {94714#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,754 INFO L290 TraceCheckUtils]: 82: Hoare triple {94739#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,754 INFO L272 TraceCheckUtils]: 83: Hoare triple {94739#(<= ~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)); {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {94739#(<= ~counter~0 9)} ~cond := #in~cond; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {94739#(<= ~counter~0 9)} assume !(0 == ~cond); {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {94739#(<= ~counter~0 9)} assume true; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,755 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94739#(<= ~counter~0 9)} {94739#(<= ~counter~0 9)} #98#return; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {94739#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {94739#(<= ~counter~0 9)} is VALID [2022-04-08 06:04:49,756 INFO L290 TraceCheckUtils]: 89: Hoare triple {94739#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,756 INFO L290 TraceCheckUtils]: 90: Hoare triple {94764#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,757 INFO L272 TraceCheckUtils]: 91: Hoare triple {94764#(<= ~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)); {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {94764#(<= ~counter~0 10)} ~cond := #in~cond; {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,757 INFO L290 TraceCheckUtils]: 93: Hoare triple {94764#(<= ~counter~0 10)} assume !(0 == ~cond); {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {94764#(<= ~counter~0 10)} assume true; {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,757 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94764#(<= ~counter~0 10)} {94764#(<= ~counter~0 10)} #98#return; {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {94764#(<= ~counter~0 10)} assume !(~r~0 < 0); {94764#(<= ~counter~0 10)} is VALID [2022-04-08 06:04:49,758 INFO L290 TraceCheckUtils]: 97: Hoare triple {94764#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {94789#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,759 INFO L272 TraceCheckUtils]: 99: Hoare triple {94789#(<= ~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)); {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,759 INFO L290 TraceCheckUtils]: 100: Hoare triple {94789#(<= ~counter~0 11)} ~cond := #in~cond; {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {94789#(<= ~counter~0 11)} assume !(0 == ~cond); {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {94789#(<= ~counter~0 11)} assume true; {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,760 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94789#(<= ~counter~0 11)} {94789#(<= ~counter~0 11)} #94#return; {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,760 INFO L290 TraceCheckUtils]: 104: Hoare triple {94789#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94789#(<= ~counter~0 11)} is VALID [2022-04-08 06:04:49,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {94789#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {94814#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,761 INFO L272 TraceCheckUtils]: 107: Hoare triple {94814#(<= ~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)); {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {94814#(<= ~counter~0 12)} ~cond := #in~cond; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {94814#(<= ~counter~0 12)} assume !(0 == ~cond); {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,762 INFO L290 TraceCheckUtils]: 110: Hoare triple {94814#(<= ~counter~0 12)} assume true; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,762 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94814#(<= ~counter~0 12)} {94814#(<= ~counter~0 12)} #96#return; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,762 INFO L290 TraceCheckUtils]: 112: Hoare triple {94814#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94814#(<= ~counter~0 12)} is VALID [2022-04-08 06:04:49,763 INFO L290 TraceCheckUtils]: 113: Hoare triple {94814#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,763 INFO L290 TraceCheckUtils]: 114: Hoare triple {94839#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,763 INFO L272 TraceCheckUtils]: 115: Hoare triple {94839#(<= ~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)); {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,763 INFO L290 TraceCheckUtils]: 116: Hoare triple {94839#(<= ~counter~0 13)} ~cond := #in~cond; {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,764 INFO L290 TraceCheckUtils]: 117: Hoare triple {94839#(<= ~counter~0 13)} assume !(0 == ~cond); {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,764 INFO L290 TraceCheckUtils]: 118: Hoare triple {94839#(<= ~counter~0 13)} assume true; {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,764 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94839#(<= ~counter~0 13)} {94839#(<= ~counter~0 13)} #96#return; {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,764 INFO L290 TraceCheckUtils]: 120: Hoare triple {94839#(<= ~counter~0 13)} assume !(~r~0 > 0); {94839#(<= ~counter~0 13)} is VALID [2022-04-08 06:04:49,764 INFO L290 TraceCheckUtils]: 121: Hoare triple {94839#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94864#(<= |main_#t~post8| 13)} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 122: Hoare triple {94864#(<= |main_#t~post8| 13)} assume !(#t~post8 < 100);havoc #t~post8; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 123: Hoare triple {94483#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 124: Hoare triple {94483#false} assume !(#t~post6 < 100);havoc #t~post6; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L272 TraceCheckUtils]: 125: Hoare triple {94483#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 126: Hoare triple {94483#false} ~cond := #in~cond; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 127: Hoare triple {94483#false} assume 0 == ~cond; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L290 TraceCheckUtils]: 128: Hoare triple {94483#false} assume !false; {94483#false} is VALID [2022-04-08 06:04:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:04:49,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 128: Hoare triple {94483#false} assume !false; {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 127: Hoare triple {94483#false} assume 0 == ~cond; {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 126: Hoare triple {94483#false} ~cond := #in~cond; {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L272 TraceCheckUtils]: 125: Hoare triple {94483#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 124: Hoare triple {94483#false} assume !(#t~post6 < 100);havoc #t~post6; {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 123: Hoare triple {94483#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94483#false} is VALID [2022-04-08 06:04:50,382 INFO L290 TraceCheckUtils]: 122: Hoare triple {94904#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {94483#false} is VALID [2022-04-08 06:04:50,383 INFO L290 TraceCheckUtils]: 121: Hoare triple {94908#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94904#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:04:50,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {94908#(< ~counter~0 100)} assume !(~r~0 > 0); {94908#(< ~counter~0 100)} is VALID [2022-04-08 06:04:50,383 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94482#true} {94908#(< ~counter~0 100)} #96#return; {94908#(< ~counter~0 100)} is VALID [2022-04-08 06:04:50,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,383 INFO L290 TraceCheckUtils]: 117: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,383 INFO L272 TraceCheckUtils]: 115: Hoare triple {94908#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,384 INFO L290 TraceCheckUtils]: 114: Hoare triple {94908#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {94908#(< ~counter~0 100)} is VALID [2022-04-08 06:04:50,385 INFO L290 TraceCheckUtils]: 113: Hoare triple {94933#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94908#(< ~counter~0 100)} is VALID [2022-04-08 06:04:50,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {94933#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94933#(< ~counter~0 99)} is VALID [2022-04-08 06:04:50,386 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94482#true} {94933#(< ~counter~0 99)} #96#return; {94933#(< ~counter~0 99)} is VALID [2022-04-08 06:04:50,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,386 INFO L290 TraceCheckUtils]: 109: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,386 INFO L272 TraceCheckUtils]: 107: Hoare triple {94933#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {94933#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {94933#(< ~counter~0 99)} is VALID [2022-04-08 06:04:50,387 INFO L290 TraceCheckUtils]: 105: Hoare triple {94958#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94933#(< ~counter~0 99)} is VALID [2022-04-08 06:04:50,387 INFO L290 TraceCheckUtils]: 104: Hoare triple {94958#(< ~counter~0 98)} assume !!(0 != ~r~0); {94958#(< ~counter~0 98)} is VALID [2022-04-08 06:04:50,387 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94482#true} {94958#(< ~counter~0 98)} #94#return; {94958#(< ~counter~0 98)} is VALID [2022-04-08 06:04:50,388 INFO L290 TraceCheckUtils]: 102: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,388 INFO L290 TraceCheckUtils]: 101: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,388 INFO L290 TraceCheckUtils]: 100: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,388 INFO L272 TraceCheckUtils]: 99: Hoare triple {94958#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {94958#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {94958#(< ~counter~0 98)} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {94983#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94958#(< ~counter~0 98)} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 96: Hoare triple {94983#(< ~counter~0 97)} assume !(~r~0 < 0); {94983#(< ~counter~0 97)} is VALID [2022-04-08 06:04:50,389 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94482#true} {94983#(< ~counter~0 97)} #98#return; {94983#(< ~counter~0 97)} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 94: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 92: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,389 INFO L272 TraceCheckUtils]: 91: Hoare triple {94983#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,389 INFO L290 TraceCheckUtils]: 90: Hoare triple {94983#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {94983#(< ~counter~0 97)} is VALID [2022-04-08 06:04:50,390 INFO L290 TraceCheckUtils]: 89: Hoare triple {95008#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94983#(< ~counter~0 97)} is VALID [2022-04-08 06:04:50,390 INFO L290 TraceCheckUtils]: 88: Hoare triple {95008#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95008#(< ~counter~0 96)} is VALID [2022-04-08 06:04:50,391 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94482#true} {95008#(< ~counter~0 96)} #98#return; {95008#(< ~counter~0 96)} is VALID [2022-04-08 06:04:50,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,391 INFO L272 TraceCheckUtils]: 83: Hoare triple {95008#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {95008#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {95008#(< ~counter~0 96)} is VALID [2022-04-08 06:04:50,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {95033#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95008#(< ~counter~0 96)} is VALID [2022-04-08 06:04:50,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {95033#(< ~counter~0 95)} assume !(~r~0 > 0); {95033#(< ~counter~0 95)} is VALID [2022-04-08 06:04:50,392 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94482#true} {95033#(< ~counter~0 95)} #96#return; {95033#(< ~counter~0 95)} is VALID [2022-04-08 06:04:50,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,393 INFO L272 TraceCheckUtils]: 75: Hoare triple {95033#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {95033#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {95033#(< ~counter~0 95)} is VALID [2022-04-08 06:04:50,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {95058#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95033#(< ~counter~0 95)} is VALID [2022-04-08 06:04:50,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {95058#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95058#(< ~counter~0 94)} is VALID [2022-04-08 06:04:50,394 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94482#true} {95058#(< ~counter~0 94)} #96#return; {95058#(< ~counter~0 94)} is VALID [2022-04-08 06:04:50,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,394 INFO L272 TraceCheckUtils]: 67: Hoare triple {95058#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {95058#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {95058#(< ~counter~0 94)} is VALID [2022-04-08 06:04:50,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {95083#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95058#(< ~counter~0 94)} is VALID [2022-04-08 06:04:50,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {95083#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95083#(< ~counter~0 93)} is VALID [2022-04-08 06:04:50,396 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94482#true} {95083#(< ~counter~0 93)} #96#return; {95083#(< ~counter~0 93)} is VALID [2022-04-08 06:04:50,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,396 INFO L272 TraceCheckUtils]: 59: Hoare triple {95083#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {95083#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {95083#(< ~counter~0 93)} is VALID [2022-04-08 06:04:50,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {95108#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95083#(< ~counter~0 93)} is VALID [2022-04-08 06:04:50,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {95108#(< ~counter~0 92)} assume !!(0 != ~r~0); {95108#(< ~counter~0 92)} is VALID [2022-04-08 06:04:50,397 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94482#true} {95108#(< ~counter~0 92)} #94#return; {95108#(< ~counter~0 92)} is VALID [2022-04-08 06:04:50,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,397 INFO L272 TraceCheckUtils]: 51: Hoare triple {95108#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {95108#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {95108#(< ~counter~0 92)} is VALID [2022-04-08 06:04:50,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {95133#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95108#(< ~counter~0 92)} is VALID [2022-04-08 06:04:50,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {95133#(< ~counter~0 91)} assume !(~r~0 < 0); {95133#(< ~counter~0 91)} is VALID [2022-04-08 06:04:50,399 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94482#true} {95133#(< ~counter~0 91)} #98#return; {95133#(< ~counter~0 91)} is VALID [2022-04-08 06:04:50,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,399 INFO L272 TraceCheckUtils]: 43: Hoare triple {95133#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {95133#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {95133#(< ~counter~0 91)} is VALID [2022-04-08 06:04:50,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {95158#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95133#(< ~counter~0 91)} is VALID [2022-04-08 06:04:50,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {95158#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95158#(< ~counter~0 90)} is VALID [2022-04-08 06:04:50,401 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94482#true} {95158#(< ~counter~0 90)} #98#return; {95158#(< ~counter~0 90)} is VALID [2022-04-08 06:04:50,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,401 INFO L272 TraceCheckUtils]: 35: Hoare triple {95158#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {95158#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {95158#(< ~counter~0 90)} is VALID [2022-04-08 06:04:50,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {95183#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95158#(< ~counter~0 90)} is VALID [2022-04-08 06:04:50,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {95183#(< ~counter~0 89)} assume !(~r~0 > 0); {95183#(< ~counter~0 89)} is VALID [2022-04-08 06:04:50,403 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94482#true} {95183#(< ~counter~0 89)} #96#return; {95183#(< ~counter~0 89)} is VALID [2022-04-08 06:04:50,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,403 INFO L272 TraceCheckUtils]: 27: Hoare triple {95183#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {95183#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {95183#(< ~counter~0 89)} is VALID [2022-04-08 06:04:50,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {95208#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95183#(< ~counter~0 89)} is VALID [2022-04-08 06:04:50,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {95208#(< ~counter~0 88)} assume !!(0 != ~r~0); {95208#(< ~counter~0 88)} is VALID [2022-04-08 06:04:50,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94482#true} {95208#(< ~counter~0 88)} #94#return; {95208#(< ~counter~0 88)} is VALID [2022-04-08 06:04:50,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {95208#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {95208#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {95208#(< ~counter~0 88)} is VALID [2022-04-08 06:04:50,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {95233#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95208#(< ~counter~0 88)} is VALID [2022-04-08 06:04:50,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {95233#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,406 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94482#true} {95233#(< ~counter~0 87)} #92#return; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {95233#(< ~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)); {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94482#true} {95233#(< ~counter~0 87)} #90#return; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-08 06:04:50,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {95233#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94482#true} is VALID [2022-04-08 06:04:50,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {95233#(< ~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; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {95233#(< ~counter~0 87)} call #t~ret9 := main(); {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95233#(< ~counter~0 87)} {94482#true} #102#return; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {95233#(< ~counter~0 87)} assume true; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {94482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {95233#(< ~counter~0 87)} is VALID [2022-04-08 06:04:50,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {94482#true} call ULTIMATE.init(); {94482#true} is VALID [2022-04-08 06:04:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 06:04:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:04:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65328717] [2022-04-08 06:04:50,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:04:50,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299025226] [2022-04-08 06:04:50,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299025226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:04:50,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:04:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:04:50,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:04:50,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994282084] [2022-04-08 06:04:50,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994282084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:04:50,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:04:50,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:04:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324283159] [2022-04-08 06:04:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:04:50,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-08 06:04:50,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:04:50,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:50,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:50,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:04:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:04:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:04:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:04:50,499 INFO L87 Difference]: Start difference. First operand 672 states and 914 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:53,025 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-08 06:04:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 06:04:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-08 06:04:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:04:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 06:04:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-08 06:04:53,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-08 06:04:54,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:04:54,297 INFO L225 Difference]: With dead ends: 893 [2022-04-08 06:04:54,297 INFO L226 Difference]: Without dead ends: 700 [2022-04-08 06:04:54,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 06:04:54,300 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 245 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:04:54,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 311 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:04:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-08 06:04:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-08 06:04:56,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:04:56,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:56,961 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:56,963 INFO L87 Difference]: Start difference. First operand 700 states. Second operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:56,981 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 06:04:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 06:04:56,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:56,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:56,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 06:04:56,983 INFO L87 Difference]: Start difference. First operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 700 states. [2022-04-08 06:04:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:04:57,000 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-08 06:04:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-08 06:04:57,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:04:57,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:04:57,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:04:57,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:04:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 520 states have (on average 1.2153846153846153) internal successors, (632), 524 states have internal predecessors, (632), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:04:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-08 06:04:57,023 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-08 06:04:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:04:57,023 INFO L478 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-08 06:04:57,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:04:57,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-08 06:05:02,007 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-08 06:05:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-08 06:05:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 06:05:02,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:02,008 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:05:02,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 06:05:02,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-08 06:05:02,215 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-08 06:05:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:02,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219192707] [2022-04-08 06:05:02,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-08 06:05:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:02,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547522518] [2022-04-08 06:05:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:02,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384971607] [2022-04-08 06:05:02,233 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:05:02,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:02,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:02,234 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:05:02,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 06:05:02,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:05:02,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:02,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 06:05:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:04,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {99875#true} call ULTIMATE.init(); {99875#true} is VALID [2022-04-08 06:05:04,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {99875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99883#(<= ~counter~0 0)} {99875#true} #102#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {99883#(<= ~counter~0 0)} call #t~ret9 := main(); {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {99883#(<= ~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; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {99883#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {99883#(<= ~counter~0 0)} ~cond := #in~cond; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {99883#(<= ~counter~0 0)} assume !(0 == ~cond); {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99883#(<= ~counter~0 0)} {99883#(<= ~counter~0 0)} #90#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {99883#(<= ~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)); {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {99883#(<= ~counter~0 0)} ~cond := #in~cond; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {99883#(<= ~counter~0 0)} assume !(0 == ~cond); {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,051 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99883#(<= ~counter~0 0)} {99883#(<= ~counter~0 0)} #92#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {99883#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {99883#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:04,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {99883#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {99932#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {99932#(<= ~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)); {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {99932#(<= ~counter~0 1)} ~cond := #in~cond; {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {99932#(<= ~counter~0 1)} assume !(0 == ~cond); {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {99932#(<= ~counter~0 1)} assume true; {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,056 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99932#(<= ~counter~0 1)} {99932#(<= ~counter~0 1)} #94#return; {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {99932#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99932#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:04,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {99932#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {99957#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,058 INFO L272 TraceCheckUtils]: 27: Hoare triple {99957#(<= ~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)); {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {99957#(<= ~counter~0 2)} ~cond := #in~cond; {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {99957#(<= ~counter~0 2)} assume !(0 == ~cond); {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {99957#(<= ~counter~0 2)} assume true; {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,059 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99957#(<= ~counter~0 2)} {99957#(<= ~counter~0 2)} #96#return; {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {99957#(<= ~counter~0 2)} assume !(~r~0 > 0); {99957#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:04,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {99957#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {99982#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,065 INFO L272 TraceCheckUtils]: 35: Hoare triple {99982#(<= ~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)); {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {99982#(<= ~counter~0 3)} ~cond := #in~cond; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {99982#(<= ~counter~0 3)} assume !(0 == ~cond); {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {99982#(<= ~counter~0 3)} assume true; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,066 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99982#(<= ~counter~0 3)} {99982#(<= ~counter~0 3)} #98#return; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {99982#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {99982#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:04,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {99982#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {100007#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,068 INFO L272 TraceCheckUtils]: 43: Hoare triple {100007#(<= ~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)); {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {100007#(<= ~counter~0 4)} ~cond := #in~cond; {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {100007#(<= ~counter~0 4)} assume !(0 == ~cond); {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,069 INFO L290 TraceCheckUtils]: 46: Hoare triple {100007#(<= ~counter~0 4)} assume true; {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,069 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100007#(<= ~counter~0 4)} {100007#(<= ~counter~0 4)} #98#return; {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {100007#(<= ~counter~0 4)} assume !(~r~0 < 0); {100007#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:04,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {100007#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {100032#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,072 INFO L272 TraceCheckUtils]: 51: Hoare triple {100032#(<= ~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)); {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {100032#(<= ~counter~0 5)} ~cond := #in~cond; {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {100032#(<= ~counter~0 5)} assume !(0 == ~cond); {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,072 INFO L290 TraceCheckUtils]: 54: Hoare triple {100032#(<= ~counter~0 5)} assume true; {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,073 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100032#(<= ~counter~0 5)} {100032#(<= ~counter~0 5)} #94#return; {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {100032#(<= ~counter~0 5)} assume !!(0 != ~r~0); {100032#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:04,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {100032#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {100057#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,075 INFO L272 TraceCheckUtils]: 59: Hoare triple {100057#(<= ~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)); {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,075 INFO L290 TraceCheckUtils]: 60: Hoare triple {100057#(<= ~counter~0 6)} ~cond := #in~cond; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {100057#(<= ~counter~0 6)} assume !(0 == ~cond); {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {100057#(<= ~counter~0 6)} assume true; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,076 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100057#(<= ~counter~0 6)} {100057#(<= ~counter~0 6)} #96#return; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {100057#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100057#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:04,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {100057#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {100082#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,078 INFO L272 TraceCheckUtils]: 67: Hoare triple {100082#(<= ~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)); {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,078 INFO L290 TraceCheckUtils]: 68: Hoare triple {100082#(<= ~counter~0 7)} ~cond := #in~cond; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {100082#(<= ~counter~0 7)} assume !(0 == ~cond); {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {100082#(<= ~counter~0 7)} assume true; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,079 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100082#(<= ~counter~0 7)} {100082#(<= ~counter~0 7)} #96#return; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {100082#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100082#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:04,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {100082#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {100107#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,081 INFO L272 TraceCheckUtils]: 75: Hoare triple {100107#(<= ~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)); {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,081 INFO L290 TraceCheckUtils]: 76: Hoare triple {100107#(<= ~counter~0 8)} ~cond := #in~cond; {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {100107#(<= ~counter~0 8)} assume !(0 == ~cond); {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {100107#(<= ~counter~0 8)} assume true; {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,082 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100107#(<= ~counter~0 8)} {100107#(<= ~counter~0 8)} #96#return; {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {100107#(<= ~counter~0 8)} assume !(~r~0 > 0); {100107#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:04,084 INFO L290 TraceCheckUtils]: 81: Hoare triple {100107#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,084 INFO L290 TraceCheckUtils]: 82: Hoare triple {100132#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,084 INFO L272 TraceCheckUtils]: 83: Hoare triple {100132#(<= ~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)); {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {100132#(<= ~counter~0 9)} ~cond := #in~cond; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {100132#(<= ~counter~0 9)} assume !(0 == ~cond); {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,085 INFO L290 TraceCheckUtils]: 86: Hoare triple {100132#(<= ~counter~0 9)} assume true; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,086 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100132#(<= ~counter~0 9)} {100132#(<= ~counter~0 9)} #98#return; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,086 INFO L290 TraceCheckUtils]: 88: Hoare triple {100132#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100132#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:04,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {100132#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {100157#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,087 INFO L272 TraceCheckUtils]: 91: Hoare triple {100157#(<= ~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)); {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {100157#(<= ~counter~0 10)} ~cond := #in~cond; {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {100157#(<= ~counter~0 10)} assume !(0 == ~cond); {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {100157#(<= ~counter~0 10)} assume true; {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,089 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100157#(<= ~counter~0 10)} {100157#(<= ~counter~0 10)} #98#return; {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,089 INFO L290 TraceCheckUtils]: 96: Hoare triple {100157#(<= ~counter~0 10)} assume !(~r~0 < 0); {100157#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:04,090 INFO L290 TraceCheckUtils]: 97: Hoare triple {100157#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,090 INFO L290 TraceCheckUtils]: 98: Hoare triple {100182#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,091 INFO L272 TraceCheckUtils]: 99: Hoare triple {100182#(<= ~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)); {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,091 INFO L290 TraceCheckUtils]: 100: Hoare triple {100182#(<= ~counter~0 11)} ~cond := #in~cond; {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,092 INFO L290 TraceCheckUtils]: 101: Hoare triple {100182#(<= ~counter~0 11)} assume !(0 == ~cond); {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,092 INFO L290 TraceCheckUtils]: 102: Hoare triple {100182#(<= ~counter~0 11)} assume true; {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,092 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100182#(<= ~counter~0 11)} {100182#(<= ~counter~0 11)} #94#return; {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {100182#(<= ~counter~0 11)} assume !!(0 != ~r~0); {100182#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:04,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {100182#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {100207#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,101 INFO L272 TraceCheckUtils]: 107: Hoare triple {100207#(<= ~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)); {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {100207#(<= ~counter~0 12)} ~cond := #in~cond; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,102 INFO L290 TraceCheckUtils]: 109: Hoare triple {100207#(<= ~counter~0 12)} assume !(0 == ~cond); {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {100207#(<= ~counter~0 12)} assume true; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,111 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100207#(<= ~counter~0 12)} {100207#(<= ~counter~0 12)} #96#return; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {100207#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100207#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:04,114 INFO L290 TraceCheckUtils]: 113: Hoare triple {100207#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,114 INFO L290 TraceCheckUtils]: 114: Hoare triple {100232#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,115 INFO L272 TraceCheckUtils]: 115: Hoare triple {100232#(<= ~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)); {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,115 INFO L290 TraceCheckUtils]: 116: Hoare triple {100232#(<= ~counter~0 13)} ~cond := #in~cond; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,115 INFO L290 TraceCheckUtils]: 117: Hoare triple {100232#(<= ~counter~0 13)} assume !(0 == ~cond); {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {100232#(<= ~counter~0 13)} assume true; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,116 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100232#(<= ~counter~0 13)} {100232#(<= ~counter~0 13)} #96#return; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,116 INFO L290 TraceCheckUtils]: 120: Hoare triple {100232#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100232#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:04,117 INFO L290 TraceCheckUtils]: 121: Hoare triple {100232#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100257#(<= |main_#t~post7| 13)} is VALID [2022-04-08 06:05:04,117 INFO L290 TraceCheckUtils]: 122: Hoare triple {100257#(<= |main_#t~post7| 13)} assume !(#t~post7 < 100);havoc #t~post7; {99876#false} is VALID [2022-04-08 06:05:04,117 INFO L290 TraceCheckUtils]: 123: Hoare triple {99876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99876#false} is VALID [2022-04-08 06:05:04,117 INFO L290 TraceCheckUtils]: 124: Hoare triple {99876#false} assume !(#t~post8 < 100);havoc #t~post8; {99876#false} is VALID [2022-04-08 06:05:04,117 INFO L290 TraceCheckUtils]: 125: Hoare triple {99876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L290 TraceCheckUtils]: 126: Hoare triple {99876#false} assume !(#t~post6 < 100);havoc #t~post6; {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L272 TraceCheckUtils]: 127: Hoare triple {99876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L290 TraceCheckUtils]: 128: Hoare triple {99876#false} ~cond := #in~cond; {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L290 TraceCheckUtils]: 129: Hoare triple {99876#false} assume 0 == ~cond; {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L290 TraceCheckUtils]: 130: Hoare triple {99876#false} assume !false; {99876#false} is VALID [2022-04-08 06:05:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:05:04,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 130: Hoare triple {99876#false} assume !false; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 129: Hoare triple {99876#false} assume 0 == ~cond; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 128: Hoare triple {99876#false} ~cond := #in~cond; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L272 TraceCheckUtils]: 127: Hoare triple {99876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 126: Hoare triple {99876#false} assume !(#t~post6 < 100);havoc #t~post6; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 125: Hoare triple {99876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 124: Hoare triple {99876#false} assume !(#t~post8 < 100);havoc #t~post8; {99876#false} is VALID [2022-04-08 06:05:05,672 INFO L290 TraceCheckUtils]: 123: Hoare triple {99876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99876#false} is VALID [2022-04-08 06:05:05,673 INFO L290 TraceCheckUtils]: 122: Hoare triple {100309#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {99876#false} is VALID [2022-04-08 06:05:05,673 INFO L290 TraceCheckUtils]: 121: Hoare triple {100313#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100309#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:05:05,673 INFO L290 TraceCheckUtils]: 120: Hoare triple {100313#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100313#(< ~counter~0 100)} is VALID [2022-04-08 06:05:05,674 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99875#true} {100313#(< ~counter~0 100)} #96#return; {100313#(< ~counter~0 100)} is VALID [2022-04-08 06:05:05,674 INFO L290 TraceCheckUtils]: 118: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,674 INFO L290 TraceCheckUtils]: 117: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,674 INFO L290 TraceCheckUtils]: 116: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,674 INFO L272 TraceCheckUtils]: 115: Hoare triple {100313#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,674 INFO L290 TraceCheckUtils]: 114: Hoare triple {100313#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {100313#(< ~counter~0 100)} is VALID [2022-04-08 06:05:05,676 INFO L290 TraceCheckUtils]: 113: Hoare triple {100338#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100313#(< ~counter~0 100)} is VALID [2022-04-08 06:05:05,677 INFO L290 TraceCheckUtils]: 112: Hoare triple {100338#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100338#(< ~counter~0 99)} is VALID [2022-04-08 06:05:05,677 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99875#true} {100338#(< ~counter~0 99)} #96#return; {100338#(< ~counter~0 99)} is VALID [2022-04-08 06:05:05,677 INFO L290 TraceCheckUtils]: 110: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,677 INFO L290 TraceCheckUtils]: 109: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,677 INFO L290 TraceCheckUtils]: 108: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,677 INFO L272 TraceCheckUtils]: 107: Hoare triple {100338#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,677 INFO L290 TraceCheckUtils]: 106: Hoare triple {100338#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {100338#(< ~counter~0 99)} is VALID [2022-04-08 06:05:05,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {100363#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100338#(< ~counter~0 99)} is VALID [2022-04-08 06:05:05,679 INFO L290 TraceCheckUtils]: 104: Hoare triple {100363#(< ~counter~0 98)} assume !!(0 != ~r~0); {100363#(< ~counter~0 98)} is VALID [2022-04-08 06:05:05,679 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99875#true} {100363#(< ~counter~0 98)} #94#return; {100363#(< ~counter~0 98)} is VALID [2022-04-08 06:05:05,679 INFO L290 TraceCheckUtils]: 102: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,679 INFO L290 TraceCheckUtils]: 101: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,679 INFO L290 TraceCheckUtils]: 100: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,679 INFO L272 TraceCheckUtils]: 99: Hoare triple {100363#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {100363#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {100363#(< ~counter~0 98)} is VALID [2022-04-08 06:05:05,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {100388#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100363#(< ~counter~0 98)} is VALID [2022-04-08 06:05:05,681 INFO L290 TraceCheckUtils]: 96: Hoare triple {100388#(< ~counter~0 97)} assume !(~r~0 < 0); {100388#(< ~counter~0 97)} is VALID [2022-04-08 06:05:05,681 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99875#true} {100388#(< ~counter~0 97)} #98#return; {100388#(< ~counter~0 97)} is VALID [2022-04-08 06:05:05,681 INFO L290 TraceCheckUtils]: 94: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,681 INFO L290 TraceCheckUtils]: 92: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,681 INFO L272 TraceCheckUtils]: 91: Hoare triple {100388#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,682 INFO L290 TraceCheckUtils]: 90: Hoare triple {100388#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {100388#(< ~counter~0 97)} is VALID [2022-04-08 06:05:05,682 INFO L290 TraceCheckUtils]: 89: Hoare triple {100413#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100388#(< ~counter~0 97)} is VALID [2022-04-08 06:05:05,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {100413#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100413#(< ~counter~0 96)} is VALID [2022-04-08 06:05:05,683 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99875#true} {100413#(< ~counter~0 96)} #98#return; {100413#(< ~counter~0 96)} is VALID [2022-04-08 06:05:05,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,683 INFO L290 TraceCheckUtils]: 84: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,683 INFO L272 TraceCheckUtils]: 83: Hoare triple {100413#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {100413#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {100413#(< ~counter~0 96)} is VALID [2022-04-08 06:05:05,685 INFO L290 TraceCheckUtils]: 81: Hoare triple {100438#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100413#(< ~counter~0 96)} is VALID [2022-04-08 06:05:05,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {100438#(< ~counter~0 95)} assume !(~r~0 > 0); {100438#(< ~counter~0 95)} is VALID [2022-04-08 06:05:05,685 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99875#true} {100438#(< ~counter~0 95)} #96#return; {100438#(< ~counter~0 95)} is VALID [2022-04-08 06:05:05,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,685 INFO L272 TraceCheckUtils]: 75: Hoare triple {100438#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,686 INFO L290 TraceCheckUtils]: 74: Hoare triple {100438#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {100438#(< ~counter~0 95)} is VALID [2022-04-08 06:05:05,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {100463#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100438#(< ~counter~0 95)} is VALID [2022-04-08 06:05:05,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {100463#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100463#(< ~counter~0 94)} is VALID [2022-04-08 06:05:05,687 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99875#true} {100463#(< ~counter~0 94)} #96#return; {100463#(< ~counter~0 94)} is VALID [2022-04-08 06:05:05,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,688 INFO L272 TraceCheckUtils]: 67: Hoare triple {100463#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {100463#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {100463#(< ~counter~0 94)} is VALID [2022-04-08 06:05:05,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {100488#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100463#(< ~counter~0 94)} is VALID [2022-04-08 06:05:05,689 INFO L290 TraceCheckUtils]: 64: Hoare triple {100488#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100488#(< ~counter~0 93)} is VALID [2022-04-08 06:05:05,689 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99875#true} {100488#(< ~counter~0 93)} #96#return; {100488#(< ~counter~0 93)} is VALID [2022-04-08 06:05:05,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,690 INFO L272 TraceCheckUtils]: 59: Hoare triple {100488#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,690 INFO L290 TraceCheckUtils]: 58: Hoare triple {100488#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {100488#(< ~counter~0 93)} is VALID [2022-04-08 06:05:05,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {100513#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100488#(< ~counter~0 93)} is VALID [2022-04-08 06:05:05,691 INFO L290 TraceCheckUtils]: 56: Hoare triple {100513#(< ~counter~0 92)} assume !!(0 != ~r~0); {100513#(< ~counter~0 92)} is VALID [2022-04-08 06:05:05,691 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99875#true} {100513#(< ~counter~0 92)} #94#return; {100513#(< ~counter~0 92)} is VALID [2022-04-08 06:05:05,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,692 INFO L272 TraceCheckUtils]: 51: Hoare triple {100513#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {100513#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {100513#(< ~counter~0 92)} is VALID [2022-04-08 06:05:05,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {100538#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100513#(< ~counter~0 92)} is VALID [2022-04-08 06:05:05,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {100538#(< ~counter~0 91)} assume !(~r~0 < 0); {100538#(< ~counter~0 91)} is VALID [2022-04-08 06:05:05,693 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99875#true} {100538#(< ~counter~0 91)} #98#return; {100538#(< ~counter~0 91)} is VALID [2022-04-08 06:05:05,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,694 INFO L272 TraceCheckUtils]: 43: Hoare triple {100538#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {100538#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {100538#(< ~counter~0 91)} is VALID [2022-04-08 06:05:05,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {100563#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100538#(< ~counter~0 91)} is VALID [2022-04-08 06:05:05,695 INFO L290 TraceCheckUtils]: 40: Hoare triple {100563#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100563#(< ~counter~0 90)} is VALID [2022-04-08 06:05:05,696 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99875#true} {100563#(< ~counter~0 90)} #98#return; {100563#(< ~counter~0 90)} is VALID [2022-04-08 06:05:05,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,696 INFO L272 TraceCheckUtils]: 35: Hoare triple {100563#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {100563#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {100563#(< ~counter~0 90)} is VALID [2022-04-08 06:05:05,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {100588#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100563#(< ~counter~0 90)} is VALID [2022-04-08 06:05:05,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {100588#(< ~counter~0 89)} assume !(~r~0 > 0); {100588#(< ~counter~0 89)} is VALID [2022-04-08 06:05:05,698 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99875#true} {100588#(< ~counter~0 89)} #96#return; {100588#(< ~counter~0 89)} is VALID [2022-04-08 06:05:05,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,698 INFO L272 TraceCheckUtils]: 27: Hoare triple {100588#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {100588#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {100588#(< ~counter~0 89)} is VALID [2022-04-08 06:05:05,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {100613#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100588#(< ~counter~0 89)} is VALID [2022-04-08 06:05:05,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {100613#(< ~counter~0 88)} assume !!(0 != ~r~0); {100613#(< ~counter~0 88)} is VALID [2022-04-08 06:05:05,700 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99875#true} {100613#(< ~counter~0 88)} #94#return; {100613#(< ~counter~0 88)} is VALID [2022-04-08 06:05:05,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,700 INFO L272 TraceCheckUtils]: 19: Hoare triple {100613#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {100613#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {100613#(< ~counter~0 88)} is VALID [2022-04-08 06:05:05,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {100638#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100613#(< ~counter~0 88)} is VALID [2022-04-08 06:05:05,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {100638#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,702 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99875#true} {100638#(< ~counter~0 87)} #92#return; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L272 TraceCheckUtils]: 11: Hoare triple {100638#(< ~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)); {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99875#true} {100638#(< ~counter~0 87)} #90#return; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-08 06:05:05,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-08 06:05:05,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {100638#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99875#true} is VALID [2022-04-08 06:05:05,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {100638#(< ~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; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {100638#(< ~counter~0 87)} call #t~ret9 := main(); {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100638#(< ~counter~0 87)} {99875#true} #102#return; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {100638#(< ~counter~0 87)} assume true; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {99875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {100638#(< ~counter~0 87)} is VALID [2022-04-08 06:05:05,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {99875#true} call ULTIMATE.init(); {99875#true} is VALID [2022-04-08 06:05:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-08 06:05:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547522518] [2022-04-08 06:05:05,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384971607] [2022-04-08 06:05:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384971607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:05,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-08 06:05:05,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219192707] [2022-04-08 06:05:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219192707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:05,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 06:05:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934326400] [2022-04-08 06:05:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-08 06:05:05,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:05,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:05:05,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:05,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 06:05:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 06:05:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-08 06:05:05,826 INFO L87 Difference]: Start difference. First operand 690 states and 936 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:05:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:09,316 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-08 06:05:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 06:05:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-08 06:05:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:05:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 06:05:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:05:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-08 06:05:09,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-08 06:05:09,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:09,632 INFO L225 Difference]: With dead ends: 903 [2022-04-08 06:05:09,632 INFO L226 Difference]: Without dead ends: 706 [2022-04-08 06:05:09,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 06:05:09,648 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 196 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:09,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 301 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:05:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-08 06:05:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-08 06:05:12,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:12,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:05:12,227 INFO L74 IsIncluded]: Start isIncluded. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:05:12,227 INFO L87 Difference]: Start difference. First operand 706 states. Second operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:05:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:12,245 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 06:05:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:05:12,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:12,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:12,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 06:05:12,246 INFO L87 Difference]: Start difference. First operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 706 states. [2022-04-08 06:05:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:12,263 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-08 06:05:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:05:12,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:12,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:12,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:12,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 536 states have (on average 1.208955223880597) internal successors, (648), 536 states have internal predecessors, (648), 153 states have call successors, (153), 18 states have call predecessors, (153), 16 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-08 06:05:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-08 06:05:12,295 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-08 06:05:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:12,295 INFO L478 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-08 06:05:12,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-08 06:05:12,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-08 06:05:16,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 951 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-08 06:05:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 06:05:16,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:16,211 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:05:16,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 06:05:16,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:16,412 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-08 06:05:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:16,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382560672] [2022-04-08 06:05:16,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-08 06:05:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:16,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452261052] [2022-04-08 06:05:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:16,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:16,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400523504] [2022-04-08 06:05:16,450 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:05:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:16,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:16,450 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:05:16,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 06:05:16,550 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 06:05:16,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:16,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:05:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:16,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:17,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {105346#true} call ULTIMATE.init(); {105346#true} is VALID [2022-04-08 06:05:17,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {105346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {105346#true} is VALID [2022-04-08 06:05:17,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105346#true} {105346#true} #102#return; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {105346#true} call #t~ret9 := main(); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {105346#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; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {105346#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105346#true} {105346#true} #90#return; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L272 TraceCheckUtils]: 11: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105346#true} {105346#true} #92#return; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {105346#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {105346#true} assume !!(#t~post6 < 100);havoc #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L272 TraceCheckUtils]: 27: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {105346#true} assume !(~r~0 > 0); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {105346#true} assume !!(#t~post8 < 100);havoc #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L272 TraceCheckUtils]: 35: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {105346#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {105346#true} assume !!(#t~post8 < 100);havoc #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,327 INFO L272 TraceCheckUtils]: 43: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 46: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {105346#true} assume !(~r~0 < 0); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 50: Hoare triple {105346#true} assume !!(#t~post6 < 100);havoc #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L272 TraceCheckUtils]: 51: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 52: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 53: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 56: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 57: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 58: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L272 TraceCheckUtils]: 59: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 62: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,328 INFO L290 TraceCheckUtils]: 64: Hoare triple {105346#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L272 TraceCheckUtils]: 67: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {105346#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 73: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L272 TraceCheckUtils]: 75: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 80: Hoare triple {105346#true} assume !(~r~0 > 0); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 81: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 82: Hoare triple {105346#true} assume !!(#t~post8 < 100);havoc #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L272 TraceCheckUtils]: 83: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 84: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,329 INFO L290 TraceCheckUtils]: 85: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 86: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 88: Hoare triple {105346#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 90: Hoare triple {105346#true} assume !!(#t~post8 < 100);havoc #t~post8; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L272 TraceCheckUtils]: 91: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 93: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 94: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {105346#true} assume !(~r~0 < 0); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 97: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 98: Hoare triple {105346#true} assume !!(#t~post6 < 100);havoc #t~post6; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L272 TraceCheckUtils]: 99: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 100: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 101: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 102: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 104: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-08 06:05:17,330 INFO L290 TraceCheckUtils]: 105: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 106: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L272 TraceCheckUtils]: 107: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 108: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 109: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 110: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 112: Hoare triple {105346#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 113: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 114: Hoare triple {105346#true} assume !!(#t~post7 < 100);havoc #t~post7; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L272 TraceCheckUtils]: 115: Hoare triple {105346#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)); {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 116: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 117: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 118: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-08 06:05:17,331 INFO L290 TraceCheckUtils]: 120: Hoare triple {105346#true} assume !(~r~0 > 0); {105711#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:05:17,332 INFO L290 TraceCheckUtils]: 121: Hoare triple {105711#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105711#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:05:17,332 INFO L290 TraceCheckUtils]: 122: Hoare triple {105711#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {105711#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:05:17,332 INFO L272 TraceCheckUtils]: 123: Hoare triple {105711#(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)); {105346#true} is VALID [2022-04-08 06:05:17,332 INFO L290 TraceCheckUtils]: 124: Hoare triple {105346#true} ~cond := #in~cond; {105724#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:05:17,332 INFO L290 TraceCheckUtils]: 125: Hoare triple {105724#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {105728#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:05:17,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {105728#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {105728#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:05:17,333 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {105728#(not (= |__VERIFIER_assert_#in~cond| 0))} {105711#(not (< 0 main_~r~0))} #98#return; {105735#(and (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:05:17,335 INFO L290 TraceCheckUtils]: 128: Hoare triple {105735#(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); {105739#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 06:05:17,336 INFO L290 TraceCheckUtils]: 129: Hoare triple {105739#(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; {105739#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 06:05:17,336 INFO L290 TraceCheckUtils]: 130: Hoare triple {105739#(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; {105739#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-08 06:05:17,338 INFO L272 TraceCheckUtils]: 131: Hoare triple {105739#(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)); {105749#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:05:17,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {105749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:05:17,338 INFO L290 TraceCheckUtils]: 133: Hoare triple {105753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {105347#false} is VALID [2022-04-08 06:05:17,338 INFO L290 TraceCheckUtils]: 134: Hoare triple {105347#false} assume !false; {105347#false} is VALID [2022-04-08 06:05:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-08 06:05:17,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:19,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452261052] [2022-04-08 06:05:19,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400523504] [2022-04-08 06:05:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400523504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 06:05:19,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:05:19,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-08 06:05:19,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:19,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382560672] [2022-04-08 06:05:19,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382560672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:19,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:19,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:05:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088065371] [2022-04-08 06:05:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-08 06:05:19,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:19,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:05:19,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:19,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:05:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:05:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-08 06:05:19,902 INFO L87 Difference]: Start difference. First operand 706 states and 952 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:05:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:23,417 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-08 06:05:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:05:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-08 06:05:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:23,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:05:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 06:05:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:05:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-08 06:05:23,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-08 06:05:23,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:23,560 INFO L225 Difference]: With dead ends: 758 [2022-04-08 06:05:23,560 INFO L226 Difference]: Without dead ends: 746 [2022-04-08 06:05:23,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-08 06:05:23,561 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 35 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:23,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 236 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:05:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-08 06:05:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-08 06:05:26,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:26,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:05:26,101 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:05:26,101 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:05:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:26,125 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 06:05:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 06:05:26,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:26,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:26,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 06:05:26,128 INFO L87 Difference]: Start difference. First operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 746 states. [2022-04-08 06:05:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:26,148 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-08 06:05:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-08 06:05:26,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:26,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:26,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:26,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 515 states have (on average 1.192233009708738) internal successors, (614), 522 states have internal predecessors, (614), 150 states have call successors, (150), 19 states have call predecessors, (150), 17 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-08 06:05:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-08 06:05:26,183 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-08 06:05:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:26,183 INFO L478 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-08 06:05:26,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:05:26,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-08 06:05:28,531 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-08 06:05:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-08 06:05:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 06:05:28,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:28,532 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:05:28,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-08 06:05:28,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-08 06:05:28,733 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-08 06:05:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:28,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154362702] [2022-04-08 06:05:28,734 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-08 06:05:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:28,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235054949] [2022-04-08 06:05:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:28,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:28,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630558447] [2022-04-08 06:05:28,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:05:28,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:28,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:28,764 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:05:28,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 06:05:28,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:05:28,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:28,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 06:05:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:28,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:05:29,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {110166#true} call ULTIMATE.init(); {110166#true} is VALID [2022-04-08 06:05:29,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {110166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110174#(<= ~counter~0 0)} {110166#true} #102#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {110174#(<= ~counter~0 0)} call #t~ret9 := main(); {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {110174#(<= ~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; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {110174#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {110174#(<= ~counter~0 0)} ~cond := #in~cond; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {110174#(<= ~counter~0 0)} assume !(0 == ~cond); {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110174#(<= ~counter~0 0)} {110174#(<= ~counter~0 0)} #90#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {110174#(<= ~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)); {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {110174#(<= ~counter~0 0)} ~cond := #in~cond; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {110174#(<= ~counter~0 0)} assume !(0 == ~cond); {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110174#(<= ~counter~0 0)} {110174#(<= ~counter~0 0)} #92#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {110174#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110174#(<= ~counter~0 0)} is VALID [2022-04-08 06:05:29,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {110174#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {110223#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,685 INFO L272 TraceCheckUtils]: 19: Hoare triple {110223#(<= ~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)); {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {110223#(<= ~counter~0 1)} ~cond := #in~cond; {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {110223#(<= ~counter~0 1)} assume !(0 == ~cond); {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {110223#(<= ~counter~0 1)} assume true; {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,686 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {110223#(<= ~counter~0 1)} {110223#(<= ~counter~0 1)} #94#return; {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {110223#(<= ~counter~0 1)} assume !!(0 != ~r~0); {110223#(<= ~counter~0 1)} is VALID [2022-04-08 06:05:29,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {110223#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {110248#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,688 INFO L272 TraceCheckUtils]: 27: Hoare triple {110248#(<= ~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)); {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {110248#(<= ~counter~0 2)} ~cond := #in~cond; {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {110248#(<= ~counter~0 2)} assume !(0 == ~cond); {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {110248#(<= ~counter~0 2)} assume true; {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,690 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {110248#(<= ~counter~0 2)} {110248#(<= ~counter~0 2)} #96#return; {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {110248#(<= ~counter~0 2)} assume !(~r~0 > 0); {110248#(<= ~counter~0 2)} is VALID [2022-04-08 06:05:29,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {110248#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {110273#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,692 INFO L272 TraceCheckUtils]: 35: Hoare triple {110273#(<= ~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)); {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {110273#(<= ~counter~0 3)} ~cond := #in~cond; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {110273#(<= ~counter~0 3)} assume !(0 == ~cond); {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {110273#(<= ~counter~0 3)} assume true; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,693 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110273#(<= ~counter~0 3)} {110273#(<= ~counter~0 3)} #98#return; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {110273#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110273#(<= ~counter~0 3)} is VALID [2022-04-08 06:05:29,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {110273#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {110298#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,695 INFO L272 TraceCheckUtils]: 43: Hoare triple {110298#(<= ~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)); {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {110298#(<= ~counter~0 4)} ~cond := #in~cond; {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {110298#(<= ~counter~0 4)} assume !(0 == ~cond); {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {110298#(<= ~counter~0 4)} assume true; {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,696 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {110298#(<= ~counter~0 4)} {110298#(<= ~counter~0 4)} #98#return; {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {110298#(<= ~counter~0 4)} assume !(~r~0 < 0); {110298#(<= ~counter~0 4)} is VALID [2022-04-08 06:05:29,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {110298#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {110323#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,698 INFO L272 TraceCheckUtils]: 51: Hoare triple {110323#(<= ~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)); {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {110323#(<= ~counter~0 5)} ~cond := #in~cond; {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {110323#(<= ~counter~0 5)} assume !(0 == ~cond); {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {110323#(<= ~counter~0 5)} assume true; {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,699 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {110323#(<= ~counter~0 5)} {110323#(<= ~counter~0 5)} #94#return; {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {110323#(<= ~counter~0 5)} assume !!(0 != ~r~0); {110323#(<= ~counter~0 5)} is VALID [2022-04-08 06:05:29,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {110323#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {110348#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,701 INFO L272 TraceCheckUtils]: 59: Hoare triple {110348#(<= ~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)); {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {110348#(<= ~counter~0 6)} ~cond := #in~cond; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {110348#(<= ~counter~0 6)} assume !(0 == ~cond); {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {110348#(<= ~counter~0 6)} assume true; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,702 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110348#(<= ~counter~0 6)} {110348#(<= ~counter~0 6)} #96#return; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {110348#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110348#(<= ~counter~0 6)} is VALID [2022-04-08 06:05:29,704 INFO L290 TraceCheckUtils]: 65: Hoare triple {110348#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {110373#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,704 INFO L272 TraceCheckUtils]: 67: Hoare triple {110373#(<= ~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)); {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {110373#(<= ~counter~0 7)} ~cond := #in~cond; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {110373#(<= ~counter~0 7)} assume !(0 == ~cond); {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {110373#(<= ~counter~0 7)} assume true; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,715 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {110373#(<= ~counter~0 7)} {110373#(<= ~counter~0 7)} #96#return; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {110373#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110373#(<= ~counter~0 7)} is VALID [2022-04-08 06:05:29,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {110373#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {110398#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,718 INFO L272 TraceCheckUtils]: 75: Hoare triple {110398#(<= ~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)); {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {110398#(<= ~counter~0 8)} ~cond := #in~cond; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,718 INFO L290 TraceCheckUtils]: 77: Hoare triple {110398#(<= ~counter~0 8)} assume !(0 == ~cond); {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,718 INFO L290 TraceCheckUtils]: 78: Hoare triple {110398#(<= ~counter~0 8)} assume true; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,719 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110398#(<= ~counter~0 8)} {110398#(<= ~counter~0 8)} #96#return; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {110398#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110398#(<= ~counter~0 8)} is VALID [2022-04-08 06:05:29,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {110398#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {110423#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,720 INFO L272 TraceCheckUtils]: 83: Hoare triple {110423#(<= ~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)); {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {110423#(<= ~counter~0 9)} ~cond := #in~cond; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {110423#(<= ~counter~0 9)} assume !(0 == ~cond); {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {110423#(<= ~counter~0 9)} assume true; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,721 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {110423#(<= ~counter~0 9)} {110423#(<= ~counter~0 9)} #96#return; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {110423#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110423#(<= ~counter~0 9)} is VALID [2022-04-08 06:05:29,722 INFO L290 TraceCheckUtils]: 89: Hoare triple {110423#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {110448#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,723 INFO L272 TraceCheckUtils]: 91: Hoare triple {110448#(<= ~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)); {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,723 INFO L290 TraceCheckUtils]: 92: Hoare triple {110448#(<= ~counter~0 10)} ~cond := #in~cond; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,723 INFO L290 TraceCheckUtils]: 93: Hoare triple {110448#(<= ~counter~0 10)} assume !(0 == ~cond); {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {110448#(<= ~counter~0 10)} assume true; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,724 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110448#(<= ~counter~0 10)} {110448#(<= ~counter~0 10)} #96#return; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,724 INFO L290 TraceCheckUtils]: 96: Hoare triple {110448#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110448#(<= ~counter~0 10)} is VALID [2022-04-08 06:05:29,725 INFO L290 TraceCheckUtils]: 97: Hoare triple {110448#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,725 INFO L290 TraceCheckUtils]: 98: Hoare triple {110473#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,725 INFO L272 TraceCheckUtils]: 99: Hoare triple {110473#(<= ~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)); {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,726 INFO L290 TraceCheckUtils]: 100: Hoare triple {110473#(<= ~counter~0 11)} ~cond := #in~cond; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,726 INFO L290 TraceCheckUtils]: 101: Hoare triple {110473#(<= ~counter~0 11)} assume !(0 == ~cond); {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,726 INFO L290 TraceCheckUtils]: 102: Hoare triple {110473#(<= ~counter~0 11)} assume true; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,726 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110473#(<= ~counter~0 11)} {110473#(<= ~counter~0 11)} #96#return; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,727 INFO L290 TraceCheckUtils]: 104: Hoare triple {110473#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110473#(<= ~counter~0 11)} is VALID [2022-04-08 06:05:29,727 INFO L290 TraceCheckUtils]: 105: Hoare triple {110473#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,728 INFO L290 TraceCheckUtils]: 106: Hoare triple {110498#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,728 INFO L272 TraceCheckUtils]: 107: Hoare triple {110498#(<= ~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)); {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,728 INFO L290 TraceCheckUtils]: 108: Hoare triple {110498#(<= ~counter~0 12)} ~cond := #in~cond; {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,728 INFO L290 TraceCheckUtils]: 109: Hoare triple {110498#(<= ~counter~0 12)} assume !(0 == ~cond); {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,729 INFO L290 TraceCheckUtils]: 110: Hoare triple {110498#(<= ~counter~0 12)} assume true; {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,729 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110498#(<= ~counter~0 12)} {110498#(<= ~counter~0 12)} #96#return; {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,729 INFO L290 TraceCheckUtils]: 112: Hoare triple {110498#(<= ~counter~0 12)} assume !(~r~0 > 0); {110498#(<= ~counter~0 12)} is VALID [2022-04-08 06:05:29,730 INFO L290 TraceCheckUtils]: 113: Hoare triple {110498#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,730 INFO L290 TraceCheckUtils]: 114: Hoare triple {110523#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,731 INFO L272 TraceCheckUtils]: 115: Hoare triple {110523#(<= ~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)); {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,731 INFO L290 TraceCheckUtils]: 116: Hoare triple {110523#(<= ~counter~0 13)} ~cond := #in~cond; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,731 INFO L290 TraceCheckUtils]: 117: Hoare triple {110523#(<= ~counter~0 13)} assume !(0 == ~cond); {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,731 INFO L290 TraceCheckUtils]: 118: Hoare triple {110523#(<= ~counter~0 13)} assume true; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,732 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110523#(<= ~counter~0 13)} {110523#(<= ~counter~0 13)} #98#return; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,732 INFO L290 TraceCheckUtils]: 120: Hoare triple {110523#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110523#(<= ~counter~0 13)} is VALID [2022-04-08 06:05:29,733 INFO L290 TraceCheckUtils]: 121: Hoare triple {110523#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,733 INFO L290 TraceCheckUtils]: 122: Hoare triple {110548#(<= ~counter~0 14)} assume !!(#t~post8 < 100);havoc #t~post8; {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,734 INFO L272 TraceCheckUtils]: 123: Hoare triple {110548#(<= ~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)); {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,734 INFO L290 TraceCheckUtils]: 124: Hoare triple {110548#(<= ~counter~0 14)} ~cond := #in~cond; {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,734 INFO L290 TraceCheckUtils]: 125: Hoare triple {110548#(<= ~counter~0 14)} assume !(0 == ~cond); {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,734 INFO L290 TraceCheckUtils]: 126: Hoare triple {110548#(<= ~counter~0 14)} assume true; {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,735 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110548#(<= ~counter~0 14)} {110548#(<= ~counter~0 14)} #98#return; {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,735 INFO L290 TraceCheckUtils]: 128: Hoare triple {110548#(<= ~counter~0 14)} assume !(~r~0 < 0); {110548#(<= ~counter~0 14)} is VALID [2022-04-08 06:05:29,735 INFO L290 TraceCheckUtils]: 129: Hoare triple {110548#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110573#(<= |main_#t~post6| 14)} is VALID [2022-04-08 06:05:29,735 INFO L290 TraceCheckUtils]: 130: Hoare triple {110573#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {110167#false} is VALID [2022-04-08 06:05:29,735 INFO L272 TraceCheckUtils]: 131: Hoare triple {110167#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110167#false} is VALID [2022-04-08 06:05:29,736 INFO L290 TraceCheckUtils]: 132: Hoare triple {110167#false} ~cond := #in~cond; {110167#false} is VALID [2022-04-08 06:05:29,736 INFO L290 TraceCheckUtils]: 133: Hoare triple {110167#false} assume 0 == ~cond; {110167#false} is VALID [2022-04-08 06:05:29,736 INFO L290 TraceCheckUtils]: 134: Hoare triple {110167#false} assume !false; {110167#false} is VALID [2022-04-08 06:05:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:05:29,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:05:30,306 INFO L290 TraceCheckUtils]: 134: Hoare triple {110167#false} assume !false; {110167#false} is VALID [2022-04-08 06:05:30,307 INFO L290 TraceCheckUtils]: 133: Hoare triple {110167#false} assume 0 == ~cond; {110167#false} is VALID [2022-04-08 06:05:30,307 INFO L290 TraceCheckUtils]: 132: Hoare triple {110167#false} ~cond := #in~cond; {110167#false} is VALID [2022-04-08 06:05:30,307 INFO L272 TraceCheckUtils]: 131: Hoare triple {110167#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {110167#false} is VALID [2022-04-08 06:05:30,307 INFO L290 TraceCheckUtils]: 130: Hoare triple {110601#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {110167#false} is VALID [2022-04-08 06:05:30,307 INFO L290 TraceCheckUtils]: 129: Hoare triple {110605#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110601#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:05:30,307 INFO L290 TraceCheckUtils]: 128: Hoare triple {110605#(< ~counter~0 100)} assume !(~r~0 < 0); {110605#(< ~counter~0 100)} is VALID [2022-04-08 06:05:30,308 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110166#true} {110605#(< ~counter~0 100)} #98#return; {110605#(< ~counter~0 100)} is VALID [2022-04-08 06:05:30,308 INFO L290 TraceCheckUtils]: 126: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,308 INFO L290 TraceCheckUtils]: 125: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,308 INFO L290 TraceCheckUtils]: 124: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,308 INFO L272 TraceCheckUtils]: 123: Hoare triple {110605#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,308 INFO L290 TraceCheckUtils]: 122: Hoare triple {110605#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {110605#(< ~counter~0 100)} is VALID [2022-04-08 06:05:30,310 INFO L290 TraceCheckUtils]: 121: Hoare triple {110630#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110605#(< ~counter~0 100)} is VALID [2022-04-08 06:05:30,310 INFO L290 TraceCheckUtils]: 120: Hoare triple {110630#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110630#(< ~counter~0 99)} is VALID [2022-04-08 06:05:30,311 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110166#true} {110630#(< ~counter~0 99)} #98#return; {110630#(< ~counter~0 99)} is VALID [2022-04-08 06:05:30,311 INFO L290 TraceCheckUtils]: 118: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,311 INFO L290 TraceCheckUtils]: 117: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,311 INFO L290 TraceCheckUtils]: 116: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,311 INFO L272 TraceCheckUtils]: 115: Hoare triple {110630#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,311 INFO L290 TraceCheckUtils]: 114: Hoare triple {110630#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {110630#(< ~counter~0 99)} is VALID [2022-04-08 06:05:30,312 INFO L290 TraceCheckUtils]: 113: Hoare triple {110655#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110630#(< ~counter~0 99)} is VALID [2022-04-08 06:05:30,312 INFO L290 TraceCheckUtils]: 112: Hoare triple {110655#(< ~counter~0 98)} assume !(~r~0 > 0); {110655#(< ~counter~0 98)} is VALID [2022-04-08 06:05:30,312 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110166#true} {110655#(< ~counter~0 98)} #96#return; {110655#(< ~counter~0 98)} is VALID [2022-04-08 06:05:30,312 INFO L290 TraceCheckUtils]: 110: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,312 INFO L290 TraceCheckUtils]: 109: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,312 INFO L290 TraceCheckUtils]: 108: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,313 INFO L272 TraceCheckUtils]: 107: Hoare triple {110655#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,313 INFO L290 TraceCheckUtils]: 106: Hoare triple {110655#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {110655#(< ~counter~0 98)} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 105: Hoare triple {110680#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110655#(< ~counter~0 98)} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 104: Hoare triple {110680#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110680#(< ~counter~0 97)} is VALID [2022-04-08 06:05:30,314 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110166#true} {110680#(< ~counter~0 97)} #96#return; {110680#(< ~counter~0 97)} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 102: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 101: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 100: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,314 INFO L272 TraceCheckUtils]: 99: Hoare triple {110680#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,314 INFO L290 TraceCheckUtils]: 98: Hoare triple {110680#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {110680#(< ~counter~0 97)} is VALID [2022-04-08 06:05:30,315 INFO L290 TraceCheckUtils]: 97: Hoare triple {110705#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110680#(< ~counter~0 97)} is VALID [2022-04-08 06:05:30,315 INFO L290 TraceCheckUtils]: 96: Hoare triple {110705#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110705#(< ~counter~0 96)} is VALID [2022-04-08 06:05:30,316 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110166#true} {110705#(< ~counter~0 96)} #96#return; {110705#(< ~counter~0 96)} is VALID [2022-04-08 06:05:30,316 INFO L290 TraceCheckUtils]: 94: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,316 INFO L290 TraceCheckUtils]: 93: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,316 INFO L290 TraceCheckUtils]: 92: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,316 INFO L272 TraceCheckUtils]: 91: Hoare triple {110705#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,316 INFO L290 TraceCheckUtils]: 90: Hoare triple {110705#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {110705#(< ~counter~0 96)} is VALID [2022-04-08 06:05:30,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {110730#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110705#(< ~counter~0 96)} is VALID [2022-04-08 06:05:30,317 INFO L290 TraceCheckUtils]: 88: Hoare triple {110730#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110730#(< ~counter~0 95)} is VALID [2022-04-08 06:05:30,317 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {110166#true} {110730#(< ~counter~0 95)} #96#return; {110730#(< ~counter~0 95)} is VALID [2022-04-08 06:05:30,318 INFO L290 TraceCheckUtils]: 86: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,318 INFO L290 TraceCheckUtils]: 85: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,318 INFO L290 TraceCheckUtils]: 84: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,318 INFO L272 TraceCheckUtils]: 83: Hoare triple {110730#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {110730#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {110730#(< ~counter~0 95)} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {110755#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110730#(< ~counter~0 95)} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {110755#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110755#(< ~counter~0 94)} is VALID [2022-04-08 06:05:30,319 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110166#true} {110755#(< ~counter~0 94)} #96#return; {110755#(< ~counter~0 94)} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,319 INFO L272 TraceCheckUtils]: 75: Hoare triple {110755#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,319 INFO L290 TraceCheckUtils]: 74: Hoare triple {110755#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {110755#(< ~counter~0 94)} is VALID [2022-04-08 06:05:30,320 INFO L290 TraceCheckUtils]: 73: Hoare triple {110780#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110755#(< ~counter~0 94)} is VALID [2022-04-08 06:05:30,321 INFO L290 TraceCheckUtils]: 72: Hoare triple {110780#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110780#(< ~counter~0 93)} is VALID [2022-04-08 06:05:30,321 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {110166#true} {110780#(< ~counter~0 93)} #96#return; {110780#(< ~counter~0 93)} is VALID [2022-04-08 06:05:30,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,321 INFO L272 TraceCheckUtils]: 67: Hoare triple {110780#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {110780#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {110780#(< ~counter~0 93)} is VALID [2022-04-08 06:05:30,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {110805#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110780#(< ~counter~0 93)} is VALID [2022-04-08 06:05:30,322 INFO L290 TraceCheckUtils]: 64: Hoare triple {110805#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110805#(< ~counter~0 92)} is VALID [2022-04-08 06:05:30,322 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110166#true} {110805#(< ~counter~0 92)} #96#return; {110805#(< ~counter~0 92)} is VALID [2022-04-08 06:05:30,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,323 INFO L272 TraceCheckUtils]: 59: Hoare triple {110805#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {110805#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {110805#(< ~counter~0 92)} is VALID [2022-04-08 06:05:30,324 INFO L290 TraceCheckUtils]: 57: Hoare triple {110830#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110805#(< ~counter~0 92)} is VALID [2022-04-08 06:05:30,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {110830#(< ~counter~0 91)} assume !!(0 != ~r~0); {110830#(< ~counter~0 91)} is VALID [2022-04-08 06:05:30,324 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {110166#true} {110830#(< ~counter~0 91)} #94#return; {110830#(< ~counter~0 91)} is VALID [2022-04-08 06:05:30,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,324 INFO L272 TraceCheckUtils]: 51: Hoare triple {110830#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,325 INFO L290 TraceCheckUtils]: 50: Hoare triple {110830#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {110830#(< ~counter~0 91)} is VALID [2022-04-08 06:05:30,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {110855#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110830#(< ~counter~0 91)} is VALID [2022-04-08 06:05:30,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {110855#(< ~counter~0 90)} assume !(~r~0 < 0); {110855#(< ~counter~0 90)} is VALID [2022-04-08 06:05:30,326 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {110166#true} {110855#(< ~counter~0 90)} #98#return; {110855#(< ~counter~0 90)} is VALID [2022-04-08 06:05:30,326 INFO L290 TraceCheckUtils]: 46: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,326 INFO L290 TraceCheckUtils]: 45: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,326 INFO L272 TraceCheckUtils]: 43: Hoare triple {110855#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {110855#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {110855#(< ~counter~0 90)} is VALID [2022-04-08 06:05:30,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {110880#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110855#(< ~counter~0 90)} is VALID [2022-04-08 06:05:30,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {110880#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110880#(< ~counter~0 89)} is VALID [2022-04-08 06:05:30,327 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110166#true} {110880#(< ~counter~0 89)} #98#return; {110880#(< ~counter~0 89)} is VALID [2022-04-08 06:05:30,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,328 INFO L272 TraceCheckUtils]: 35: Hoare triple {110880#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {110880#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {110880#(< ~counter~0 89)} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {110905#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110880#(< ~counter~0 89)} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {110905#(< ~counter~0 88)} assume !(~r~0 > 0); {110905#(< ~counter~0 88)} is VALID [2022-04-08 06:05:30,329 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {110166#true} {110905#(< ~counter~0 88)} #96#return; {110905#(< ~counter~0 88)} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,329 INFO L272 TraceCheckUtils]: 27: Hoare triple {110905#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {110905#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {110905#(< ~counter~0 88)} is VALID [2022-04-08 06:05:30,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {110930#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110905#(< ~counter~0 88)} is VALID [2022-04-08 06:05:30,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {110930#(< ~counter~0 87)} assume !!(0 != ~r~0); {110930#(< ~counter~0 87)} is VALID [2022-04-08 06:05:30,331 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {110166#true} {110930#(< ~counter~0 87)} #94#return; {110930#(< ~counter~0 87)} is VALID [2022-04-08 06:05:30,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,331 INFO L272 TraceCheckUtils]: 19: Hoare triple {110930#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {110930#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {110930#(< ~counter~0 87)} is VALID [2022-04-08 06:05:30,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {110955#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110930#(< ~counter~0 87)} is VALID [2022-04-08 06:05:30,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {110955#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110166#true} {110955#(< ~counter~0 86)} #92#return; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L272 TraceCheckUtils]: 11: Hoare triple {110955#(< ~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)); {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110166#true} {110955#(< ~counter~0 86)} #90#return; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {110955#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {110166#true} is VALID [2022-04-08 06:05:30,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {110955#(< ~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; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {110955#(< ~counter~0 86)} call #t~ret9 := main(); {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110955#(< ~counter~0 86)} {110166#true} #102#return; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {110955#(< ~counter~0 86)} assume true; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {110166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110955#(< ~counter~0 86)} is VALID [2022-04-08 06:05:30,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {110166#true} call ULTIMATE.init(); {110166#true} is VALID [2022-04-08 06:05:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 06:05:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:05:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235054949] [2022-04-08 06:05:30,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:05:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630558447] [2022-04-08 06:05:30,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630558447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:05:30,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:05:30,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 06:05:30,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:05:30,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154362702] [2022-04-08 06:05:30,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154362702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:05:30,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:05:30,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 06:05:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588949883] [2022-04-08 06:05:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:05:30,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-08 06:05:30,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:05:30,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:05:30,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:30,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 06:05:30,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:30,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 06:05:30,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 06:05:30,415 INFO L87 Difference]: Start difference. First operand 683 states and 912 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:05:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:33,146 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-08 06:05:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 06:05:33,146 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-08 06:05:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:05:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:05:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 06:05:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:05:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-08 06:05:33,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-08 06:05:33,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:33,496 INFO L225 Difference]: With dead ends: 734 [2022-04-08 06:05:33,496 INFO L226 Difference]: Without dead ends: 729 [2022-04-08 06:05:33,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 06:05:33,497 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 275 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:05:33,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 305 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 06:05:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-08 06:05:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-08 06:05:36,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:05:36,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:05:36,248 INFO L74 IsIncluded]: Start isIncluded. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:05:36,248 INFO L87 Difference]: Start difference. First operand 729 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:05:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:36,269 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 06:05:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 06:05:36,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:36,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:36,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 06:05:36,271 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 729 states. [2022-04-08 06:05:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:05:36,290 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-08 06:05:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-08 06:05:36,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:05:36,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:05:36,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:05:36,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:05:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:05:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 06:05:36,314 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-08 06:05:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:05:36,315 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 06:05:36,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:05:36,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 06:05:39,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 950 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:05:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 06:05:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 06:05:39,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:05:39,005 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:05:39,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-08 06:05:39,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:39,206 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:05:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:05:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-08 06:05:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:05:39,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206139524] [2022-04-08 06:05:39,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:05:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-08 06:05:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:05:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49745269] [2022-04-08 06:05:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:05:39,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:05:39,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:05:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484132117] [2022-04-08 06:05:39,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:05:39,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:05:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:05:39,229 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:05:39,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 06:05:39,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:05:39,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:05:39,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 06:05:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:05:39,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:07:45,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {115371#true} call ULTIMATE.init(); {115371#true} is VALID [2022-04-08 06:07:45,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {115371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {115371#true} is VALID [2022-04-08 06:07:45,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:45,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115371#true} {115371#true} #102#return; {115371#true} is VALID [2022-04-08 06:07:45,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {115371#true} call #t~ret9 := main(); {115371#true} is VALID [2022-04-08 06:07:45,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {115371#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; {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {115371#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {115371#true} {115371#true} #90#return; {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L272 TraceCheckUtils]: 11: Hoare triple {115371#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)); {115371#true} is VALID [2022-04-08 06:07:45,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {115371#true} ~cond := #in~cond; {115412#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:07:45,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {115412#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {115416#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:07:45,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {115416#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {115416#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:07:45,782 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {115416#(not (= |assume_abort_if_not_#in~cond| 0))} {115371#true} #92#return; {115423#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-08 06:07:47,785 WARN L290 TraceCheckUtils]: 16: Hoare triple {115423#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-08 06:07:47,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,786 INFO L272 TraceCheckUtils]: 19: Hoare triple {115427#(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)); {115371#true} is VALID [2022-04-08 06:07:47,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:47,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:47,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:47,787 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {115371#true} {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {115427#(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); {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,788 INFO L272 TraceCheckUtils]: 27: Hoare triple {115427#(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)); {115371#true} is VALID [2022-04-08 06:07:47,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:47,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:47,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:47,791 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {115371#true} {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {115427#(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); {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:47,793 INFO L272 TraceCheckUtils]: 35: Hoare triple {115427#(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)); {115371#true} is VALID [2022-04-08 06:07:47,793 INFO L290 TraceCheckUtils]: 36: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:47,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:47,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:47,793 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {115371#true} {115427#(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; {115427#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-08 06:07:48,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {115427#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,511 INFO L272 TraceCheckUtils]: 43: Hoare triple {115500#(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)); {115371#true} is VALID [2022-04-08 06:07:48,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:48,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:48,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:48,512 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {115371#true} {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {115500#(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); {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,520 INFO L272 TraceCheckUtils]: 51: Hoare triple {115500#(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)); {115371#true} is VALID [2022-04-08 06:07:48,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:48,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:48,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:48,521 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {115371#true} {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {115500#(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); {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,524 INFO L290 TraceCheckUtils]: 57: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:48,525 INFO L272 TraceCheckUtils]: 59: Hoare triple {115500#(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)); {115371#true} is VALID [2022-04-08 06:07:48,525 INFO L290 TraceCheckUtils]: 60: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:48,525 INFO L290 TraceCheckUtils]: 61: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:48,525 INFO L290 TraceCheckUtils]: 62: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:48,526 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {115371#true} {115500#(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; {115500#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-08 06:07:50,350 WARN L290 TraceCheckUtils]: 64: Hoare triple {115500#(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; {115573#(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-08 06:07:50,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {115573#(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; {115573#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 06:07:52,430 WARN L290 TraceCheckUtils]: 66: Hoare triple {115573#(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; {115573#(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-08 06:07:52,431 INFO L272 TraceCheckUtils]: 67: Hoare triple {115573#(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)); {115371#true} is VALID [2022-04-08 06:07:52,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,431 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {115371#true} {115573#(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; {115573#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-08 06:07:52,441 INFO L290 TraceCheckUtils]: 72: Hoare triple {115573#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,455 INFO L272 TraceCheckUtils]: 75: Hoare triple {115598#(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)); {115371#true} is VALID [2022-04-08 06:07:52,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,456 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {115371#true} {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {115598#(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); {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,472 INFO L290 TraceCheckUtils]: 82: Hoare triple {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,472 INFO L272 TraceCheckUtils]: 83: Hoare triple {115598#(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)); {115371#true} is VALID [2022-04-08 06:07:52,472 INFO L290 TraceCheckUtils]: 84: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,472 INFO L290 TraceCheckUtils]: 86: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,473 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {115371#true} {115598#(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; {115598#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-08 06:07:52,476 INFO L290 TraceCheckUtils]: 88: Hoare triple {115598#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,526 INFO L272 TraceCheckUtils]: 91: Hoare triple {115647#(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)); {115371#true} is VALID [2022-04-08 06:07:52,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,527 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {115371#true} {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,536 INFO L290 TraceCheckUtils]: 96: Hoare triple {115647#(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); {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,537 INFO L290 TraceCheckUtils]: 97: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,543 INFO L290 TraceCheckUtils]: 98: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,543 INFO L272 TraceCheckUtils]: 99: Hoare triple {115647#(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)); {115371#true} is VALID [2022-04-08 06:07:52,543 INFO L290 TraceCheckUtils]: 100: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,543 INFO L290 TraceCheckUtils]: 101: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,543 INFO L290 TraceCheckUtils]: 102: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,543 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {115371#true} {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,580 INFO L290 TraceCheckUtils]: 104: Hoare triple {115647#(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); {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,582 INFO L290 TraceCheckUtils]: 106: Hoare triple {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,582 INFO L272 TraceCheckUtils]: 107: Hoare triple {115647#(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)); {115371#true} is VALID [2022-04-08 06:07:52,582 INFO L290 TraceCheckUtils]: 108: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,582 INFO L290 TraceCheckUtils]: 109: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,582 INFO L290 TraceCheckUtils]: 110: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,582 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {115371#true} {115647#(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; {115647#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-08 06:07:52,584 INFO L290 TraceCheckUtils]: 112: Hoare triple {115647#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,584 INFO L290 TraceCheckUtils]: 113: Hoare triple {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,585 INFO L290 TraceCheckUtils]: 114: Hoare triple {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,585 INFO L272 TraceCheckUtils]: 115: Hoare triple {115720#(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)); {115371#true} is VALID [2022-04-08 06:07:52,586 INFO L290 TraceCheckUtils]: 116: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,586 INFO L290 TraceCheckUtils]: 118: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,586 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {115371#true} {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {115720#(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); {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,590 INFO L290 TraceCheckUtils]: 121: Hoare triple {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,590 INFO L290 TraceCheckUtils]: 122: Hoare triple {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,590 INFO L272 TraceCheckUtils]: 123: Hoare triple {115720#(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)); {115371#true} is VALID [2022-04-08 06:07:52,591 INFO L290 TraceCheckUtils]: 124: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:52,591 INFO L290 TraceCheckUtils]: 125: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:52,591 INFO L290 TraceCheckUtils]: 126: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:52,591 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {115371#true} {115720#(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; {115720#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {115720#(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; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 129: Hoare triple {115372#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 130: Hoare triple {115372#false} assume !(#t~post8 < 100);havoc #t~post8; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 131: Hoare triple {115372#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 132: Hoare triple {115372#false} assume !(#t~post6 < 100);havoc #t~post6; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L272 TraceCheckUtils]: 133: Hoare triple {115372#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 134: Hoare triple {115372#false} ~cond := #in~cond; {115372#false} is VALID [2022-04-08 06:07:52,594 INFO L290 TraceCheckUtils]: 135: Hoare triple {115372#false} assume 0 == ~cond; {115372#false} is VALID [2022-04-08 06:07:52,595 INFO L290 TraceCheckUtils]: 136: Hoare triple {115372#false} assume !false; {115372#false} is VALID [2022-04-08 06:07:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-08 06:07:52,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:07:56,293 INFO L290 TraceCheckUtils]: 136: Hoare triple {115372#false} assume !false; {115372#false} is VALID [2022-04-08 06:07:56,293 INFO L290 TraceCheckUtils]: 135: Hoare triple {115372#false} assume 0 == ~cond; {115372#false} is VALID [2022-04-08 06:07:56,293 INFO L290 TraceCheckUtils]: 134: Hoare triple {115372#false} ~cond := #in~cond; {115372#false} is VALID [2022-04-08 06:07:56,293 INFO L272 TraceCheckUtils]: 133: Hoare triple {115372#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {115372#false} is VALID [2022-04-08 06:07:56,293 INFO L290 TraceCheckUtils]: 132: Hoare triple {115372#false} assume !(#t~post6 < 100);havoc #t~post6; {115372#false} is VALID [2022-04-08 06:07:56,293 INFO L290 TraceCheckUtils]: 131: Hoare triple {115372#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115372#false} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 130: Hoare triple {115372#false} assume !(#t~post8 < 100);havoc #t~post8; {115372#false} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 129: Hoare triple {115372#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115372#false} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 128: Hoare triple {115817#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115372#false} is VALID [2022-04-08 06:07:56,294 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {115371#true} {115817#(not (< main_~r~0 0))} #98#return; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 126: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 125: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 124: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,294 INFO L272 TraceCheckUtils]: 123: Hoare triple {115817#(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)); {115371#true} is VALID [2022-04-08 06:07:56,294 INFO L290 TraceCheckUtils]: 122: Hoare triple {115817#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,295 INFO L290 TraceCheckUtils]: 121: Hoare triple {115817#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,295 INFO L290 TraceCheckUtils]: 120: Hoare triple {115817#(not (< main_~r~0 0))} assume !(~r~0 > 0); {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,295 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {115371#true} {115817#(not (< main_~r~0 0))} #96#return; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,295 INFO L290 TraceCheckUtils]: 118: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,295 INFO L290 TraceCheckUtils]: 117: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,295 INFO L290 TraceCheckUtils]: 116: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,295 INFO L272 TraceCheckUtils]: 115: Hoare triple {115817#(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)); {115371#true} is VALID [2022-04-08 06:07:56,296 INFO L290 TraceCheckUtils]: 114: Hoare triple {115817#(not (< main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,296 INFO L290 TraceCheckUtils]: 113: Hoare triple {115817#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,296 INFO L290 TraceCheckUtils]: 112: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {115817#(not (< main_~r~0 0))} is VALID [2022-04-08 06:07:56,297 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {115371#true} {115866#(<= main_~v~0 main_~r~0)} #96#return; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,297 INFO L290 TraceCheckUtils]: 110: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,297 INFO L290 TraceCheckUtils]: 109: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,297 INFO L290 TraceCheckUtils]: 108: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,297 INFO L272 TraceCheckUtils]: 107: Hoare triple {115866#(<= 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)); {115371#true} is VALID [2022-04-08 06:07:56,297 INFO L290 TraceCheckUtils]: 106: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 100);havoc #t~post7; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,298 INFO L290 TraceCheckUtils]: 105: Hoare triple {115866#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,298 INFO L290 TraceCheckUtils]: 104: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,311 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {115371#true} {115866#(<= main_~v~0 main_~r~0)} #94#return; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,311 INFO L290 TraceCheckUtils]: 102: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,311 INFO L290 TraceCheckUtils]: 101: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,311 INFO L290 TraceCheckUtils]: 100: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,311 INFO L272 TraceCheckUtils]: 99: Hoare triple {115866#(<= 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)); {115371#true} is VALID [2022-04-08 06:07:56,311 INFO L290 TraceCheckUtils]: 98: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 100);havoc #t~post6; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,312 INFO L290 TraceCheckUtils]: 97: Hoare triple {115866#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,321 INFO L290 TraceCheckUtils]: 96: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,322 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {115371#true} {115866#(<= main_~v~0 main_~r~0)} #98#return; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,322 INFO L272 TraceCheckUtils]: 91: Hoare triple {115866#(<= 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)); {115371#true} is VALID [2022-04-08 06:07:56,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {115866#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,324 INFO L290 TraceCheckUtils]: 88: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-08 06:07:56,324 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {115371#true} {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,324 INFO L290 TraceCheckUtils]: 86: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,325 INFO L272 TraceCheckUtils]: 83: Hoare triple {115939#(<= 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)); {115371#true} is VALID [2022-04-08 06:07:56,325 INFO L290 TraceCheckUtils]: 82: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,325 INFO L290 TraceCheckUtils]: 81: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,325 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {115371#true} {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,326 INFO L272 TraceCheckUtils]: 75: Hoare triple {115939#(<= 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)); {115371#true} is VALID [2022-04-08 06:07:56,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,327 INFO L290 TraceCheckUtils]: 72: Hoare triple {115988#(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; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-08 06:07:56,327 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {115371#true} {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:07:56,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,327 INFO L272 TraceCheckUtils]: 67: Hoare triple {115988#(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)); {115371#true} is VALID [2022-04-08 06:07:56,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:07:56,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {115988#(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; {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:07:56,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {116013#(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; {115988#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-08 06:07:56,329 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {115371#true} {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,329 INFO L290 TraceCheckUtils]: 61: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,329 INFO L290 TraceCheckUtils]: 60: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,329 INFO L272 TraceCheckUtils]: 59: Hoare triple {116013#(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)); {115371#true} is VALID [2022-04-08 06:07:56,329 INFO L290 TraceCheckUtils]: 58: Hoare triple {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {116013#(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; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,330 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {115371#true} {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,330 INFO L272 TraceCheckUtils]: 51: Hoare triple {116013#(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)); {115371#true} is VALID [2022-04-08 06:07:56,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {116013#(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; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,332 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {115371#true} {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,332 INFO L272 TraceCheckUtils]: 43: Hoare triple {116013#(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)); {115371#true} is VALID [2022-04-08 06:07:56,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {116013#(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; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {116086#(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; {116013#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-08 06:07:56,334 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {115371#true} {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,334 INFO L272 TraceCheckUtils]: 35: Hoare triple {116086#(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)); {115371#true} is VALID [2022-04-08 06:07:56,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {116086#(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); {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,336 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {115371#true} {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,336 INFO L272 TraceCheckUtils]: 27: Hoare triple {116086#(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)); {115371#true} is VALID [2022-04-08 06:07:56,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {116086#(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); {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,337 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {115371#true} {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,337 INFO L272 TraceCheckUtils]: 19: Hoare triple {116086#(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)); {115371#true} is VALID [2022-04-08 06:07:56,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {116086#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {116159#(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; {116086#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-08 06:07:56,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {115416#(not (= |assume_abort_if_not_#in~cond| 0))} {115371#true} #92#return; {116159#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {115416#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {115416#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {116172#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {115416#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {115371#true} ~cond := #in~cond; {116172#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 06:07:56,352 INFO L272 TraceCheckUtils]: 11: Hoare triple {115371#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)); {115371#true} is VALID [2022-04-08 06:07:56,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {115371#true} {115371#true} #90#return; {115371#true} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-08 06:07:56,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-08 06:07:56,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {115371#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {115371#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; {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {115371#true} call #t~ret9 := main(); {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115371#true} {115371#true} #102#return; {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {115371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {115371#true} call ULTIMATE.init(); {115371#true} is VALID [2022-04-08 06:07:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-08 06:07:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:07:56,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49745269] [2022-04-08 06:07:56,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:07:56,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484132117] [2022-04-08 06:07:56,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484132117] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:07:56,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:07:56,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-08 06:07:56,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:07:56,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206139524] [2022-04-08 06:07:56,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206139524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:07:56,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:07:56,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:07:56,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370258606] [2022-04-08 06:07:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:07:56,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-08 06:07:56,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:07:56,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 06:08:01,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 96 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:01,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:08:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:08:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:08:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:08:01,317 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 06:08:05,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:08:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:09,576 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-08 06:08:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:08:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-08 06:08:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:08:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 06:08:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 06:08:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 06:08:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-08 06:08:09,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-08 06:08:13,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 159 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:13,937 INFO L225 Difference]: With dead ends: 964 [2022-04-08 06:08:13,938 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 06:08:13,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-08 06:08:13,938 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:08:13,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 487 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 1 Unknown, 218 Unchecked, 3.1s Time] [2022-04-08 06:08:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 06:08:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-08 06:08:16,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:08:16,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:08:16,264 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:08:16,265 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:08:16,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:16,303 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 06:08:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 06:08:16,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:16,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:16,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 06:08:16,305 INFO L87 Difference]: Start difference. First operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 851 states. [2022-04-08 06:08:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:16,335 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-08 06:08:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-08 06:08:16,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:16,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:16,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:08:16,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:08:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 525 states have (on average 1.1923809523809523) internal successors, (626), 542 states have internal predecessors, (626), 163 states have call successors, (163), 20 states have call predecessors, (163), 18 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-08 06:08:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-08 06:08:16,361 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-08 06:08:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:08:16,361 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-08 06:08:16,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-08 06:08:16,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-08 06:08:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 948 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-08 06:08:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-08 06:08:24,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:08:24,697 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:08:24,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 06:08:24,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:08:24,897 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:08:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:08:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-08 06:08:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:08:24,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1164074816] [2022-04-08 06:08:24,898 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:08:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-08 06:08:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:08:24,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954374451] [2022-04-08 06:08:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:08:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:08:24,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:08:24,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050554688] [2022-04-08 06:08:24,913 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:08:24,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:08:24,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:08:24,913 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:08:24,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 06:08:25,106 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:08:25,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:08:25,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:08:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:08:25,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:08:25,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {121261#true} call ULTIMATE.init(); {121261#true} is VALID [2022-04-08 06:08:25,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {121261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121269#(<= ~counter~0 0)} {121261#true} #102#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {121269#(<= ~counter~0 0)} call #t~ret9 := main(); {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {121269#(<= ~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; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {121269#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {121269#(<= ~counter~0 0)} ~cond := #in~cond; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {121269#(<= ~counter~0 0)} assume !(0 == ~cond); {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {121269#(<= ~counter~0 0)} {121269#(<= ~counter~0 0)} #90#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {121269#(<= ~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)); {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {121269#(<= ~counter~0 0)} ~cond := #in~cond; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {121269#(<= ~counter~0 0)} assume !(0 == ~cond); {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {121269#(<= ~counter~0 0)} {121269#(<= ~counter~0 0)} #92#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {121269#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {121269#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:25,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {121269#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {121318#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,903 INFO L272 TraceCheckUtils]: 19: Hoare triple {121318#(<= ~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)); {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {121318#(<= ~counter~0 1)} ~cond := #in~cond; {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {121318#(<= ~counter~0 1)} assume !(0 == ~cond); {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {121318#(<= ~counter~0 1)} assume true; {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,904 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {121318#(<= ~counter~0 1)} {121318#(<= ~counter~0 1)} #94#return; {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {121318#(<= ~counter~0 1)} assume !!(0 != ~r~0); {121318#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:25,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {121318#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {121343#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,906 INFO L272 TraceCheckUtils]: 27: Hoare triple {121343#(<= ~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)); {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {121343#(<= ~counter~0 2)} ~cond := #in~cond; {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {121343#(<= ~counter~0 2)} assume !(0 == ~cond); {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {121343#(<= ~counter~0 2)} assume true; {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,907 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {121343#(<= ~counter~0 2)} {121343#(<= ~counter~0 2)} #96#return; {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {121343#(<= ~counter~0 2)} assume !(~r~0 > 0); {121343#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:25,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {121343#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {121368#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,910 INFO L272 TraceCheckUtils]: 35: Hoare triple {121368#(<= ~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)); {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {121368#(<= ~counter~0 3)} ~cond := #in~cond; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {121368#(<= ~counter~0 3)} assume !(0 == ~cond); {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {121368#(<= ~counter~0 3)} assume true; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,911 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {121368#(<= ~counter~0 3)} {121368#(<= ~counter~0 3)} #98#return; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {121368#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121368#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:25,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {121368#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,913 INFO L290 TraceCheckUtils]: 42: Hoare triple {121393#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,913 INFO L272 TraceCheckUtils]: 43: Hoare triple {121393#(<= ~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)); {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {121393#(<= ~counter~0 4)} ~cond := #in~cond; {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {121393#(<= ~counter~0 4)} assume !(0 == ~cond); {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {121393#(<= ~counter~0 4)} assume true; {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,914 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {121393#(<= ~counter~0 4)} {121393#(<= ~counter~0 4)} #98#return; {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {121393#(<= ~counter~0 4)} assume !(~r~0 < 0); {121393#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:25,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {121393#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {121418#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,917 INFO L272 TraceCheckUtils]: 51: Hoare triple {121418#(<= ~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)); {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,917 INFO L290 TraceCheckUtils]: 52: Hoare triple {121418#(<= ~counter~0 5)} ~cond := #in~cond; {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {121418#(<= ~counter~0 5)} assume !(0 == ~cond); {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,917 INFO L290 TraceCheckUtils]: 54: Hoare triple {121418#(<= ~counter~0 5)} assume true; {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,918 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {121418#(<= ~counter~0 5)} {121418#(<= ~counter~0 5)} #94#return; {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {121418#(<= ~counter~0 5)} assume !!(0 != ~r~0); {121418#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:25,919 INFO L290 TraceCheckUtils]: 57: Hoare triple {121418#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {121443#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,920 INFO L272 TraceCheckUtils]: 59: Hoare triple {121443#(<= ~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)); {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {121443#(<= ~counter~0 6)} ~cond := #in~cond; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {121443#(<= ~counter~0 6)} assume !(0 == ~cond); {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {121443#(<= ~counter~0 6)} assume true; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,921 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121443#(<= ~counter~0 6)} {121443#(<= ~counter~0 6)} #96#return; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {121443#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121443#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:25,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {121443#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {121468#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,923 INFO L272 TraceCheckUtils]: 67: Hoare triple {121468#(<= ~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)); {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,924 INFO L290 TraceCheckUtils]: 68: Hoare triple {121468#(<= ~counter~0 7)} ~cond := #in~cond; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,924 INFO L290 TraceCheckUtils]: 69: Hoare triple {121468#(<= ~counter~0 7)} assume !(0 == ~cond); {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {121468#(<= ~counter~0 7)} assume true; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,925 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121468#(<= ~counter~0 7)} {121468#(<= ~counter~0 7)} #96#return; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,925 INFO L290 TraceCheckUtils]: 72: Hoare triple {121468#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121468#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:25,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {121468#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {121493#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,927 INFO L272 TraceCheckUtils]: 75: Hoare triple {121493#(<= ~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)); {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {121493#(<= ~counter~0 8)} ~cond := #in~cond; {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {121493#(<= ~counter~0 8)} assume !(0 == ~cond); {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {121493#(<= ~counter~0 8)} assume true; {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,928 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121493#(<= ~counter~0 8)} {121493#(<= ~counter~0 8)} #96#return; {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {121493#(<= ~counter~0 8)} assume !(~r~0 > 0); {121493#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:25,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {121493#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {121518#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,930 INFO L272 TraceCheckUtils]: 83: Hoare triple {121518#(<= ~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)); {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {121518#(<= ~counter~0 9)} ~cond := #in~cond; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {121518#(<= ~counter~0 9)} assume !(0 == ~cond); {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {121518#(<= ~counter~0 9)} assume true; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,931 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121518#(<= ~counter~0 9)} {121518#(<= ~counter~0 9)} #98#return; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,931 INFO L290 TraceCheckUtils]: 88: Hoare triple {121518#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121518#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:25,932 INFO L290 TraceCheckUtils]: 89: Hoare triple {121518#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,933 INFO L290 TraceCheckUtils]: 90: Hoare triple {121543#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,933 INFO L272 TraceCheckUtils]: 91: Hoare triple {121543#(<= ~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)); {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,933 INFO L290 TraceCheckUtils]: 92: Hoare triple {121543#(<= ~counter~0 10)} ~cond := #in~cond; {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,934 INFO L290 TraceCheckUtils]: 93: Hoare triple {121543#(<= ~counter~0 10)} assume !(0 == ~cond); {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,934 INFO L290 TraceCheckUtils]: 94: Hoare triple {121543#(<= ~counter~0 10)} assume true; {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,934 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121543#(<= ~counter~0 10)} {121543#(<= ~counter~0 10)} #98#return; {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,935 INFO L290 TraceCheckUtils]: 96: Hoare triple {121543#(<= ~counter~0 10)} assume !(~r~0 < 0); {121543#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:25,937 INFO L290 TraceCheckUtils]: 97: Hoare triple {121543#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,938 INFO L290 TraceCheckUtils]: 98: Hoare triple {121568#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,938 INFO L272 TraceCheckUtils]: 99: Hoare triple {121568#(<= ~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)); {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,938 INFO L290 TraceCheckUtils]: 100: Hoare triple {121568#(<= ~counter~0 11)} ~cond := #in~cond; {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,939 INFO L290 TraceCheckUtils]: 101: Hoare triple {121568#(<= ~counter~0 11)} assume !(0 == ~cond); {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {121568#(<= ~counter~0 11)} assume true; {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,939 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121568#(<= ~counter~0 11)} {121568#(<= ~counter~0 11)} #94#return; {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,940 INFO L290 TraceCheckUtils]: 104: Hoare triple {121568#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121568#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:25,942 INFO L290 TraceCheckUtils]: 105: Hoare triple {121568#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,942 INFO L290 TraceCheckUtils]: 106: Hoare triple {121593#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,943 INFO L272 TraceCheckUtils]: 107: Hoare triple {121593#(<= ~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)); {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {121593#(<= ~counter~0 12)} ~cond := #in~cond; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {121593#(<= ~counter~0 12)} assume !(0 == ~cond); {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {121593#(<= ~counter~0 12)} assume true; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,944 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121593#(<= ~counter~0 12)} {121593#(<= ~counter~0 12)} #96#return; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,944 INFO L290 TraceCheckUtils]: 112: Hoare triple {121593#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121593#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:25,945 INFO L290 TraceCheckUtils]: 113: Hoare triple {121593#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,946 INFO L290 TraceCheckUtils]: 114: Hoare triple {121618#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,946 INFO L272 TraceCheckUtils]: 115: Hoare triple {121618#(<= ~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)); {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,946 INFO L290 TraceCheckUtils]: 116: Hoare triple {121618#(<= ~counter~0 13)} ~cond := #in~cond; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,947 INFO L290 TraceCheckUtils]: 117: Hoare triple {121618#(<= ~counter~0 13)} assume !(0 == ~cond); {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,947 INFO L290 TraceCheckUtils]: 118: Hoare triple {121618#(<= ~counter~0 13)} assume true; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,947 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121618#(<= ~counter~0 13)} {121618#(<= ~counter~0 13)} #96#return; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,948 INFO L290 TraceCheckUtils]: 120: Hoare triple {121618#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121618#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:25,949 INFO L290 TraceCheckUtils]: 121: Hoare triple {121618#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,949 INFO L290 TraceCheckUtils]: 122: Hoare triple {121643#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,949 INFO L272 TraceCheckUtils]: 123: Hoare triple {121643#(<= ~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)); {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,950 INFO L290 TraceCheckUtils]: 124: Hoare triple {121643#(<= ~counter~0 14)} ~cond := #in~cond; {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,950 INFO L290 TraceCheckUtils]: 125: Hoare triple {121643#(<= ~counter~0 14)} assume !(0 == ~cond); {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,950 INFO L290 TraceCheckUtils]: 126: Hoare triple {121643#(<= ~counter~0 14)} assume true; {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,951 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121643#(<= ~counter~0 14)} {121643#(<= ~counter~0 14)} #96#return; {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,951 INFO L290 TraceCheckUtils]: 128: Hoare triple {121643#(<= ~counter~0 14)} assume !(~r~0 > 0); {121643#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:25,952 INFO L290 TraceCheckUtils]: 129: Hoare triple {121643#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121668#(<= ~counter~0 15)} is VALID [2022-04-08 06:08:25,952 INFO L290 TraceCheckUtils]: 130: Hoare triple {121668#(<= ~counter~0 15)} assume !(#t~post8 < 100);havoc #t~post8; {121668#(<= ~counter~0 15)} is VALID [2022-04-08 06:08:25,953 INFO L290 TraceCheckUtils]: 131: Hoare triple {121668#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121675#(<= |main_#t~post6| 15)} is VALID [2022-04-08 06:08:25,953 INFO L290 TraceCheckUtils]: 132: Hoare triple {121675#(<= |main_#t~post6| 15)} assume !(#t~post6 < 100);havoc #t~post6; {121262#false} is VALID [2022-04-08 06:08:25,953 INFO L272 TraceCheckUtils]: 133: Hoare triple {121262#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121262#false} is VALID [2022-04-08 06:08:25,953 INFO L290 TraceCheckUtils]: 134: Hoare triple {121262#false} ~cond := #in~cond; {121262#false} is VALID [2022-04-08 06:08:25,953 INFO L290 TraceCheckUtils]: 135: Hoare triple {121262#false} assume 0 == ~cond; {121262#false} is VALID [2022-04-08 06:08:25,953 INFO L290 TraceCheckUtils]: 136: Hoare triple {121262#false} assume !false; {121262#false} is VALID [2022-04-08 06:08:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:08:25,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:08:26,888 INFO L290 TraceCheckUtils]: 136: Hoare triple {121262#false} assume !false; {121262#false} is VALID [2022-04-08 06:08:26,888 INFO L290 TraceCheckUtils]: 135: Hoare triple {121262#false} assume 0 == ~cond; {121262#false} is VALID [2022-04-08 06:08:26,888 INFO L290 TraceCheckUtils]: 134: Hoare triple {121262#false} ~cond := #in~cond; {121262#false} is VALID [2022-04-08 06:08:26,888 INFO L272 TraceCheckUtils]: 133: Hoare triple {121262#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {121262#false} is VALID [2022-04-08 06:08:26,888 INFO L290 TraceCheckUtils]: 132: Hoare triple {121703#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {121262#false} is VALID [2022-04-08 06:08:26,889 INFO L290 TraceCheckUtils]: 131: Hoare triple {121707#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121703#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:08:26,889 INFO L290 TraceCheckUtils]: 130: Hoare triple {121707#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {121707#(< ~counter~0 100)} is VALID [2022-04-08 06:08:26,891 INFO L290 TraceCheckUtils]: 129: Hoare triple {121714#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121707#(< ~counter~0 100)} is VALID [2022-04-08 06:08:26,891 INFO L290 TraceCheckUtils]: 128: Hoare triple {121714#(< ~counter~0 99)} assume !(~r~0 > 0); {121714#(< ~counter~0 99)} is VALID [2022-04-08 06:08:26,892 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121261#true} {121714#(< ~counter~0 99)} #96#return; {121714#(< ~counter~0 99)} is VALID [2022-04-08 06:08:26,892 INFO L290 TraceCheckUtils]: 126: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,892 INFO L290 TraceCheckUtils]: 125: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,892 INFO L290 TraceCheckUtils]: 124: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,892 INFO L272 TraceCheckUtils]: 123: Hoare triple {121714#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,892 INFO L290 TraceCheckUtils]: 122: Hoare triple {121714#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {121714#(< ~counter~0 99)} is VALID [2022-04-08 06:08:26,893 INFO L290 TraceCheckUtils]: 121: Hoare triple {121739#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121714#(< ~counter~0 99)} is VALID [2022-04-08 06:08:26,894 INFO L290 TraceCheckUtils]: 120: Hoare triple {121739#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121739#(< ~counter~0 98)} is VALID [2022-04-08 06:08:26,894 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121261#true} {121739#(< ~counter~0 98)} #96#return; {121739#(< ~counter~0 98)} is VALID [2022-04-08 06:08:26,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,894 INFO L272 TraceCheckUtils]: 115: Hoare triple {121739#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,895 INFO L290 TraceCheckUtils]: 114: Hoare triple {121739#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {121739#(< ~counter~0 98)} is VALID [2022-04-08 06:08:26,896 INFO L290 TraceCheckUtils]: 113: Hoare triple {121764#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121739#(< ~counter~0 98)} is VALID [2022-04-08 06:08:26,896 INFO L290 TraceCheckUtils]: 112: Hoare triple {121764#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121764#(< ~counter~0 97)} is VALID [2022-04-08 06:08:26,896 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121261#true} {121764#(< ~counter~0 97)} #96#return; {121764#(< ~counter~0 97)} is VALID [2022-04-08 06:08:26,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,897 INFO L290 TraceCheckUtils]: 108: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,897 INFO L272 TraceCheckUtils]: 107: Hoare triple {121764#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,897 INFO L290 TraceCheckUtils]: 106: Hoare triple {121764#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {121764#(< ~counter~0 97)} is VALID [2022-04-08 06:08:26,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {121789#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121764#(< ~counter~0 97)} is VALID [2022-04-08 06:08:26,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {121789#(< ~counter~0 96)} assume !!(0 != ~r~0); {121789#(< ~counter~0 96)} is VALID [2022-04-08 06:08:26,898 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121261#true} {121789#(< ~counter~0 96)} #94#return; {121789#(< ~counter~0 96)} is VALID [2022-04-08 06:08:26,899 INFO L290 TraceCheckUtils]: 102: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,899 INFO L290 TraceCheckUtils]: 101: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,899 INFO L290 TraceCheckUtils]: 100: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,899 INFO L272 TraceCheckUtils]: 99: Hoare triple {121789#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {121789#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {121789#(< ~counter~0 96)} is VALID [2022-04-08 06:08:26,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {121814#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121789#(< ~counter~0 96)} is VALID [2022-04-08 06:08:26,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {121814#(< ~counter~0 95)} assume !(~r~0 < 0); {121814#(< ~counter~0 95)} is VALID [2022-04-08 06:08:26,901 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121261#true} {121814#(< ~counter~0 95)} #98#return; {121814#(< ~counter~0 95)} is VALID [2022-04-08 06:08:26,901 INFO L290 TraceCheckUtils]: 94: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,901 INFO L272 TraceCheckUtils]: 91: Hoare triple {121814#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {121814#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {121814#(< ~counter~0 95)} is VALID [2022-04-08 06:08:26,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {121839#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121814#(< ~counter~0 95)} is VALID [2022-04-08 06:08:26,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {121839#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121839#(< ~counter~0 94)} is VALID [2022-04-08 06:08:26,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121261#true} {121839#(< ~counter~0 94)} #98#return; {121839#(< ~counter~0 94)} is VALID [2022-04-08 06:08:26,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {121839#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {121839#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {121839#(< ~counter~0 94)} is VALID [2022-04-08 06:08:26,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {121864#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121839#(< ~counter~0 94)} is VALID [2022-04-08 06:08:26,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {121864#(< ~counter~0 93)} assume !(~r~0 > 0); {121864#(< ~counter~0 93)} is VALID [2022-04-08 06:08:26,905 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121261#true} {121864#(< ~counter~0 93)} #96#return; {121864#(< ~counter~0 93)} is VALID [2022-04-08 06:08:26,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,905 INFO L272 TraceCheckUtils]: 75: Hoare triple {121864#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {121864#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {121864#(< ~counter~0 93)} is VALID [2022-04-08 06:08:26,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {121889#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121864#(< ~counter~0 93)} is VALID [2022-04-08 06:08:26,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {121889#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121889#(< ~counter~0 92)} is VALID [2022-04-08 06:08:26,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121261#true} {121889#(< ~counter~0 92)} #96#return; {121889#(< ~counter~0 92)} is VALID [2022-04-08 06:08:26,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,907 INFO L272 TraceCheckUtils]: 67: Hoare triple {121889#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {121889#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {121889#(< ~counter~0 92)} is VALID [2022-04-08 06:08:26,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {121914#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121889#(< ~counter~0 92)} is VALID [2022-04-08 06:08:26,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {121914#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121914#(< ~counter~0 91)} is VALID [2022-04-08 06:08:26,909 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121261#true} {121914#(< ~counter~0 91)} #96#return; {121914#(< ~counter~0 91)} is VALID [2022-04-08 06:08:26,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {121914#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {121914#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {121914#(< ~counter~0 91)} is VALID [2022-04-08 06:08:26,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {121939#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121914#(< ~counter~0 91)} is VALID [2022-04-08 06:08:26,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {121939#(< ~counter~0 90)} assume !!(0 != ~r~0); {121939#(< ~counter~0 90)} is VALID [2022-04-08 06:08:26,912 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {121261#true} {121939#(< ~counter~0 90)} #94#return; {121939#(< ~counter~0 90)} is VALID [2022-04-08 06:08:26,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,912 INFO L272 TraceCheckUtils]: 51: Hoare triple {121939#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {121939#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {121939#(< ~counter~0 90)} is VALID [2022-04-08 06:08:26,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {121964#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121939#(< ~counter~0 90)} is VALID [2022-04-08 06:08:26,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {121964#(< ~counter~0 89)} assume !(~r~0 < 0); {121964#(< ~counter~0 89)} is VALID [2022-04-08 06:08:26,914 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {121261#true} {121964#(< ~counter~0 89)} #98#return; {121964#(< ~counter~0 89)} is VALID [2022-04-08 06:08:26,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,914 INFO L272 TraceCheckUtils]: 43: Hoare triple {121964#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {121964#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {121964#(< ~counter~0 89)} is VALID [2022-04-08 06:08:26,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {121989#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121964#(< ~counter~0 89)} is VALID [2022-04-08 06:08:26,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {121989#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121989#(< ~counter~0 88)} is VALID [2022-04-08 06:08:26,916 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {121261#true} {121989#(< ~counter~0 88)} #98#return; {121989#(< ~counter~0 88)} is VALID [2022-04-08 06:08:26,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {121989#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {121989#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {121989#(< ~counter~0 88)} is VALID [2022-04-08 06:08:26,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {122014#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121989#(< ~counter~0 88)} is VALID [2022-04-08 06:08:26,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {122014#(< ~counter~0 87)} assume !(~r~0 > 0); {122014#(< ~counter~0 87)} is VALID [2022-04-08 06:08:26,918 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {121261#true} {122014#(< ~counter~0 87)} #96#return; {122014#(< ~counter~0 87)} is VALID [2022-04-08 06:08:26,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,919 INFO L272 TraceCheckUtils]: 27: Hoare triple {122014#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {122014#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {122014#(< ~counter~0 87)} is VALID [2022-04-08 06:08:26,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {122039#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122014#(< ~counter~0 87)} is VALID [2022-04-08 06:08:26,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {122039#(< ~counter~0 86)} assume !!(0 != ~r~0); {122039#(< ~counter~0 86)} is VALID [2022-04-08 06:08:26,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {121261#true} {122039#(< ~counter~0 86)} #94#return; {122039#(< ~counter~0 86)} is VALID [2022-04-08 06:08:26,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,921 INFO L272 TraceCheckUtils]: 19: Hoare triple {122039#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {122039#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {122039#(< ~counter~0 86)} is VALID [2022-04-08 06:08:26,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {122064#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122039#(< ~counter~0 86)} is VALID [2022-04-08 06:08:26,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {122064#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {121261#true} {122064#(< ~counter~0 85)} #92#return; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {122064#(< ~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)); {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {121261#true} {122064#(< ~counter~0 85)} #90#return; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-08 06:08:26,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {122064#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {121261#true} is VALID [2022-04-08 06:08:26,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {122064#(< ~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; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {122064#(< ~counter~0 85)} call #t~ret9 := main(); {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122064#(< ~counter~0 85)} {121261#true} #102#return; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {122064#(< ~counter~0 85)} assume true; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {121261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {122064#(< ~counter~0 85)} is VALID [2022-04-08 06:08:26,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {121261#true} call ULTIMATE.init(); {121261#true} is VALID [2022-04-08 06:08:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 06:08:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:08:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954374451] [2022-04-08 06:08:26,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:08:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050554688] [2022-04-08 06:08:26,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050554688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:08:26,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:08:26,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:08:26,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:08:26,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1164074816] [2022-04-08 06:08:26,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1164074816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:08:26,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:08:26,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:08:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139146455] [2022-04-08 06:08:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:08:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-08 06:08:26,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:08:26,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:27,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:27,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:08:27,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:08:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:08:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:08:27,062 INFO L87 Difference]: Start difference. First operand 707 states and 950 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:32,031 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-08 06:08:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 06:08:32,031 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 137 [2022-04-08 06:08:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:08:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:08:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:08:32,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 06:08:32,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:32,686 INFO L225 Difference]: With dead ends: 807 [2022-04-08 06:08:32,686 INFO L226 Difference]: Without dead ends: 802 [2022-04-08 06:08:32,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 06:08:32,687 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 336 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:08:32,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 321 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 06:08:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-08 06:08:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-08 06:08:35,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:08:35,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:35,884 INFO L74 IsIncluded]: Start isIncluded. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:35,884 INFO L87 Difference]: Start difference. First operand 802 states. Second operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:35,916 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 06:08:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 06:08:35,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:35,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:35,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 06:08:35,918 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 802 states. [2022-04-08 06:08:35,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:35,939 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-08 06:08:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-08 06:08:35,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:35,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:35,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:08:35,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:08:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.2037996545768566) internal successors, (697), 596 states have internal predecessors, (697), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-08 06:08:36,014 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-08 06:08:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:08:36,014 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-08 06:08:36,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:36,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-08 06:08:44,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1046 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-08 06:08:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-08 06:08:44,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:08:44,567 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:08:44,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 06:08:44,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 06:08:44,767 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:08:44,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:08:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-08 06:08:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:08:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2122987880] [2022-04-08 06:08:44,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:08:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-08 06:08:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:08:44,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922963146] [2022-04-08 06:08:44,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:08:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:08:44,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:08:44,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381750368] [2022-04-08 06:08:44,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:08:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:08:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:08:44,789 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:08:44,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 06:08:44,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:08:44,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:08:44,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 06:08:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:08:44,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:08:45,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {126910#true} call ULTIMATE.init(); {126910#true} is VALID [2022-04-08 06:08:45,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {126910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126918#(<= ~counter~0 0)} {126910#true} #102#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {126918#(<= ~counter~0 0)} call #t~ret9 := main(); {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {126918#(<= ~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; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {126918#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {126918#(<= ~counter~0 0)} ~cond := #in~cond; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {126918#(<= ~counter~0 0)} assume !(0 == ~cond); {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126918#(<= ~counter~0 0)} {126918#(<= ~counter~0 0)} #90#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,660 INFO L272 TraceCheckUtils]: 11: Hoare triple {126918#(<= ~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)); {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {126918#(<= ~counter~0 0)} ~cond := #in~cond; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {126918#(<= ~counter~0 0)} assume !(0 == ~cond); {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,661 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126918#(<= ~counter~0 0)} {126918#(<= ~counter~0 0)} #92#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {126918#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {126918#(<= ~counter~0 0)} is VALID [2022-04-08 06:08:45,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {126918#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {126967#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {126967#(<= ~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)); {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {126967#(<= ~counter~0 1)} ~cond := #in~cond; {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {126967#(<= ~counter~0 1)} assume !(0 == ~cond); {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {126967#(<= ~counter~0 1)} assume true; {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,666 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126967#(<= ~counter~0 1)} {126967#(<= ~counter~0 1)} #94#return; {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {126967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126967#(<= ~counter~0 1)} is VALID [2022-04-08 06:08:45,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {126967#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {126992#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,668 INFO L272 TraceCheckUtils]: 27: Hoare triple {126992#(<= ~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)); {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {126992#(<= ~counter~0 2)} ~cond := #in~cond; {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {126992#(<= ~counter~0 2)} assume !(0 == ~cond); {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {126992#(<= ~counter~0 2)} assume true; {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,669 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126992#(<= ~counter~0 2)} {126992#(<= ~counter~0 2)} #96#return; {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {126992#(<= ~counter~0 2)} assume !(~r~0 > 0); {126992#(<= ~counter~0 2)} is VALID [2022-04-08 06:08:45,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {126992#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {127017#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {127017#(<= ~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)); {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {127017#(<= ~counter~0 3)} ~cond := #in~cond; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {127017#(<= ~counter~0 3)} assume !(0 == ~cond); {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {127017#(<= ~counter~0 3)} assume true; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,672 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127017#(<= ~counter~0 3)} {127017#(<= ~counter~0 3)} #98#return; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {127017#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127017#(<= ~counter~0 3)} is VALID [2022-04-08 06:08:45,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {127017#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {127042#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,674 INFO L272 TraceCheckUtils]: 43: Hoare triple {127042#(<= ~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)); {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {127042#(<= ~counter~0 4)} ~cond := #in~cond; {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {127042#(<= ~counter~0 4)} assume !(0 == ~cond); {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {127042#(<= ~counter~0 4)} assume true; {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,676 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127042#(<= ~counter~0 4)} {127042#(<= ~counter~0 4)} #98#return; {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {127042#(<= ~counter~0 4)} assume !(~r~0 < 0); {127042#(<= ~counter~0 4)} is VALID [2022-04-08 06:08:45,677 INFO L290 TraceCheckUtils]: 49: Hoare triple {127042#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,677 INFO L290 TraceCheckUtils]: 50: Hoare triple {127067#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,678 INFO L272 TraceCheckUtils]: 51: Hoare triple {127067#(<= ~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)); {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {127067#(<= ~counter~0 5)} ~cond := #in~cond; {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {127067#(<= ~counter~0 5)} assume !(0 == ~cond); {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,679 INFO L290 TraceCheckUtils]: 54: Hoare triple {127067#(<= ~counter~0 5)} assume true; {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,679 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127067#(<= ~counter~0 5)} {127067#(<= ~counter~0 5)} #94#return; {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {127067#(<= ~counter~0 5)} assume !!(0 != ~r~0); {127067#(<= ~counter~0 5)} is VALID [2022-04-08 06:08:45,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {127067#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {127092#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,681 INFO L272 TraceCheckUtils]: 59: Hoare triple {127092#(<= ~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)); {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {127092#(<= ~counter~0 6)} ~cond := #in~cond; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {127092#(<= ~counter~0 6)} assume !(0 == ~cond); {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {127092#(<= ~counter~0 6)} assume true; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,682 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127092#(<= ~counter~0 6)} {127092#(<= ~counter~0 6)} #96#return; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,683 INFO L290 TraceCheckUtils]: 64: Hoare triple {127092#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127092#(<= ~counter~0 6)} is VALID [2022-04-08 06:08:45,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {127092#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {127117#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,685 INFO L272 TraceCheckUtils]: 67: Hoare triple {127117#(<= ~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)); {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {127117#(<= ~counter~0 7)} ~cond := #in~cond; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {127117#(<= ~counter~0 7)} assume !(0 == ~cond); {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {127117#(<= ~counter~0 7)} assume true; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,686 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127117#(<= ~counter~0 7)} {127117#(<= ~counter~0 7)} #96#return; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {127117#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127117#(<= ~counter~0 7)} is VALID [2022-04-08 06:08:45,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {127117#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {127142#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,688 INFO L272 TraceCheckUtils]: 75: Hoare triple {127142#(<= ~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)); {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {127142#(<= ~counter~0 8)} ~cond := #in~cond; {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {127142#(<= ~counter~0 8)} assume !(0 == ~cond); {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,689 INFO L290 TraceCheckUtils]: 78: Hoare triple {127142#(<= ~counter~0 8)} assume true; {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,689 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127142#(<= ~counter~0 8)} {127142#(<= ~counter~0 8)} #96#return; {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {127142#(<= ~counter~0 8)} assume !(~r~0 > 0); {127142#(<= ~counter~0 8)} is VALID [2022-04-08 06:08:45,690 INFO L290 TraceCheckUtils]: 81: Hoare triple {127142#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,691 INFO L290 TraceCheckUtils]: 82: Hoare triple {127167#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,691 INFO L272 TraceCheckUtils]: 83: Hoare triple {127167#(<= ~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)); {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,691 INFO L290 TraceCheckUtils]: 84: Hoare triple {127167#(<= ~counter~0 9)} ~cond := #in~cond; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,692 INFO L290 TraceCheckUtils]: 85: Hoare triple {127167#(<= ~counter~0 9)} assume !(0 == ~cond); {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,692 INFO L290 TraceCheckUtils]: 86: Hoare triple {127167#(<= ~counter~0 9)} assume true; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,692 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127167#(<= ~counter~0 9)} {127167#(<= ~counter~0 9)} #98#return; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,693 INFO L290 TraceCheckUtils]: 88: Hoare triple {127167#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127167#(<= ~counter~0 9)} is VALID [2022-04-08 06:08:45,694 INFO L290 TraceCheckUtils]: 89: Hoare triple {127167#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,694 INFO L290 TraceCheckUtils]: 90: Hoare triple {127192#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,695 INFO L272 TraceCheckUtils]: 91: Hoare triple {127192#(<= ~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)); {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {127192#(<= ~counter~0 10)} ~cond := #in~cond; {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {127192#(<= ~counter~0 10)} assume !(0 == ~cond); {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {127192#(<= ~counter~0 10)} assume true; {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,696 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127192#(<= ~counter~0 10)} {127192#(<= ~counter~0 10)} #98#return; {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,696 INFO L290 TraceCheckUtils]: 96: Hoare triple {127192#(<= ~counter~0 10)} assume !(~r~0 < 0); {127192#(<= ~counter~0 10)} is VALID [2022-04-08 06:08:45,697 INFO L290 TraceCheckUtils]: 97: Hoare triple {127192#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,697 INFO L290 TraceCheckUtils]: 98: Hoare triple {127217#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,698 INFO L272 TraceCheckUtils]: 99: Hoare triple {127217#(<= ~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)); {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,698 INFO L290 TraceCheckUtils]: 100: Hoare triple {127217#(<= ~counter~0 11)} ~cond := #in~cond; {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,698 INFO L290 TraceCheckUtils]: 101: Hoare triple {127217#(<= ~counter~0 11)} assume !(0 == ~cond); {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,699 INFO L290 TraceCheckUtils]: 102: Hoare triple {127217#(<= ~counter~0 11)} assume true; {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,699 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127217#(<= ~counter~0 11)} {127217#(<= ~counter~0 11)} #94#return; {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,699 INFO L290 TraceCheckUtils]: 104: Hoare triple {127217#(<= ~counter~0 11)} assume !!(0 != ~r~0); {127217#(<= ~counter~0 11)} is VALID [2022-04-08 06:08:45,700 INFO L290 TraceCheckUtils]: 105: Hoare triple {127217#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {127242#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,701 INFO L272 TraceCheckUtils]: 107: Hoare triple {127242#(<= ~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)); {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,701 INFO L290 TraceCheckUtils]: 108: Hoare triple {127242#(<= ~counter~0 12)} ~cond := #in~cond; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,702 INFO L290 TraceCheckUtils]: 109: Hoare triple {127242#(<= ~counter~0 12)} assume !(0 == ~cond); {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,702 INFO L290 TraceCheckUtils]: 110: Hoare triple {127242#(<= ~counter~0 12)} assume true; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,702 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127242#(<= ~counter~0 12)} {127242#(<= ~counter~0 12)} #96#return; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,703 INFO L290 TraceCheckUtils]: 112: Hoare triple {127242#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127242#(<= ~counter~0 12)} is VALID [2022-04-08 06:08:45,704 INFO L290 TraceCheckUtils]: 113: Hoare triple {127242#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,704 INFO L290 TraceCheckUtils]: 114: Hoare triple {127267#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,705 INFO L272 TraceCheckUtils]: 115: Hoare triple {127267#(<= ~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)); {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,705 INFO L290 TraceCheckUtils]: 116: Hoare triple {127267#(<= ~counter~0 13)} ~cond := #in~cond; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,705 INFO L290 TraceCheckUtils]: 117: Hoare triple {127267#(<= ~counter~0 13)} assume !(0 == ~cond); {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,705 INFO L290 TraceCheckUtils]: 118: Hoare triple {127267#(<= ~counter~0 13)} assume true; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,706 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127267#(<= ~counter~0 13)} {127267#(<= ~counter~0 13)} #96#return; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,706 INFO L290 TraceCheckUtils]: 120: Hoare triple {127267#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127267#(<= ~counter~0 13)} is VALID [2022-04-08 06:08:45,707 INFO L290 TraceCheckUtils]: 121: Hoare triple {127267#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,707 INFO L290 TraceCheckUtils]: 122: Hoare triple {127292#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,708 INFO L272 TraceCheckUtils]: 123: Hoare triple {127292#(<= ~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)); {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,708 INFO L290 TraceCheckUtils]: 124: Hoare triple {127292#(<= ~counter~0 14)} ~cond := #in~cond; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,708 INFO L290 TraceCheckUtils]: 125: Hoare triple {127292#(<= ~counter~0 14)} assume !(0 == ~cond); {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,709 INFO L290 TraceCheckUtils]: 126: Hoare triple {127292#(<= ~counter~0 14)} assume true; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,709 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127292#(<= ~counter~0 14)} {127292#(<= ~counter~0 14)} #96#return; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,709 INFO L290 TraceCheckUtils]: 128: Hoare triple {127292#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127292#(<= ~counter~0 14)} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 129: Hoare triple {127292#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127317#(<= |main_#t~post7| 14)} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 130: Hoare triple {127317#(<= |main_#t~post7| 14)} assume !(#t~post7 < 100);havoc #t~post7; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 131: Hoare triple {126911#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 132: Hoare triple {126911#false} assume !(#t~post8 < 100);havoc #t~post8; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 133: Hoare triple {126911#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 134: Hoare triple {126911#false} assume !(#t~post6 < 100);havoc #t~post6; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L272 TraceCheckUtils]: 135: Hoare triple {126911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 136: Hoare triple {126911#false} ~cond := #in~cond; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 137: Hoare triple {126911#false} assume 0 == ~cond; {126911#false} is VALID [2022-04-08 06:08:45,710 INFO L290 TraceCheckUtils]: 138: Hoare triple {126911#false} assume !false; {126911#false} is VALID [2022-04-08 06:08:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:08:45,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:08:46,888 INFO L290 TraceCheckUtils]: 138: Hoare triple {126911#false} assume !false; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 137: Hoare triple {126911#false} assume 0 == ~cond; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 136: Hoare triple {126911#false} ~cond := #in~cond; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L272 TraceCheckUtils]: 135: Hoare triple {126911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 134: Hoare triple {126911#false} assume !(#t~post6 < 100);havoc #t~post6; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 133: Hoare triple {126911#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 132: Hoare triple {126911#false} assume !(#t~post8 < 100);havoc #t~post8; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 131: Hoare triple {126911#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 130: Hoare triple {127369#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {126911#false} is VALID [2022-04-08 06:08:46,889 INFO L290 TraceCheckUtils]: 129: Hoare triple {127373#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127369#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:08:46,890 INFO L290 TraceCheckUtils]: 128: Hoare triple {127373#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127373#(< ~counter~0 100)} is VALID [2022-04-08 06:08:46,890 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126910#true} {127373#(< ~counter~0 100)} #96#return; {127373#(< ~counter~0 100)} is VALID [2022-04-08 06:08:46,890 INFO L290 TraceCheckUtils]: 126: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,890 INFO L290 TraceCheckUtils]: 125: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,890 INFO L290 TraceCheckUtils]: 124: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,890 INFO L272 TraceCheckUtils]: 123: Hoare triple {127373#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,891 INFO L290 TraceCheckUtils]: 122: Hoare triple {127373#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {127373#(< ~counter~0 100)} is VALID [2022-04-08 06:08:46,893 INFO L290 TraceCheckUtils]: 121: Hoare triple {127398#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127373#(< ~counter~0 100)} is VALID [2022-04-08 06:08:46,893 INFO L290 TraceCheckUtils]: 120: Hoare triple {127398#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127398#(< ~counter~0 99)} is VALID [2022-04-08 06:08:46,894 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126910#true} {127398#(< ~counter~0 99)} #96#return; {127398#(< ~counter~0 99)} is VALID [2022-04-08 06:08:46,894 INFO L290 TraceCheckUtils]: 118: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,894 INFO L272 TraceCheckUtils]: 115: Hoare triple {127398#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,894 INFO L290 TraceCheckUtils]: 114: Hoare triple {127398#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {127398#(< ~counter~0 99)} is VALID [2022-04-08 06:08:46,895 INFO L290 TraceCheckUtils]: 113: Hoare triple {127423#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127398#(< ~counter~0 99)} is VALID [2022-04-08 06:08:46,896 INFO L290 TraceCheckUtils]: 112: Hoare triple {127423#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127423#(< ~counter~0 98)} is VALID [2022-04-08 06:08:46,896 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126910#true} {127423#(< ~counter~0 98)} #96#return; {127423#(< ~counter~0 98)} is VALID [2022-04-08 06:08:46,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,896 INFO L272 TraceCheckUtils]: 107: Hoare triple {127423#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,897 INFO L290 TraceCheckUtils]: 106: Hoare triple {127423#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {127423#(< ~counter~0 98)} is VALID [2022-04-08 06:08:46,898 INFO L290 TraceCheckUtils]: 105: Hoare triple {127448#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127423#(< ~counter~0 98)} is VALID [2022-04-08 06:08:46,898 INFO L290 TraceCheckUtils]: 104: Hoare triple {127448#(< ~counter~0 97)} assume !!(0 != ~r~0); {127448#(< ~counter~0 97)} is VALID [2022-04-08 06:08:46,898 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126910#true} {127448#(< ~counter~0 97)} #94#return; {127448#(< ~counter~0 97)} is VALID [2022-04-08 06:08:46,898 INFO L290 TraceCheckUtils]: 102: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,898 INFO L290 TraceCheckUtils]: 101: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,898 INFO L290 TraceCheckUtils]: 100: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,899 INFO L272 TraceCheckUtils]: 99: Hoare triple {127448#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {127448#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {127448#(< ~counter~0 97)} is VALID [2022-04-08 06:08:46,900 INFO L290 TraceCheckUtils]: 97: Hoare triple {127473#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127448#(< ~counter~0 97)} is VALID [2022-04-08 06:08:46,900 INFO L290 TraceCheckUtils]: 96: Hoare triple {127473#(< ~counter~0 96)} assume !(~r~0 < 0); {127473#(< ~counter~0 96)} is VALID [2022-04-08 06:08:46,901 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126910#true} {127473#(< ~counter~0 96)} #98#return; {127473#(< ~counter~0 96)} is VALID [2022-04-08 06:08:46,901 INFO L290 TraceCheckUtils]: 94: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,901 INFO L290 TraceCheckUtils]: 93: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,901 INFO L290 TraceCheckUtils]: 92: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,901 INFO L272 TraceCheckUtils]: 91: Hoare triple {127473#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,901 INFO L290 TraceCheckUtils]: 90: Hoare triple {127473#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {127473#(< ~counter~0 96)} is VALID [2022-04-08 06:08:46,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {127498#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127473#(< ~counter~0 96)} is VALID [2022-04-08 06:08:46,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {127498#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127498#(< ~counter~0 95)} is VALID [2022-04-08 06:08:46,903 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126910#true} {127498#(< ~counter~0 95)} #98#return; {127498#(< ~counter~0 95)} is VALID [2022-04-08 06:08:46,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,903 INFO L272 TraceCheckUtils]: 83: Hoare triple {127498#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,903 INFO L290 TraceCheckUtils]: 82: Hoare triple {127498#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {127498#(< ~counter~0 95)} is VALID [2022-04-08 06:08:46,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {127523#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127498#(< ~counter~0 95)} is VALID [2022-04-08 06:08:46,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {127523#(< ~counter~0 94)} assume !(~r~0 > 0); {127523#(< ~counter~0 94)} is VALID [2022-04-08 06:08:46,905 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126910#true} {127523#(< ~counter~0 94)} #96#return; {127523#(< ~counter~0 94)} is VALID [2022-04-08 06:08:46,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,905 INFO L272 TraceCheckUtils]: 75: Hoare triple {127523#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {127523#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {127523#(< ~counter~0 94)} is VALID [2022-04-08 06:08:46,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {127548#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127523#(< ~counter~0 94)} is VALID [2022-04-08 06:08:46,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {127548#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127548#(< ~counter~0 93)} is VALID [2022-04-08 06:08:46,907 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126910#true} {127548#(< ~counter~0 93)} #96#return; {127548#(< ~counter~0 93)} is VALID [2022-04-08 06:08:46,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,907 INFO L272 TraceCheckUtils]: 67: Hoare triple {127548#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {127548#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {127548#(< ~counter~0 93)} is VALID [2022-04-08 06:08:46,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {127573#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127548#(< ~counter~0 93)} is VALID [2022-04-08 06:08:46,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {127573#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127573#(< ~counter~0 92)} is VALID [2022-04-08 06:08:46,909 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126910#true} {127573#(< ~counter~0 92)} #96#return; {127573#(< ~counter~0 92)} is VALID [2022-04-08 06:08:46,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {127573#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {127573#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {127573#(< ~counter~0 92)} is VALID [2022-04-08 06:08:46,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {127598#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127573#(< ~counter~0 92)} is VALID [2022-04-08 06:08:46,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {127598#(< ~counter~0 91)} assume !!(0 != ~r~0); {127598#(< ~counter~0 91)} is VALID [2022-04-08 06:08:46,912 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126910#true} {127598#(< ~counter~0 91)} #94#return; {127598#(< ~counter~0 91)} is VALID [2022-04-08 06:08:46,912 INFO L290 TraceCheckUtils]: 54: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,912 INFO L272 TraceCheckUtils]: 51: Hoare triple {127598#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {127598#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {127598#(< ~counter~0 91)} is VALID [2022-04-08 06:08:46,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {127623#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127598#(< ~counter~0 91)} is VALID [2022-04-08 06:08:46,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {127623#(< ~counter~0 90)} assume !(~r~0 < 0); {127623#(< ~counter~0 90)} is VALID [2022-04-08 06:08:46,914 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126910#true} {127623#(< ~counter~0 90)} #98#return; {127623#(< ~counter~0 90)} is VALID [2022-04-08 06:08:46,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,914 INFO L272 TraceCheckUtils]: 43: Hoare triple {127623#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {127623#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {127623#(< ~counter~0 90)} is VALID [2022-04-08 06:08:46,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {127648#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127623#(< ~counter~0 90)} is VALID [2022-04-08 06:08:46,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {127648#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127648#(< ~counter~0 89)} is VALID [2022-04-08 06:08:46,916 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126910#true} {127648#(< ~counter~0 89)} #98#return; {127648#(< ~counter~0 89)} is VALID [2022-04-08 06:08:46,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {127648#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {127648#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {127648#(< ~counter~0 89)} is VALID [2022-04-08 06:08:46,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {127673#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127648#(< ~counter~0 89)} is VALID [2022-04-08 06:08:46,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {127673#(< ~counter~0 88)} assume !(~r~0 > 0); {127673#(< ~counter~0 88)} is VALID [2022-04-08 06:08:46,918 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126910#true} {127673#(< ~counter~0 88)} #96#return; {127673#(< ~counter~0 88)} is VALID [2022-04-08 06:08:46,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,919 INFO L272 TraceCheckUtils]: 27: Hoare triple {127673#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {127673#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {127673#(< ~counter~0 88)} is VALID [2022-04-08 06:08:46,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {127698#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127673#(< ~counter~0 88)} is VALID [2022-04-08 06:08:46,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {127698#(< ~counter~0 87)} assume !!(0 != ~r~0); {127698#(< ~counter~0 87)} is VALID [2022-04-08 06:08:46,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126910#true} {127698#(< ~counter~0 87)} #94#return; {127698#(< ~counter~0 87)} is VALID [2022-04-08 06:08:46,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,921 INFO L272 TraceCheckUtils]: 19: Hoare triple {127698#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {127698#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {127698#(< ~counter~0 87)} is VALID [2022-04-08 06:08:46,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {127723#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127698#(< ~counter~0 87)} is VALID [2022-04-08 06:08:46,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {127723#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126910#true} {127723#(< ~counter~0 86)} #92#return; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {127723#(< ~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)); {126910#true} is VALID [2022-04-08 06:08:46,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126910#true} {127723#(< ~counter~0 86)} #90#return; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-08 06:08:46,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-08 06:08:46,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-08 06:08:46,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {127723#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126910#true} is VALID [2022-04-08 06:08:46,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {127723#(< ~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; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {127723#(< ~counter~0 86)} call #t~ret9 := main(); {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127723#(< ~counter~0 86)} {126910#true} #102#return; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {127723#(< ~counter~0 86)} assume true; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {126910#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {127723#(< ~counter~0 86)} is VALID [2022-04-08 06:08:46,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {126910#true} call ULTIMATE.init(); {126910#true} is VALID [2022-04-08 06:08:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-08 06:08:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:08:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922963146] [2022-04-08 06:08:46,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:08:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381750368] [2022-04-08 06:08:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381750368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:08:46,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:08:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-08 06:08:46,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:08:46,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2122987880] [2022-04-08 06:08:46,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2122987880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:08:46,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:08:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 06:08:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400726495] [2022-04-08 06:08:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:08:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-08 06:08:46,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:08:46,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:47,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:47,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 06:08:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:08:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 06:08:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 06:08:47,050 INFO L87 Difference]: Start difference. First operand 775 states and 1047 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:51,365 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-08 06:08:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 06:08:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 139 [2022-04-08 06:08:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:08:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:08:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-08 06:08:51,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-08 06:08:51,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:08:51,753 INFO L225 Difference]: With dead ends: 945 [2022-04-08 06:08:51,753 INFO L226 Difference]: Without dead ends: 775 [2022-04-08 06:08:51,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 06:08:51,767 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 229 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:08:51,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 324 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:08:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-08 06:08:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-08 06:08:55,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:08:55,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:55,004 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:55,005 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:55,028 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 06:08:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:08:55,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:55,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:55,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 06:08:55,041 INFO L87 Difference]: Start difference. First operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 775 states. [2022-04-08 06:08:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:08:55,063 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-08 06:08:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:08:55,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:08:55,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:08:55,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:08:55,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:08:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 579 states have (on average 1.1934369602763386) internal successors, (691), 596 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:08:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-08 06:08:55,115 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-08 06:08:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:08:55,116 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-08 06:08:55,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-08 06:08:55,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-08 06:09:04,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1041 edges. 1038 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-08 06:09:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 06:09:04,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:09:04,659 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:09:04,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 06:09:04,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-08 06:09:04,860 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:09:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:09:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-08 06:09:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765176257] [2022-04-08 06:09:04,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:09:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-08 06:09:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:09:04,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358840815] [2022-04-08 06:09:04,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:09:04,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:09:04,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:09:04,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179652652] [2022-04-08 06:09:04,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:09:04,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:09:04,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:09:04,882 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:09:04,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 06:09:04,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:09:04,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:09:04,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:09:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:09:05,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:09:05,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {132793#true} call ULTIMATE.init(); {132793#true} is VALID [2022-04-08 06:09:05,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {132793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132801#(<= ~counter~0 0)} {132793#true} #102#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {132801#(<= ~counter~0 0)} call #t~ret9 := main(); {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {132801#(<= ~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; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {132801#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {132801#(<= ~counter~0 0)} ~cond := #in~cond; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {132801#(<= ~counter~0 0)} assume !(0 == ~cond); {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132801#(<= ~counter~0 0)} {132801#(<= ~counter~0 0)} #90#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,786 INFO L272 TraceCheckUtils]: 11: Hoare triple {132801#(<= ~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)); {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {132801#(<= ~counter~0 0)} ~cond := #in~cond; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {132801#(<= ~counter~0 0)} assume !(0 == ~cond); {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,787 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132801#(<= ~counter~0 0)} {132801#(<= ~counter~0 0)} #92#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {132801#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {132801#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:05,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {132801#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {132850#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {132850#(<= ~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)); {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {132850#(<= ~counter~0 1)} ~cond := #in~cond; {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {132850#(<= ~counter~0 1)} assume !(0 == ~cond); {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {132850#(<= ~counter~0 1)} assume true; {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132850#(<= ~counter~0 1)} {132850#(<= ~counter~0 1)} #94#return; {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {132850#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132850#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:05,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {132850#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {132875#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {132875#(<= ~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)); {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {132875#(<= ~counter~0 2)} ~cond := #in~cond; {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {132875#(<= ~counter~0 2)} assume !(0 == ~cond); {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {132875#(<= ~counter~0 2)} assume true; {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,795 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132875#(<= ~counter~0 2)} {132875#(<= ~counter~0 2)} #96#return; {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {132875#(<= ~counter~0 2)} assume !(~r~0 > 0); {132875#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:05,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {132875#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {132900#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,798 INFO L272 TraceCheckUtils]: 35: Hoare triple {132900#(<= ~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)); {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {132900#(<= ~counter~0 3)} ~cond := #in~cond; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {132900#(<= ~counter~0 3)} assume !(0 == ~cond); {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {132900#(<= ~counter~0 3)} assume true; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,799 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132900#(<= ~counter~0 3)} {132900#(<= ~counter~0 3)} #98#return; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {132900#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {132900#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:05,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {132900#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {132925#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,801 INFO L272 TraceCheckUtils]: 43: Hoare triple {132925#(<= ~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)); {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {132925#(<= ~counter~0 4)} ~cond := #in~cond; {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {132925#(<= ~counter~0 4)} assume !(0 == ~cond); {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {132925#(<= ~counter~0 4)} assume true; {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,802 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132925#(<= ~counter~0 4)} {132925#(<= ~counter~0 4)} #98#return; {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {132925#(<= ~counter~0 4)} assume !(~r~0 < 0); {132925#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:05,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {132925#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {132950#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {132950#(<= ~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)); {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {132950#(<= ~counter~0 5)} ~cond := #in~cond; {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {132950#(<= ~counter~0 5)} assume !(0 == ~cond); {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {132950#(<= ~counter~0 5)} assume true; {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,806 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132950#(<= ~counter~0 5)} {132950#(<= ~counter~0 5)} #94#return; {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {132950#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132950#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:05,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {132950#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {132975#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,808 INFO L272 TraceCheckUtils]: 59: Hoare triple {132975#(<= ~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)); {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {132975#(<= ~counter~0 6)} ~cond := #in~cond; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {132975#(<= ~counter~0 6)} assume !(0 == ~cond); {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {132975#(<= ~counter~0 6)} assume true; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,809 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132975#(<= ~counter~0 6)} {132975#(<= ~counter~0 6)} #96#return; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {132975#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {132975#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:05,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {132975#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {133000#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,811 INFO L272 TraceCheckUtils]: 67: Hoare triple {133000#(<= ~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)); {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {133000#(<= ~counter~0 7)} ~cond := #in~cond; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {133000#(<= ~counter~0 7)} assume !(0 == ~cond); {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {133000#(<= ~counter~0 7)} assume true; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,812 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {133000#(<= ~counter~0 7)} {133000#(<= ~counter~0 7)} #96#return; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {133000#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133000#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:05,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {133000#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {133025#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,814 INFO L272 TraceCheckUtils]: 75: Hoare triple {133025#(<= ~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)); {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,815 INFO L290 TraceCheckUtils]: 76: Hoare triple {133025#(<= ~counter~0 8)} ~cond := #in~cond; {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {133025#(<= ~counter~0 8)} assume !(0 == ~cond); {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {133025#(<= ~counter~0 8)} assume true; {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,816 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {133025#(<= ~counter~0 8)} {133025#(<= ~counter~0 8)} #96#return; {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {133025#(<= ~counter~0 8)} assume !(~r~0 > 0); {133025#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:05,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {133025#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {133050#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,818 INFO L272 TraceCheckUtils]: 83: Hoare triple {133050#(<= ~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)); {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,818 INFO L290 TraceCheckUtils]: 84: Hoare triple {133050#(<= ~counter~0 9)} ~cond := #in~cond; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {133050#(<= ~counter~0 9)} assume !(0 == ~cond); {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {133050#(<= ~counter~0 9)} assume true; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,819 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {133050#(<= ~counter~0 9)} {133050#(<= ~counter~0 9)} #98#return; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,819 INFO L290 TraceCheckUtils]: 88: Hoare triple {133050#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133050#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:05,820 INFO L290 TraceCheckUtils]: 89: Hoare triple {133050#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,820 INFO L290 TraceCheckUtils]: 90: Hoare triple {133075#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,821 INFO L272 TraceCheckUtils]: 91: Hoare triple {133075#(<= ~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)); {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,821 INFO L290 TraceCheckUtils]: 92: Hoare triple {133075#(<= ~counter~0 10)} ~cond := #in~cond; {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,821 INFO L290 TraceCheckUtils]: 93: Hoare triple {133075#(<= ~counter~0 10)} assume !(0 == ~cond); {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,822 INFO L290 TraceCheckUtils]: 94: Hoare triple {133075#(<= ~counter~0 10)} assume true; {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,822 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {133075#(<= ~counter~0 10)} {133075#(<= ~counter~0 10)} #98#return; {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,823 INFO L290 TraceCheckUtils]: 96: Hoare triple {133075#(<= ~counter~0 10)} assume !(~r~0 < 0); {133075#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:05,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {133075#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {133100#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,824 INFO L272 TraceCheckUtils]: 99: Hoare triple {133100#(<= ~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)); {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,825 INFO L290 TraceCheckUtils]: 100: Hoare triple {133100#(<= ~counter~0 11)} ~cond := #in~cond; {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,825 INFO L290 TraceCheckUtils]: 101: Hoare triple {133100#(<= ~counter~0 11)} assume !(0 == ~cond); {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,825 INFO L290 TraceCheckUtils]: 102: Hoare triple {133100#(<= ~counter~0 11)} assume true; {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,826 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {133100#(<= ~counter~0 11)} {133100#(<= ~counter~0 11)} #94#return; {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {133100#(<= ~counter~0 11)} assume !!(0 != ~r~0); {133100#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:05,827 INFO L290 TraceCheckUtils]: 105: Hoare triple {133100#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {133125#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,828 INFO L272 TraceCheckUtils]: 107: Hoare triple {133125#(<= ~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)); {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,828 INFO L290 TraceCheckUtils]: 108: Hoare triple {133125#(<= ~counter~0 12)} ~cond := #in~cond; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,828 INFO L290 TraceCheckUtils]: 109: Hoare triple {133125#(<= ~counter~0 12)} assume !(0 == ~cond); {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,828 INFO L290 TraceCheckUtils]: 110: Hoare triple {133125#(<= ~counter~0 12)} assume true; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,829 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {133125#(<= ~counter~0 12)} {133125#(<= ~counter~0 12)} #96#return; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,829 INFO L290 TraceCheckUtils]: 112: Hoare triple {133125#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133125#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:05,830 INFO L290 TraceCheckUtils]: 113: Hoare triple {133125#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,831 INFO L290 TraceCheckUtils]: 114: Hoare triple {133150#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,831 INFO L272 TraceCheckUtils]: 115: Hoare triple {133150#(<= ~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)); {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,831 INFO L290 TraceCheckUtils]: 116: Hoare triple {133150#(<= ~counter~0 13)} ~cond := #in~cond; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,832 INFO L290 TraceCheckUtils]: 117: Hoare triple {133150#(<= ~counter~0 13)} assume !(0 == ~cond); {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,832 INFO L290 TraceCheckUtils]: 118: Hoare triple {133150#(<= ~counter~0 13)} assume true; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,832 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {133150#(<= ~counter~0 13)} {133150#(<= ~counter~0 13)} #96#return; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,833 INFO L290 TraceCheckUtils]: 120: Hoare triple {133150#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133150#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:05,834 INFO L290 TraceCheckUtils]: 121: Hoare triple {133150#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,834 INFO L290 TraceCheckUtils]: 122: Hoare triple {133175#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,834 INFO L272 TraceCheckUtils]: 123: Hoare triple {133175#(<= ~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)); {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,835 INFO L290 TraceCheckUtils]: 124: Hoare triple {133175#(<= ~counter~0 14)} ~cond := #in~cond; {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,835 INFO L290 TraceCheckUtils]: 125: Hoare triple {133175#(<= ~counter~0 14)} assume !(0 == ~cond); {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,835 INFO L290 TraceCheckUtils]: 126: Hoare triple {133175#(<= ~counter~0 14)} assume true; {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,836 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {133175#(<= ~counter~0 14)} {133175#(<= ~counter~0 14)} #96#return; {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,836 INFO L290 TraceCheckUtils]: 128: Hoare triple {133175#(<= ~counter~0 14)} assume !(~r~0 > 0); {133175#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:05,837 INFO L290 TraceCheckUtils]: 129: Hoare triple {133175#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,837 INFO L290 TraceCheckUtils]: 130: Hoare triple {133200#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,838 INFO L272 TraceCheckUtils]: 131: Hoare triple {133200#(<= ~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)); {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,838 INFO L290 TraceCheckUtils]: 132: Hoare triple {133200#(<= ~counter~0 15)} ~cond := #in~cond; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,838 INFO L290 TraceCheckUtils]: 133: Hoare triple {133200#(<= ~counter~0 15)} assume !(0 == ~cond); {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,839 INFO L290 TraceCheckUtils]: 134: Hoare triple {133200#(<= ~counter~0 15)} assume true; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,839 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {133200#(<= ~counter~0 15)} {133200#(<= ~counter~0 15)} #98#return; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,839 INFO L290 TraceCheckUtils]: 136: Hoare triple {133200#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133200#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 137: Hoare triple {133200#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133225#(<= |main_#t~post8| 15)} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 138: Hoare triple {133225#(<= |main_#t~post8| 15)} assume !(#t~post8 < 100);havoc #t~post8; {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 139: Hoare triple {132794#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 140: Hoare triple {132794#false} assume !(#t~post6 < 100);havoc #t~post6; {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L272 TraceCheckUtils]: 141: Hoare triple {132794#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 142: Hoare triple {132794#false} ~cond := #in~cond; {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 143: Hoare triple {132794#false} assume 0 == ~cond; {132794#false} is VALID [2022-04-08 06:09:05,840 INFO L290 TraceCheckUtils]: 144: Hoare triple {132794#false} assume !false; {132794#false} is VALID [2022-04-08 06:09:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 566 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:09:05,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 144: Hoare triple {132794#false} assume !false; {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {132794#false} assume 0 == ~cond; {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {132794#false} ~cond := #in~cond; {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L272 TraceCheckUtils]: 141: Hoare triple {132794#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 140: Hoare triple {132794#false} assume !(#t~post6 < 100);havoc #t~post6; {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {132794#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132794#false} is VALID [2022-04-08 06:09:06,782 INFO L290 TraceCheckUtils]: 138: Hoare triple {133265#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {132794#false} is VALID [2022-04-08 06:09:06,783 INFO L290 TraceCheckUtils]: 137: Hoare triple {133269#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133265#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:09:06,783 INFO L290 TraceCheckUtils]: 136: Hoare triple {133269#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133269#(< ~counter~0 100)} is VALID [2022-04-08 06:09:06,784 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132793#true} {133269#(< ~counter~0 100)} #98#return; {133269#(< ~counter~0 100)} is VALID [2022-04-08 06:09:06,784 INFO L290 TraceCheckUtils]: 134: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,784 INFO L290 TraceCheckUtils]: 133: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,784 INFO L290 TraceCheckUtils]: 132: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,784 INFO L272 TraceCheckUtils]: 131: Hoare triple {133269#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,784 INFO L290 TraceCheckUtils]: 130: Hoare triple {133269#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {133269#(< ~counter~0 100)} is VALID [2022-04-08 06:09:06,787 INFO L290 TraceCheckUtils]: 129: Hoare triple {133294#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133269#(< ~counter~0 100)} is VALID [2022-04-08 06:09:06,787 INFO L290 TraceCheckUtils]: 128: Hoare triple {133294#(< ~counter~0 99)} assume !(~r~0 > 0); {133294#(< ~counter~0 99)} is VALID [2022-04-08 06:09:06,787 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132793#true} {133294#(< ~counter~0 99)} #96#return; {133294#(< ~counter~0 99)} is VALID [2022-04-08 06:09:06,787 INFO L290 TraceCheckUtils]: 126: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,787 INFO L290 TraceCheckUtils]: 125: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,787 INFO L290 TraceCheckUtils]: 124: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,788 INFO L272 TraceCheckUtils]: 123: Hoare triple {133294#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,788 INFO L290 TraceCheckUtils]: 122: Hoare triple {133294#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {133294#(< ~counter~0 99)} is VALID [2022-04-08 06:09:06,789 INFO L290 TraceCheckUtils]: 121: Hoare triple {133319#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133294#(< ~counter~0 99)} is VALID [2022-04-08 06:09:06,789 INFO L290 TraceCheckUtils]: 120: Hoare triple {133319#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133319#(< ~counter~0 98)} is VALID [2022-04-08 06:09:06,790 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132793#true} {133319#(< ~counter~0 98)} #96#return; {133319#(< ~counter~0 98)} is VALID [2022-04-08 06:09:06,790 INFO L290 TraceCheckUtils]: 118: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,790 INFO L290 TraceCheckUtils]: 117: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,790 INFO L290 TraceCheckUtils]: 116: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,790 INFO L272 TraceCheckUtils]: 115: Hoare triple {133319#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,790 INFO L290 TraceCheckUtils]: 114: Hoare triple {133319#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {133319#(< ~counter~0 98)} is VALID [2022-04-08 06:09:06,791 INFO L290 TraceCheckUtils]: 113: Hoare triple {133344#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133319#(< ~counter~0 98)} is VALID [2022-04-08 06:09:06,791 INFO L290 TraceCheckUtils]: 112: Hoare triple {133344#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133344#(< ~counter~0 97)} is VALID [2022-04-08 06:09:06,792 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132793#true} {133344#(< ~counter~0 97)} #96#return; {133344#(< ~counter~0 97)} is VALID [2022-04-08 06:09:06,792 INFO L290 TraceCheckUtils]: 110: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,792 INFO L272 TraceCheckUtils]: 107: Hoare triple {133344#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,792 INFO L290 TraceCheckUtils]: 106: Hoare triple {133344#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {133344#(< ~counter~0 97)} is VALID [2022-04-08 06:09:06,793 INFO L290 TraceCheckUtils]: 105: Hoare triple {133369#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133344#(< ~counter~0 97)} is VALID [2022-04-08 06:09:06,794 INFO L290 TraceCheckUtils]: 104: Hoare triple {133369#(< ~counter~0 96)} assume !!(0 != ~r~0); {133369#(< ~counter~0 96)} is VALID [2022-04-08 06:09:06,794 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132793#true} {133369#(< ~counter~0 96)} #94#return; {133369#(< ~counter~0 96)} is VALID [2022-04-08 06:09:06,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,794 INFO L290 TraceCheckUtils]: 101: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,794 INFO L290 TraceCheckUtils]: 100: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,794 INFO L272 TraceCheckUtils]: 99: Hoare triple {133369#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {133369#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {133369#(< ~counter~0 96)} is VALID [2022-04-08 06:09:06,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {133394#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133369#(< ~counter~0 96)} is VALID [2022-04-08 06:09:06,796 INFO L290 TraceCheckUtils]: 96: Hoare triple {133394#(< ~counter~0 95)} assume !(~r~0 < 0); {133394#(< ~counter~0 95)} is VALID [2022-04-08 06:09:06,797 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132793#true} {133394#(< ~counter~0 95)} #98#return; {133394#(< ~counter~0 95)} is VALID [2022-04-08 06:09:06,797 INFO L290 TraceCheckUtils]: 94: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,797 INFO L290 TraceCheckUtils]: 93: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,797 INFO L290 TraceCheckUtils]: 92: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,797 INFO L272 TraceCheckUtils]: 91: Hoare triple {133394#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,797 INFO L290 TraceCheckUtils]: 90: Hoare triple {133394#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {133394#(< ~counter~0 95)} is VALID [2022-04-08 06:09:06,798 INFO L290 TraceCheckUtils]: 89: Hoare triple {133419#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133394#(< ~counter~0 95)} is VALID [2022-04-08 06:09:06,798 INFO L290 TraceCheckUtils]: 88: Hoare triple {133419#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133419#(< ~counter~0 94)} is VALID [2022-04-08 06:09:06,799 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132793#true} {133419#(< ~counter~0 94)} #98#return; {133419#(< ~counter~0 94)} is VALID [2022-04-08 06:09:06,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,799 INFO L272 TraceCheckUtils]: 83: Hoare triple {133419#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {133419#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {133419#(< ~counter~0 94)} is VALID [2022-04-08 06:09:06,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {133444#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133419#(< ~counter~0 94)} is VALID [2022-04-08 06:09:06,801 INFO L290 TraceCheckUtils]: 80: Hoare triple {133444#(< ~counter~0 93)} assume !(~r~0 > 0); {133444#(< ~counter~0 93)} is VALID [2022-04-08 06:09:06,801 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132793#true} {133444#(< ~counter~0 93)} #96#return; {133444#(< ~counter~0 93)} is VALID [2022-04-08 06:09:06,801 INFO L290 TraceCheckUtils]: 78: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,801 INFO L290 TraceCheckUtils]: 77: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,801 INFO L290 TraceCheckUtils]: 76: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,801 INFO L272 TraceCheckUtils]: 75: Hoare triple {133444#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {133444#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {133444#(< ~counter~0 93)} is VALID [2022-04-08 06:09:06,803 INFO L290 TraceCheckUtils]: 73: Hoare triple {133469#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133444#(< ~counter~0 93)} is VALID [2022-04-08 06:09:06,803 INFO L290 TraceCheckUtils]: 72: Hoare triple {133469#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133469#(< ~counter~0 92)} is VALID [2022-04-08 06:09:06,803 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132793#true} {133469#(< ~counter~0 92)} #96#return; {133469#(< ~counter~0 92)} is VALID [2022-04-08 06:09:06,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,803 INFO L290 TraceCheckUtils]: 69: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,804 INFO L272 TraceCheckUtils]: 67: Hoare triple {133469#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {133469#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {133469#(< ~counter~0 92)} is VALID [2022-04-08 06:09:06,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {133494#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133469#(< ~counter~0 92)} is VALID [2022-04-08 06:09:06,805 INFO L290 TraceCheckUtils]: 64: Hoare triple {133494#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133494#(< ~counter~0 91)} is VALID [2022-04-08 06:09:06,806 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132793#true} {133494#(< ~counter~0 91)} #96#return; {133494#(< ~counter~0 91)} is VALID [2022-04-08 06:09:06,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,806 INFO L272 TraceCheckUtils]: 59: Hoare triple {133494#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {133494#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {133494#(< ~counter~0 91)} is VALID [2022-04-08 06:09:06,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {133519#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133494#(< ~counter~0 91)} is VALID [2022-04-08 06:09:06,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {133519#(< ~counter~0 90)} assume !!(0 != ~r~0); {133519#(< ~counter~0 90)} is VALID [2022-04-08 06:09:06,808 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132793#true} {133519#(< ~counter~0 90)} #94#return; {133519#(< ~counter~0 90)} is VALID [2022-04-08 06:09:06,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,808 INFO L272 TraceCheckUtils]: 51: Hoare triple {133519#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {133519#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {133519#(< ~counter~0 90)} is VALID [2022-04-08 06:09:06,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {133544#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133519#(< ~counter~0 90)} is VALID [2022-04-08 06:09:06,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {133544#(< ~counter~0 89)} assume !(~r~0 < 0); {133544#(< ~counter~0 89)} is VALID [2022-04-08 06:09:06,810 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132793#true} {133544#(< ~counter~0 89)} #98#return; {133544#(< ~counter~0 89)} is VALID [2022-04-08 06:09:06,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,810 INFO L272 TraceCheckUtils]: 43: Hoare triple {133544#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {133544#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {133544#(< ~counter~0 89)} is VALID [2022-04-08 06:09:06,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {133569#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133544#(< ~counter~0 89)} is VALID [2022-04-08 06:09:06,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {133569#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133569#(< ~counter~0 88)} is VALID [2022-04-08 06:09:06,812 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132793#true} {133569#(< ~counter~0 88)} #98#return; {133569#(< ~counter~0 88)} is VALID [2022-04-08 06:09:06,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,813 INFO L272 TraceCheckUtils]: 35: Hoare triple {133569#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {133569#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {133569#(< ~counter~0 88)} is VALID [2022-04-08 06:09:06,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {133594#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133569#(< ~counter~0 88)} is VALID [2022-04-08 06:09:06,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {133594#(< ~counter~0 87)} assume !(~r~0 > 0); {133594#(< ~counter~0 87)} is VALID [2022-04-08 06:09:06,815 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132793#true} {133594#(< ~counter~0 87)} #96#return; {133594#(< ~counter~0 87)} is VALID [2022-04-08 06:09:06,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,815 INFO L272 TraceCheckUtils]: 27: Hoare triple {133594#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {133594#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {133594#(< ~counter~0 87)} is VALID [2022-04-08 06:09:06,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {133619#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133594#(< ~counter~0 87)} is VALID [2022-04-08 06:09:06,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {133619#(< ~counter~0 86)} assume !!(0 != ~r~0); {133619#(< ~counter~0 86)} is VALID [2022-04-08 06:09:06,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132793#true} {133619#(< ~counter~0 86)} #94#return; {133619#(< ~counter~0 86)} is VALID [2022-04-08 06:09:06,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,817 INFO L272 TraceCheckUtils]: 19: Hoare triple {133619#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {133619#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {133619#(< ~counter~0 86)} is VALID [2022-04-08 06:09:06,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {133644#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133619#(< ~counter~0 86)} is VALID [2022-04-08 06:09:06,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {133644#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,851 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132793#true} {133644#(< ~counter~0 85)} #92#return; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {133644#(< ~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)); {132793#true} is VALID [2022-04-08 06:09:06,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132793#true} {133644#(< ~counter~0 85)} #90#return; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-08 06:09:06,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-08 06:09:06,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-08 06:09:06,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {133644#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132793#true} is VALID [2022-04-08 06:09:06,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {133644#(< ~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; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {133644#(< ~counter~0 85)} call #t~ret9 := main(); {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133644#(< ~counter~0 85)} {132793#true} #102#return; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {133644#(< ~counter~0 85)} assume true; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {132793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {133644#(< ~counter~0 85)} is VALID [2022-04-08 06:09:06,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {132793#true} call ULTIMATE.init(); {132793#true} is VALID [2022-04-08 06:09:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 06:09:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:09:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358840815] [2022-04-08 06:09:06,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:09:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179652652] [2022-04-08 06:09:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179652652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:09:06,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:09:06,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:09:06,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:09:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765176257] [2022-04-08 06:09:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765176257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:09:06,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:09:06,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:09:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221125098] [2022-04-08 06:09:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:09:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-08 06:09:06,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:09:06,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:07,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:07,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:09:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:09:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:09:07,069 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:11,789 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-08 06:09:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 06:09:11,790 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 145 [2022-04-08 06:09:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:09:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 06:09:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-08 06:09:11,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-08 06:09:12,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:12,210 INFO L225 Difference]: With dead ends: 981 [2022-04-08 06:09:12,210 INFO L226 Difference]: Without dead ends: 789 [2022-04-08 06:09:12,211 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=995, Invalid=1357, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 06:09:12,212 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 206 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:09:12,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 361 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:09:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-08 06:09:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-08 06:09:14,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:09:14,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:14,822 INFO L74 IsIncluded]: Start isIncluded. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:14,822 INFO L87 Difference]: Start difference. First operand 789 states. Second operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:14,846 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 06:09:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 06:09:14,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:14,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:14,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 06:09:14,848 INFO L87 Difference]: Start difference. First operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 789 states. [2022-04-08 06:09:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:14,870 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-08 06:09:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-08 06:09:14,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:14,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:14,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:09:14,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:09:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 582 states have (on average 1.1872852233676976) internal successors, (691), 594 states have internal predecessors, (691), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-08 06:09:14,900 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-08 06:09:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:09:14,900 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-08 06:09:14,900 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:14,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-08 06:09:21,062 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-08 06:09:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-08 06:09:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 06:09:21,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:09:21,064 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 9, 8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:09:21,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-08 06:09:21,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 06:09:21,264 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:09:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:09:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-08 06:09:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576043356] [2022-04-08 06:09:21,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:09:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-08 06:09:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:09:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924831019] [2022-04-08 06:09:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:09:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:09:21,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:09:21,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209106077] [2022-04-08 06:09:21,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:09:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:09:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:09:21,282 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:09:21,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 06:09:21,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:09:21,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:09:21,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 06:09:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:09:21,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:09:22,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {138820#true} call ULTIMATE.init(); {138820#true} is VALID [2022-04-08 06:09:22,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {138820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138828#(<= ~counter~0 0)} {138820#true} #102#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {138828#(<= ~counter~0 0)} call #t~ret9 := main(); {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {138828#(<= ~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; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {138828#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {138828#(<= ~counter~0 0)} ~cond := #in~cond; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {138828#(<= ~counter~0 0)} assume !(0 == ~cond); {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138828#(<= ~counter~0 0)} {138828#(<= ~counter~0 0)} #90#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,189 INFO L272 TraceCheckUtils]: 11: Hoare triple {138828#(<= ~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)); {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {138828#(<= ~counter~0 0)} ~cond := #in~cond; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {138828#(<= ~counter~0 0)} assume !(0 == ~cond); {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,190 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138828#(<= ~counter~0 0)} {138828#(<= ~counter~0 0)} #92#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {138828#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {138828#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:22,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {138828#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {138877#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {138877#(<= ~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)); {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {138877#(<= ~counter~0 1)} ~cond := #in~cond; {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {138877#(<= ~counter~0 1)} assume !(0 == ~cond); {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {138877#(<= ~counter~0 1)} assume true; {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,194 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138877#(<= ~counter~0 1)} {138877#(<= ~counter~0 1)} #94#return; {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {138877#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138877#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:22,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {138877#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {138902#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,196 INFO L272 TraceCheckUtils]: 27: Hoare triple {138902#(<= ~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)); {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {138902#(<= ~counter~0 2)} ~cond := #in~cond; {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {138902#(<= ~counter~0 2)} assume !(0 == ~cond); {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {138902#(<= ~counter~0 2)} assume true; {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,197 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138902#(<= ~counter~0 2)} {138902#(<= ~counter~0 2)} #96#return; {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {138902#(<= ~counter~0 2)} assume !(~r~0 > 0); {138902#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:22,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {138902#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {138927#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,199 INFO L272 TraceCheckUtils]: 35: Hoare triple {138927#(<= ~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)); {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {138927#(<= ~counter~0 3)} ~cond := #in~cond; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {138927#(<= ~counter~0 3)} assume !(0 == ~cond); {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {138927#(<= ~counter~0 3)} assume true; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,201 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138927#(<= ~counter~0 3)} {138927#(<= ~counter~0 3)} #98#return; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {138927#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {138927#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:22,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {138927#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {138952#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,202 INFO L272 TraceCheckUtils]: 43: Hoare triple {138952#(<= ~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)); {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {138952#(<= ~counter~0 4)} ~cond := #in~cond; {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {138952#(<= ~counter~0 4)} assume !(0 == ~cond); {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {138952#(<= ~counter~0 4)} assume true; {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,204 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138952#(<= ~counter~0 4)} {138952#(<= ~counter~0 4)} #98#return; {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {138952#(<= ~counter~0 4)} assume !(~r~0 < 0); {138952#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:22,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {138952#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {138977#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,206 INFO L272 TraceCheckUtils]: 51: Hoare triple {138977#(<= ~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)); {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,206 INFO L290 TraceCheckUtils]: 52: Hoare triple {138977#(<= ~counter~0 5)} ~cond := #in~cond; {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,206 INFO L290 TraceCheckUtils]: 53: Hoare triple {138977#(<= ~counter~0 5)} assume !(0 == ~cond); {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {138977#(<= ~counter~0 5)} assume true; {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,207 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138977#(<= ~counter~0 5)} {138977#(<= ~counter~0 5)} #94#return; {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {138977#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138977#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:22,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {138977#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {139002#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,209 INFO L272 TraceCheckUtils]: 59: Hoare triple {139002#(<= ~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)); {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {139002#(<= ~counter~0 6)} ~cond := #in~cond; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {139002#(<= ~counter~0 6)} assume !(0 == ~cond); {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {139002#(<= ~counter~0 6)} assume true; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,210 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {139002#(<= ~counter~0 6)} {139002#(<= ~counter~0 6)} #96#return; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {139002#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139002#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:22,211 INFO L290 TraceCheckUtils]: 65: Hoare triple {139002#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {139027#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,212 INFO L272 TraceCheckUtils]: 67: Hoare triple {139027#(<= ~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)); {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {139027#(<= ~counter~0 7)} ~cond := #in~cond; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {139027#(<= ~counter~0 7)} assume !(0 == ~cond); {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {139027#(<= ~counter~0 7)} assume true; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,213 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {139027#(<= ~counter~0 7)} {139027#(<= ~counter~0 7)} #96#return; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,213 INFO L290 TraceCheckUtils]: 72: Hoare triple {139027#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139027#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:22,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {139027#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {139052#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,215 INFO L272 TraceCheckUtils]: 75: Hoare triple {139052#(<= ~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)); {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {139052#(<= ~counter~0 8)} ~cond := #in~cond; {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {139052#(<= ~counter~0 8)} assume !(0 == ~cond); {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {139052#(<= ~counter~0 8)} assume true; {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,216 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {139052#(<= ~counter~0 8)} {139052#(<= ~counter~0 8)} #96#return; {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {139052#(<= ~counter~0 8)} assume !(~r~0 > 0); {139052#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:22,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {139052#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {139077#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,218 INFO L272 TraceCheckUtils]: 83: Hoare triple {139077#(<= ~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)); {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {139077#(<= ~counter~0 9)} ~cond := #in~cond; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {139077#(<= ~counter~0 9)} assume !(0 == ~cond); {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {139077#(<= ~counter~0 9)} assume true; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,219 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {139077#(<= ~counter~0 9)} {139077#(<= ~counter~0 9)} #98#return; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {139077#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139077#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:22,220 INFO L290 TraceCheckUtils]: 89: Hoare triple {139077#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,220 INFO L290 TraceCheckUtils]: 90: Hoare triple {139102#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,221 INFO L272 TraceCheckUtils]: 91: Hoare triple {139102#(<= ~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)); {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {139102#(<= ~counter~0 10)} ~cond := #in~cond; {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,221 INFO L290 TraceCheckUtils]: 93: Hoare triple {139102#(<= ~counter~0 10)} assume !(0 == ~cond); {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,221 INFO L290 TraceCheckUtils]: 94: Hoare triple {139102#(<= ~counter~0 10)} assume true; {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,222 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {139102#(<= ~counter~0 10)} {139102#(<= ~counter~0 10)} #98#return; {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,222 INFO L290 TraceCheckUtils]: 96: Hoare triple {139102#(<= ~counter~0 10)} assume !(~r~0 < 0); {139102#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:22,223 INFO L290 TraceCheckUtils]: 97: Hoare triple {139102#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,223 INFO L290 TraceCheckUtils]: 98: Hoare triple {139127#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,224 INFO L272 TraceCheckUtils]: 99: Hoare triple {139127#(<= ~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)); {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,224 INFO L290 TraceCheckUtils]: 100: Hoare triple {139127#(<= ~counter~0 11)} ~cond := #in~cond; {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,224 INFO L290 TraceCheckUtils]: 101: Hoare triple {139127#(<= ~counter~0 11)} assume !(0 == ~cond); {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,224 INFO L290 TraceCheckUtils]: 102: Hoare triple {139127#(<= ~counter~0 11)} assume true; {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,225 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {139127#(<= ~counter~0 11)} {139127#(<= ~counter~0 11)} #94#return; {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,225 INFO L290 TraceCheckUtils]: 104: Hoare triple {139127#(<= ~counter~0 11)} assume !!(0 != ~r~0); {139127#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:22,226 INFO L290 TraceCheckUtils]: 105: Hoare triple {139127#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,249 INFO L290 TraceCheckUtils]: 106: Hoare triple {139152#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,250 INFO L272 TraceCheckUtils]: 107: Hoare triple {139152#(<= ~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)); {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,250 INFO L290 TraceCheckUtils]: 108: Hoare triple {139152#(<= ~counter~0 12)} ~cond := #in~cond; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,250 INFO L290 TraceCheckUtils]: 109: Hoare triple {139152#(<= ~counter~0 12)} assume !(0 == ~cond); {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,250 INFO L290 TraceCheckUtils]: 110: Hoare triple {139152#(<= ~counter~0 12)} assume true; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,251 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {139152#(<= ~counter~0 12)} {139152#(<= ~counter~0 12)} #96#return; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,251 INFO L290 TraceCheckUtils]: 112: Hoare triple {139152#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139152#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:22,254 INFO L290 TraceCheckUtils]: 113: Hoare triple {139152#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,254 INFO L290 TraceCheckUtils]: 114: Hoare triple {139177#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,254 INFO L272 TraceCheckUtils]: 115: Hoare triple {139177#(<= ~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)); {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,255 INFO L290 TraceCheckUtils]: 116: Hoare triple {139177#(<= ~counter~0 13)} ~cond := #in~cond; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,255 INFO L290 TraceCheckUtils]: 117: Hoare triple {139177#(<= ~counter~0 13)} assume !(0 == ~cond); {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,255 INFO L290 TraceCheckUtils]: 118: Hoare triple {139177#(<= ~counter~0 13)} assume true; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,256 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {139177#(<= ~counter~0 13)} {139177#(<= ~counter~0 13)} #96#return; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,256 INFO L290 TraceCheckUtils]: 120: Hoare triple {139177#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139177#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:22,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {139177#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {139202#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,258 INFO L272 TraceCheckUtils]: 123: Hoare triple {139202#(<= ~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)); {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,258 INFO L290 TraceCheckUtils]: 124: Hoare triple {139202#(<= ~counter~0 14)} ~cond := #in~cond; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,258 INFO L290 TraceCheckUtils]: 125: Hoare triple {139202#(<= ~counter~0 14)} assume !(0 == ~cond); {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {139202#(<= ~counter~0 14)} assume true; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,259 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {139202#(<= ~counter~0 14)} {139202#(<= ~counter~0 14)} #96#return; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,259 INFO L290 TraceCheckUtils]: 128: Hoare triple {139202#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139202#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:22,260 INFO L290 TraceCheckUtils]: 129: Hoare triple {139202#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,260 INFO L290 TraceCheckUtils]: 130: Hoare triple {139227#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,261 INFO L272 TraceCheckUtils]: 131: Hoare triple {139227#(<= ~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)); {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,261 INFO L290 TraceCheckUtils]: 132: Hoare triple {139227#(<= ~counter~0 15)} ~cond := #in~cond; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,261 INFO L290 TraceCheckUtils]: 133: Hoare triple {139227#(<= ~counter~0 15)} assume !(0 == ~cond); {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,262 INFO L290 TraceCheckUtils]: 134: Hoare triple {139227#(<= ~counter~0 15)} assume true; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,262 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {139227#(<= ~counter~0 15)} {139227#(<= ~counter~0 15)} #96#return; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,262 INFO L290 TraceCheckUtils]: 136: Hoare triple {139227#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139227#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:22,262 INFO L290 TraceCheckUtils]: 137: Hoare triple {139227#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139252#(<= |main_#t~post7| 15)} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 138: Hoare triple {139252#(<= |main_#t~post7| 15)} assume !(#t~post7 < 100);havoc #t~post7; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 139: Hoare triple {138821#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 140: Hoare triple {138821#false} assume !(#t~post8 < 100);havoc #t~post8; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 141: Hoare triple {138821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 142: Hoare triple {138821#false} assume !(#t~post6 < 100);havoc #t~post6; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L272 TraceCheckUtils]: 143: Hoare triple {138821#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 144: Hoare triple {138821#false} ~cond := #in~cond; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 145: Hoare triple {138821#false} assume 0 == ~cond; {138821#false} is VALID [2022-04-08 06:09:22,263 INFO L290 TraceCheckUtils]: 146: Hoare triple {138821#false} assume !false; {138821#false} is VALID [2022-04-08 06:09:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 584 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:09:22,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:09:23,083 INFO L290 TraceCheckUtils]: 146: Hoare triple {138821#false} assume !false; {138821#false} is VALID [2022-04-08 06:09:23,083 INFO L290 TraceCheckUtils]: 145: Hoare triple {138821#false} assume 0 == ~cond; {138821#false} is VALID [2022-04-08 06:09:23,083 INFO L290 TraceCheckUtils]: 144: Hoare triple {138821#false} ~cond := #in~cond; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L272 TraceCheckUtils]: 143: Hoare triple {138821#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 142: Hoare triple {138821#false} assume !(#t~post6 < 100);havoc #t~post6; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 141: Hoare triple {138821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 140: Hoare triple {138821#false} assume !(#t~post8 < 100);havoc #t~post8; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 139: Hoare triple {138821#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 138: Hoare triple {139304#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {138821#false} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 137: Hoare triple {139308#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139304#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:09:23,084 INFO L290 TraceCheckUtils]: 136: Hoare triple {139308#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139308#(< ~counter~0 100)} is VALID [2022-04-08 06:09:23,085 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138820#true} {139308#(< ~counter~0 100)} #96#return; {139308#(< ~counter~0 100)} is VALID [2022-04-08 06:09:23,085 INFO L290 TraceCheckUtils]: 134: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,085 INFO L290 TraceCheckUtils]: 133: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,085 INFO L290 TraceCheckUtils]: 132: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,085 INFO L272 TraceCheckUtils]: 131: Hoare triple {139308#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,085 INFO L290 TraceCheckUtils]: 130: Hoare triple {139308#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {139308#(< ~counter~0 100)} is VALID [2022-04-08 06:09:23,088 INFO L290 TraceCheckUtils]: 129: Hoare triple {139333#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139308#(< ~counter~0 100)} is VALID [2022-04-08 06:09:23,088 INFO L290 TraceCheckUtils]: 128: Hoare triple {139333#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139333#(< ~counter~0 99)} is VALID [2022-04-08 06:09:23,088 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138820#true} {139333#(< ~counter~0 99)} #96#return; {139333#(< ~counter~0 99)} is VALID [2022-04-08 06:09:23,089 INFO L290 TraceCheckUtils]: 126: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,089 INFO L290 TraceCheckUtils]: 125: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,089 INFO L290 TraceCheckUtils]: 124: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,089 INFO L272 TraceCheckUtils]: 123: Hoare triple {139333#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,089 INFO L290 TraceCheckUtils]: 122: Hoare triple {139333#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {139333#(< ~counter~0 99)} is VALID [2022-04-08 06:09:23,090 INFO L290 TraceCheckUtils]: 121: Hoare triple {139358#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139333#(< ~counter~0 99)} is VALID [2022-04-08 06:09:23,090 INFO L290 TraceCheckUtils]: 120: Hoare triple {139358#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139358#(< ~counter~0 98)} is VALID [2022-04-08 06:09:23,091 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138820#true} {139358#(< ~counter~0 98)} #96#return; {139358#(< ~counter~0 98)} is VALID [2022-04-08 06:09:23,091 INFO L290 TraceCheckUtils]: 118: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,091 INFO L272 TraceCheckUtils]: 115: Hoare triple {139358#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,091 INFO L290 TraceCheckUtils]: 114: Hoare triple {139358#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {139358#(< ~counter~0 98)} is VALID [2022-04-08 06:09:23,092 INFO L290 TraceCheckUtils]: 113: Hoare triple {139383#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139358#(< ~counter~0 98)} is VALID [2022-04-08 06:09:23,092 INFO L290 TraceCheckUtils]: 112: Hoare triple {139383#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139383#(< ~counter~0 97)} is VALID [2022-04-08 06:09:23,093 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138820#true} {139383#(< ~counter~0 97)} #96#return; {139383#(< ~counter~0 97)} is VALID [2022-04-08 06:09:23,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,093 INFO L290 TraceCheckUtils]: 108: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,093 INFO L272 TraceCheckUtils]: 107: Hoare triple {139383#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,093 INFO L290 TraceCheckUtils]: 106: Hoare triple {139383#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {139383#(< ~counter~0 97)} is VALID [2022-04-08 06:09:23,094 INFO L290 TraceCheckUtils]: 105: Hoare triple {139408#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139383#(< ~counter~0 97)} is VALID [2022-04-08 06:09:23,094 INFO L290 TraceCheckUtils]: 104: Hoare triple {139408#(< ~counter~0 96)} assume !!(0 != ~r~0); {139408#(< ~counter~0 96)} is VALID [2022-04-08 06:09:23,095 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138820#true} {139408#(< ~counter~0 96)} #94#return; {139408#(< ~counter~0 96)} is VALID [2022-04-08 06:09:23,095 INFO L290 TraceCheckUtils]: 102: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,095 INFO L290 TraceCheckUtils]: 100: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,095 INFO L272 TraceCheckUtils]: 99: Hoare triple {139408#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,095 INFO L290 TraceCheckUtils]: 98: Hoare triple {139408#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {139408#(< ~counter~0 96)} is VALID [2022-04-08 06:09:23,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {139433#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139408#(< ~counter~0 96)} is VALID [2022-04-08 06:09:23,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {139433#(< ~counter~0 95)} assume !(~r~0 < 0); {139433#(< ~counter~0 95)} is VALID [2022-04-08 06:09:23,097 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138820#true} {139433#(< ~counter~0 95)} #98#return; {139433#(< ~counter~0 95)} is VALID [2022-04-08 06:09:23,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,097 INFO L272 TraceCheckUtils]: 91: Hoare triple {139433#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,097 INFO L290 TraceCheckUtils]: 90: Hoare triple {139433#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {139433#(< ~counter~0 95)} is VALID [2022-04-08 06:09:23,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {139458#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139433#(< ~counter~0 95)} is VALID [2022-04-08 06:09:23,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {139458#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139458#(< ~counter~0 94)} is VALID [2022-04-08 06:09:23,099 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138820#true} {139458#(< ~counter~0 94)} #98#return; {139458#(< ~counter~0 94)} is VALID [2022-04-08 06:09:23,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,099 INFO L272 TraceCheckUtils]: 83: Hoare triple {139458#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {139458#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {139458#(< ~counter~0 94)} is VALID [2022-04-08 06:09:23,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {139483#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139458#(< ~counter~0 94)} is VALID [2022-04-08 06:09:23,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {139483#(< ~counter~0 93)} assume !(~r~0 > 0); {139483#(< ~counter~0 93)} is VALID [2022-04-08 06:09:23,101 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138820#true} {139483#(< ~counter~0 93)} #96#return; {139483#(< ~counter~0 93)} is VALID [2022-04-08 06:09:23,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,101 INFO L272 TraceCheckUtils]: 75: Hoare triple {139483#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,101 INFO L290 TraceCheckUtils]: 74: Hoare triple {139483#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {139483#(< ~counter~0 93)} is VALID [2022-04-08 06:09:23,102 INFO L290 TraceCheckUtils]: 73: Hoare triple {139508#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139483#(< ~counter~0 93)} is VALID [2022-04-08 06:09:23,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {139508#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139508#(< ~counter~0 92)} is VALID [2022-04-08 06:09:23,103 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138820#true} {139508#(< ~counter~0 92)} #96#return; {139508#(< ~counter~0 92)} is VALID [2022-04-08 06:09:23,103 INFO L290 TraceCheckUtils]: 70: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,103 INFO L272 TraceCheckUtils]: 67: Hoare triple {139508#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {139508#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {139508#(< ~counter~0 92)} is VALID [2022-04-08 06:09:23,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {139533#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139508#(< ~counter~0 92)} is VALID [2022-04-08 06:09:23,105 INFO L290 TraceCheckUtils]: 64: Hoare triple {139533#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139533#(< ~counter~0 91)} is VALID [2022-04-08 06:09:23,105 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138820#true} {139533#(< ~counter~0 91)} #96#return; {139533#(< ~counter~0 91)} is VALID [2022-04-08 06:09:23,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,105 INFO L290 TraceCheckUtils]: 60: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,105 INFO L272 TraceCheckUtils]: 59: Hoare triple {139533#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {139533#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {139533#(< ~counter~0 91)} is VALID [2022-04-08 06:09:23,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {139558#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139533#(< ~counter~0 91)} is VALID [2022-04-08 06:09:23,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {139558#(< ~counter~0 90)} assume !!(0 != ~r~0); {139558#(< ~counter~0 90)} is VALID [2022-04-08 06:09:23,107 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138820#true} {139558#(< ~counter~0 90)} #94#return; {139558#(< ~counter~0 90)} is VALID [2022-04-08 06:09:23,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,107 INFO L272 TraceCheckUtils]: 51: Hoare triple {139558#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {139558#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {139558#(< ~counter~0 90)} is VALID [2022-04-08 06:09:23,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {139583#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139558#(< ~counter~0 90)} is VALID [2022-04-08 06:09:23,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {139583#(< ~counter~0 89)} assume !(~r~0 < 0); {139583#(< ~counter~0 89)} is VALID [2022-04-08 06:09:23,109 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138820#true} {139583#(< ~counter~0 89)} #98#return; {139583#(< ~counter~0 89)} is VALID [2022-04-08 06:09:23,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,109 INFO L272 TraceCheckUtils]: 43: Hoare triple {139583#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {139583#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {139583#(< ~counter~0 89)} is VALID [2022-04-08 06:09:23,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {139608#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139583#(< ~counter~0 89)} is VALID [2022-04-08 06:09:23,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {139608#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139608#(< ~counter~0 88)} is VALID [2022-04-08 06:09:23,111 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138820#true} {139608#(< ~counter~0 88)} #98#return; {139608#(< ~counter~0 88)} is VALID [2022-04-08 06:09:23,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,112 INFO L272 TraceCheckUtils]: 35: Hoare triple {139608#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {139608#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {139608#(< ~counter~0 88)} is VALID [2022-04-08 06:09:23,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {139633#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139608#(< ~counter~0 88)} is VALID [2022-04-08 06:09:23,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {139633#(< ~counter~0 87)} assume !(~r~0 > 0); {139633#(< ~counter~0 87)} is VALID [2022-04-08 06:09:23,113 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138820#true} {139633#(< ~counter~0 87)} #96#return; {139633#(< ~counter~0 87)} is VALID [2022-04-08 06:09:23,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,114 INFO L272 TraceCheckUtils]: 27: Hoare triple {139633#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {139633#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {139633#(< ~counter~0 87)} is VALID [2022-04-08 06:09:23,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {139658#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139633#(< ~counter~0 87)} is VALID [2022-04-08 06:09:23,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {139658#(< ~counter~0 86)} assume !!(0 != ~r~0); {139658#(< ~counter~0 86)} is VALID [2022-04-08 06:09:23,115 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138820#true} {139658#(< ~counter~0 86)} #94#return; {139658#(< ~counter~0 86)} is VALID [2022-04-08 06:09:23,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,116 INFO L272 TraceCheckUtils]: 19: Hoare triple {139658#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {139658#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {139658#(< ~counter~0 86)} is VALID [2022-04-08 06:09:23,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {139683#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139658#(< ~counter~0 86)} is VALID [2022-04-08 06:09:23,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {139683#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138820#true} {139683#(< ~counter~0 85)} #92#return; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L272 TraceCheckUtils]: 11: Hoare triple {139683#(< ~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)); {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138820#true} {139683#(< ~counter~0 85)} #90#return; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {139683#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138820#true} is VALID [2022-04-08 06:09:23,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {139683#(< ~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; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {139683#(< ~counter~0 85)} call #t~ret9 := main(); {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139683#(< ~counter~0 85)} {138820#true} #102#return; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {139683#(< ~counter~0 85)} assume true; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {138820#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {139683#(< ~counter~0 85)} is VALID [2022-04-08 06:09:23,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {138820#true} call ULTIMATE.init(); {138820#true} is VALID [2022-04-08 06:09:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 164 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-08 06:09:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:09:23,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924831019] [2022-04-08 06:09:23,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:09:23,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209106077] [2022-04-08 06:09:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209106077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:09:23,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:09:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-08 06:09:23,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:09:23,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576043356] [2022-04-08 06:09:23,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576043356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:09:23,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:09:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 06:09:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429242275] [2022-04-08 06:09:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:09:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-08 06:09:23,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:09:23,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:23,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:23,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 06:09:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:23,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 06:09:23,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 06:09:23,250 INFO L87 Difference]: Start difference. First operand 778 states and 1041 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:27,835 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-08 06:09:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 06:09:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 147 [2022-04-08 06:09:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:09:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 06:09:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-08 06:09:27,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-08 06:09:28,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:28,255 INFO L225 Difference]: With dead ends: 965 [2022-04-08 06:09:28,256 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 06:09:28,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1042, Invalid=1408, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 06:09:28,257 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 243 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:09:28,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 340 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:09:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 06:09:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-08 06:09:30,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:09:30,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:30,219 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:30,220 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:30,243 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 06:09:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:09:30,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:30,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:30,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 06:09:30,244 INFO L87 Difference]: Start difference. First operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 795 states. [2022-04-08 06:09:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:30,266 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-08 06:09:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:09:30,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:30,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:30,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:09:30,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:09:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 599 states have (on average 1.1819699499165275) internal successors, (708), 606 states have internal predecessors, (708), 176 states have call successors, (176), 21 states have call predecessors, (176), 19 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-08 06:09:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-08 06:09:30,305 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-08 06:09:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:09:30,305 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-08 06:09:30,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 18 states have call successors, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-08 06:09:30,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-08 06:09:39,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1058 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-08 06:09:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-08 06:09:39,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:09:39,518 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:09:39,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-08 06:09:39,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:09:39,735 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:09:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:09:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-08 06:09:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:39,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [246707459] [2022-04-08 06:09:39,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:09:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-08 06:09:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:09:39,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889556869] [2022-04-08 06:09:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:09:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:09:39,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:09:39,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400670181] [2022-04-08 06:09:39,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:09:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:09:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:09:39,753 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:09:39,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 06:09:39,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:09:39,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:09:39,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:09:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:09:39,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:09:40,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {144875#true} call ULTIMATE.init(); {144875#true} is VALID [2022-04-08 06:09:40,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {144875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144883#(<= ~counter~0 0)} {144875#true} #102#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {144883#(<= ~counter~0 0)} call #t~ret9 := main(); {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {144883#(<= ~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; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {144883#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {144883#(<= ~counter~0 0)} ~cond := #in~cond; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {144883#(<= ~counter~0 0)} assume !(0 == ~cond); {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144883#(<= ~counter~0 0)} {144883#(<= ~counter~0 0)} #90#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,482 INFO L272 TraceCheckUtils]: 11: Hoare triple {144883#(<= ~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)); {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {144883#(<= ~counter~0 0)} ~cond := #in~cond; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {144883#(<= ~counter~0 0)} assume !(0 == ~cond); {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,483 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144883#(<= ~counter~0 0)} {144883#(<= ~counter~0 0)} #92#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {144883#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {144883#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:40,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {144883#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {144932#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L272 TraceCheckUtils]: 19: Hoare triple {144932#(<= ~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)); {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {144932#(<= ~counter~0 1)} ~cond := #in~cond; {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {144932#(<= ~counter~0 1)} assume !(0 == ~cond); {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {144932#(<= ~counter~0 1)} assume true; {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144932#(<= ~counter~0 1)} {144932#(<= ~counter~0 1)} #94#return; {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {144932#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144932#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:40,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {144932#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {144957#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,489 INFO L272 TraceCheckUtils]: 27: Hoare triple {144957#(<= ~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)); {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {144957#(<= ~counter~0 2)} ~cond := #in~cond; {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,489 INFO L290 TraceCheckUtils]: 29: Hoare triple {144957#(<= ~counter~0 2)} assume !(0 == ~cond); {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {144957#(<= ~counter~0 2)} assume true; {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,490 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144957#(<= ~counter~0 2)} {144957#(<= ~counter~0 2)} #96#return; {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {144957#(<= ~counter~0 2)} assume !(~r~0 > 0); {144957#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:40,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {144957#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {144982#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,491 INFO L272 TraceCheckUtils]: 35: Hoare triple {144982#(<= ~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)); {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {144982#(<= ~counter~0 3)} ~cond := #in~cond; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {144982#(<= ~counter~0 3)} assume !(0 == ~cond); {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {144982#(<= ~counter~0 3)} assume true; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,492 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144982#(<= ~counter~0 3)} {144982#(<= ~counter~0 3)} #98#return; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {144982#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {144982#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:40,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {144982#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {145007#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,494 INFO L272 TraceCheckUtils]: 43: Hoare triple {145007#(<= ~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)); {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {145007#(<= ~counter~0 4)} ~cond := #in~cond; {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {145007#(<= ~counter~0 4)} assume !(0 == ~cond); {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {145007#(<= ~counter~0 4)} assume true; {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,495 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {145007#(<= ~counter~0 4)} {145007#(<= ~counter~0 4)} #98#return; {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {145007#(<= ~counter~0 4)} assume !(~r~0 < 0); {145007#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:40,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {145007#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {145032#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,496 INFO L272 TraceCheckUtils]: 51: Hoare triple {145032#(<= ~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)); {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,496 INFO L290 TraceCheckUtils]: 52: Hoare triple {145032#(<= ~counter~0 5)} ~cond := #in~cond; {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {145032#(<= ~counter~0 5)} assume !(0 == ~cond); {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {145032#(<= ~counter~0 5)} assume true; {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,497 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {145032#(<= ~counter~0 5)} {145032#(<= ~counter~0 5)} #94#return; {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {145032#(<= ~counter~0 5)} assume !!(0 != ~r~0); {145032#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:40,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {145032#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {145057#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,499 INFO L272 TraceCheckUtils]: 59: Hoare triple {145057#(<= ~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)); {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {145057#(<= ~counter~0 6)} ~cond := #in~cond; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,499 INFO L290 TraceCheckUtils]: 61: Hoare triple {145057#(<= ~counter~0 6)} assume !(0 == ~cond); {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,499 INFO L290 TraceCheckUtils]: 62: Hoare triple {145057#(<= ~counter~0 6)} assume true; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,499 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {145057#(<= ~counter~0 6)} {145057#(<= ~counter~0 6)} #96#return; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {145057#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145057#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:40,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {145057#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {145082#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,501 INFO L272 TraceCheckUtils]: 67: Hoare triple {145082#(<= ~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)); {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {145082#(<= ~counter~0 7)} ~cond := #in~cond; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {145082#(<= ~counter~0 7)} assume !(0 == ~cond); {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {145082#(<= ~counter~0 7)} assume true; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,502 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {145082#(<= ~counter~0 7)} {145082#(<= ~counter~0 7)} #96#return; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {145082#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145082#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:40,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {145082#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {145107#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L272 TraceCheckUtils]: 75: Hoare triple {145107#(<= ~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)); {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {145107#(<= ~counter~0 8)} ~cond := #in~cond; {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {145107#(<= ~counter~0 8)} assume !(0 == ~cond); {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {145107#(<= ~counter~0 8)} assume true; {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {145107#(<= ~counter~0 8)} {145107#(<= ~counter~0 8)} #96#return; {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,504 INFO L290 TraceCheckUtils]: 80: Hoare triple {145107#(<= ~counter~0 8)} assume !(~r~0 > 0); {145107#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:40,506 INFO L290 TraceCheckUtils]: 81: Hoare triple {145107#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {145132#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,506 INFO L272 TraceCheckUtils]: 83: Hoare triple {145132#(<= ~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)); {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {145132#(<= ~counter~0 9)} ~cond := #in~cond; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,506 INFO L290 TraceCheckUtils]: 85: Hoare triple {145132#(<= ~counter~0 9)} assume !(0 == ~cond); {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,507 INFO L290 TraceCheckUtils]: 86: Hoare triple {145132#(<= ~counter~0 9)} assume true; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,507 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {145132#(<= ~counter~0 9)} {145132#(<= ~counter~0 9)} #98#return; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,507 INFO L290 TraceCheckUtils]: 88: Hoare triple {145132#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145132#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:40,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {145132#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {145157#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,508 INFO L272 TraceCheckUtils]: 91: Hoare triple {145157#(<= ~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)); {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {145157#(<= ~counter~0 10)} ~cond := #in~cond; {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {145157#(<= ~counter~0 10)} assume !(0 == ~cond); {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,509 INFO L290 TraceCheckUtils]: 94: Hoare triple {145157#(<= ~counter~0 10)} assume true; {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,509 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {145157#(<= ~counter~0 10)} {145157#(<= ~counter~0 10)} #98#return; {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,509 INFO L290 TraceCheckUtils]: 96: Hoare triple {145157#(<= ~counter~0 10)} assume !(~r~0 < 0); {145157#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:40,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {145157#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {145182#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,511 INFO L272 TraceCheckUtils]: 99: Hoare triple {145182#(<= ~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)); {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {145182#(<= ~counter~0 11)} ~cond := #in~cond; {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {145182#(<= ~counter~0 11)} assume !(0 == ~cond); {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {145182#(<= ~counter~0 11)} assume true; {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,512 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {145182#(<= ~counter~0 11)} {145182#(<= ~counter~0 11)} #94#return; {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,512 INFO L290 TraceCheckUtils]: 104: Hoare triple {145182#(<= ~counter~0 11)} assume !!(0 != ~r~0); {145182#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:40,513 INFO L290 TraceCheckUtils]: 105: Hoare triple {145182#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,513 INFO L290 TraceCheckUtils]: 106: Hoare triple {145207#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,513 INFO L272 TraceCheckUtils]: 107: Hoare triple {145207#(<= ~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)); {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,513 INFO L290 TraceCheckUtils]: 108: Hoare triple {145207#(<= ~counter~0 12)} ~cond := #in~cond; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,514 INFO L290 TraceCheckUtils]: 109: Hoare triple {145207#(<= ~counter~0 12)} assume !(0 == ~cond); {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,514 INFO L290 TraceCheckUtils]: 110: Hoare triple {145207#(<= ~counter~0 12)} assume true; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,514 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {145207#(<= ~counter~0 12)} {145207#(<= ~counter~0 12)} #96#return; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,514 INFO L290 TraceCheckUtils]: 112: Hoare triple {145207#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145207#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:40,515 INFO L290 TraceCheckUtils]: 113: Hoare triple {145207#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,515 INFO L290 TraceCheckUtils]: 114: Hoare triple {145232#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,516 INFO L272 TraceCheckUtils]: 115: Hoare triple {145232#(<= ~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)); {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,516 INFO L290 TraceCheckUtils]: 116: Hoare triple {145232#(<= ~counter~0 13)} ~cond := #in~cond; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,516 INFO L290 TraceCheckUtils]: 117: Hoare triple {145232#(<= ~counter~0 13)} assume !(0 == ~cond); {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,516 INFO L290 TraceCheckUtils]: 118: Hoare triple {145232#(<= ~counter~0 13)} assume true; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,516 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {145232#(<= ~counter~0 13)} {145232#(<= ~counter~0 13)} #96#return; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,517 INFO L290 TraceCheckUtils]: 120: Hoare triple {145232#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145232#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:40,518 INFO L290 TraceCheckUtils]: 121: Hoare triple {145232#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,518 INFO L290 TraceCheckUtils]: 122: Hoare triple {145257#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,518 INFO L272 TraceCheckUtils]: 123: Hoare triple {145257#(<= ~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)); {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,518 INFO L290 TraceCheckUtils]: 124: Hoare triple {145257#(<= ~counter~0 14)} ~cond := #in~cond; {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {145257#(<= ~counter~0 14)} assume !(0 == ~cond); {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,519 INFO L290 TraceCheckUtils]: 126: Hoare triple {145257#(<= ~counter~0 14)} assume true; {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,519 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {145257#(<= ~counter~0 14)} {145257#(<= ~counter~0 14)} #96#return; {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,519 INFO L290 TraceCheckUtils]: 128: Hoare triple {145257#(<= ~counter~0 14)} assume !(~r~0 > 0); {145257#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:40,520 INFO L290 TraceCheckUtils]: 129: Hoare triple {145257#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,520 INFO L290 TraceCheckUtils]: 130: Hoare triple {145282#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,521 INFO L272 TraceCheckUtils]: 131: Hoare triple {145282#(<= ~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)); {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,521 INFO L290 TraceCheckUtils]: 132: Hoare triple {145282#(<= ~counter~0 15)} ~cond := #in~cond; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,521 INFO L290 TraceCheckUtils]: 133: Hoare triple {145282#(<= ~counter~0 15)} assume !(0 == ~cond); {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,521 INFO L290 TraceCheckUtils]: 134: Hoare triple {145282#(<= ~counter~0 15)} assume true; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,521 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {145282#(<= ~counter~0 15)} {145282#(<= ~counter~0 15)} #98#return; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,522 INFO L290 TraceCheckUtils]: 136: Hoare triple {145282#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145282#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:40,523 INFO L290 TraceCheckUtils]: 137: Hoare triple {145282#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,523 INFO L290 TraceCheckUtils]: 138: Hoare triple {145307#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,523 INFO L272 TraceCheckUtils]: 139: Hoare triple {145307#(<= ~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)); {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,523 INFO L290 TraceCheckUtils]: 140: Hoare triple {145307#(<= ~counter~0 16)} ~cond := #in~cond; {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,523 INFO L290 TraceCheckUtils]: 141: Hoare triple {145307#(<= ~counter~0 16)} assume !(0 == ~cond); {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,524 INFO L290 TraceCheckUtils]: 142: Hoare triple {145307#(<= ~counter~0 16)} assume true; {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,524 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {145307#(<= ~counter~0 16)} {145307#(<= ~counter~0 16)} #98#return; {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,524 INFO L290 TraceCheckUtils]: 144: Hoare triple {145307#(<= ~counter~0 16)} assume !(~r~0 < 0); {145307#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:40,524 INFO L290 TraceCheckUtils]: 145: Hoare triple {145307#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145332#(<= |main_#t~post6| 16)} is VALID [2022-04-08 06:09:40,525 INFO L290 TraceCheckUtils]: 146: Hoare triple {145332#(<= |main_#t~post6| 16)} assume !(#t~post6 < 100);havoc #t~post6; {144876#false} is VALID [2022-04-08 06:09:40,525 INFO L272 TraceCheckUtils]: 147: Hoare triple {144876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144876#false} is VALID [2022-04-08 06:09:40,525 INFO L290 TraceCheckUtils]: 148: Hoare triple {144876#false} ~cond := #in~cond; {144876#false} is VALID [2022-04-08 06:09:40,525 INFO L290 TraceCheckUtils]: 149: Hoare triple {144876#false} assume 0 == ~cond; {144876#false} is VALID [2022-04-08 06:09:40,525 INFO L290 TraceCheckUtils]: 150: Hoare triple {144876#false} assume !false; {144876#false} is VALID [2022-04-08 06:09:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 642 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:09:40,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:09:41,493 INFO L290 TraceCheckUtils]: 150: Hoare triple {144876#false} assume !false; {144876#false} is VALID [2022-04-08 06:09:41,494 INFO L290 TraceCheckUtils]: 149: Hoare triple {144876#false} assume 0 == ~cond; {144876#false} is VALID [2022-04-08 06:09:41,494 INFO L290 TraceCheckUtils]: 148: Hoare triple {144876#false} ~cond := #in~cond; {144876#false} is VALID [2022-04-08 06:09:41,494 INFO L272 TraceCheckUtils]: 147: Hoare triple {144876#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {144876#false} is VALID [2022-04-08 06:09:41,494 INFO L290 TraceCheckUtils]: 146: Hoare triple {145360#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {144876#false} is VALID [2022-04-08 06:09:41,494 INFO L290 TraceCheckUtils]: 145: Hoare triple {145364#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145360#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:09:41,495 INFO L290 TraceCheckUtils]: 144: Hoare triple {145364#(< ~counter~0 100)} assume !(~r~0 < 0); {145364#(< ~counter~0 100)} is VALID [2022-04-08 06:09:41,495 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144875#true} {145364#(< ~counter~0 100)} #98#return; {145364#(< ~counter~0 100)} is VALID [2022-04-08 06:09:41,495 INFO L290 TraceCheckUtils]: 142: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,495 INFO L290 TraceCheckUtils]: 141: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,495 INFO L290 TraceCheckUtils]: 140: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,495 INFO L272 TraceCheckUtils]: 139: Hoare triple {145364#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,496 INFO L290 TraceCheckUtils]: 138: Hoare triple {145364#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {145364#(< ~counter~0 100)} is VALID [2022-04-08 06:09:41,498 INFO L290 TraceCheckUtils]: 137: Hoare triple {145389#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145364#(< ~counter~0 100)} is VALID [2022-04-08 06:09:41,499 INFO L290 TraceCheckUtils]: 136: Hoare triple {145389#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145389#(< ~counter~0 99)} is VALID [2022-04-08 06:09:41,499 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144875#true} {145389#(< ~counter~0 99)} #98#return; {145389#(< ~counter~0 99)} is VALID [2022-04-08 06:09:41,499 INFO L290 TraceCheckUtils]: 134: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,499 INFO L290 TraceCheckUtils]: 133: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,499 INFO L290 TraceCheckUtils]: 132: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,499 INFO L272 TraceCheckUtils]: 131: Hoare triple {145389#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,499 INFO L290 TraceCheckUtils]: 130: Hoare triple {145389#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {145389#(< ~counter~0 99)} is VALID [2022-04-08 06:09:41,501 INFO L290 TraceCheckUtils]: 129: Hoare triple {145414#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145389#(< ~counter~0 99)} is VALID [2022-04-08 06:09:41,501 INFO L290 TraceCheckUtils]: 128: Hoare triple {145414#(< ~counter~0 98)} assume !(~r~0 > 0); {145414#(< ~counter~0 98)} is VALID [2022-04-08 06:09:41,501 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144875#true} {145414#(< ~counter~0 98)} #96#return; {145414#(< ~counter~0 98)} is VALID [2022-04-08 06:09:41,501 INFO L290 TraceCheckUtils]: 126: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,501 INFO L290 TraceCheckUtils]: 125: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,502 INFO L290 TraceCheckUtils]: 124: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,502 INFO L272 TraceCheckUtils]: 123: Hoare triple {145414#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,502 INFO L290 TraceCheckUtils]: 122: Hoare triple {145414#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {145414#(< ~counter~0 98)} is VALID [2022-04-08 06:09:41,503 INFO L290 TraceCheckUtils]: 121: Hoare triple {145439#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145414#(< ~counter~0 98)} is VALID [2022-04-08 06:09:41,503 INFO L290 TraceCheckUtils]: 120: Hoare triple {145439#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145439#(< ~counter~0 97)} is VALID [2022-04-08 06:09:41,504 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144875#true} {145439#(< ~counter~0 97)} #96#return; {145439#(< ~counter~0 97)} is VALID [2022-04-08 06:09:41,504 INFO L290 TraceCheckUtils]: 118: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,504 INFO L290 TraceCheckUtils]: 117: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,504 INFO L272 TraceCheckUtils]: 115: Hoare triple {145439#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,504 INFO L290 TraceCheckUtils]: 114: Hoare triple {145439#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {145439#(< ~counter~0 97)} is VALID [2022-04-08 06:09:41,505 INFO L290 TraceCheckUtils]: 113: Hoare triple {145464#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145439#(< ~counter~0 97)} is VALID [2022-04-08 06:09:41,506 INFO L290 TraceCheckUtils]: 112: Hoare triple {145464#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145464#(< ~counter~0 96)} is VALID [2022-04-08 06:09:41,506 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144875#true} {145464#(< ~counter~0 96)} #96#return; {145464#(< ~counter~0 96)} is VALID [2022-04-08 06:09:41,506 INFO L290 TraceCheckUtils]: 110: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,506 INFO L290 TraceCheckUtils]: 109: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,506 INFO L290 TraceCheckUtils]: 108: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,506 INFO L272 TraceCheckUtils]: 107: Hoare triple {145464#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,507 INFO L290 TraceCheckUtils]: 106: Hoare triple {145464#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {145464#(< ~counter~0 96)} is VALID [2022-04-08 06:09:41,508 INFO L290 TraceCheckUtils]: 105: Hoare triple {145489#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145464#(< ~counter~0 96)} is VALID [2022-04-08 06:09:41,508 INFO L290 TraceCheckUtils]: 104: Hoare triple {145489#(< ~counter~0 95)} assume !!(0 != ~r~0); {145489#(< ~counter~0 95)} is VALID [2022-04-08 06:09:41,508 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144875#true} {145489#(< ~counter~0 95)} #94#return; {145489#(< ~counter~0 95)} is VALID [2022-04-08 06:09:41,508 INFO L290 TraceCheckUtils]: 102: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,509 INFO L272 TraceCheckUtils]: 99: Hoare triple {145489#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {145489#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {145489#(< ~counter~0 95)} is VALID [2022-04-08 06:09:41,510 INFO L290 TraceCheckUtils]: 97: Hoare triple {145514#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145489#(< ~counter~0 95)} is VALID [2022-04-08 06:09:41,510 INFO L290 TraceCheckUtils]: 96: Hoare triple {145514#(< ~counter~0 94)} assume !(~r~0 < 0); {145514#(< ~counter~0 94)} is VALID [2022-04-08 06:09:41,511 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144875#true} {145514#(< ~counter~0 94)} #98#return; {145514#(< ~counter~0 94)} is VALID [2022-04-08 06:09:41,511 INFO L290 TraceCheckUtils]: 94: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,511 INFO L290 TraceCheckUtils]: 93: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,511 INFO L290 TraceCheckUtils]: 92: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,511 INFO L272 TraceCheckUtils]: 91: Hoare triple {145514#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,511 INFO L290 TraceCheckUtils]: 90: Hoare triple {145514#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {145514#(< ~counter~0 94)} is VALID [2022-04-08 06:09:41,512 INFO L290 TraceCheckUtils]: 89: Hoare triple {145539#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145514#(< ~counter~0 94)} is VALID [2022-04-08 06:09:41,513 INFO L290 TraceCheckUtils]: 88: Hoare triple {145539#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145539#(< ~counter~0 93)} is VALID [2022-04-08 06:09:41,513 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144875#true} {145539#(< ~counter~0 93)} #98#return; {145539#(< ~counter~0 93)} is VALID [2022-04-08 06:09:41,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,513 INFO L290 TraceCheckUtils]: 85: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,513 INFO L290 TraceCheckUtils]: 84: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,513 INFO L272 TraceCheckUtils]: 83: Hoare triple {145539#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,514 INFO L290 TraceCheckUtils]: 82: Hoare triple {145539#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {145539#(< ~counter~0 93)} is VALID [2022-04-08 06:09:41,515 INFO L290 TraceCheckUtils]: 81: Hoare triple {145564#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145539#(< ~counter~0 93)} is VALID [2022-04-08 06:09:41,515 INFO L290 TraceCheckUtils]: 80: Hoare triple {145564#(< ~counter~0 92)} assume !(~r~0 > 0); {145564#(< ~counter~0 92)} is VALID [2022-04-08 06:09:41,515 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144875#true} {145564#(< ~counter~0 92)} #96#return; {145564#(< ~counter~0 92)} is VALID [2022-04-08 06:09:41,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,516 INFO L272 TraceCheckUtils]: 75: Hoare triple {145564#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {145564#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {145564#(< ~counter~0 92)} is VALID [2022-04-08 06:09:41,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {145589#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145564#(< ~counter~0 92)} is VALID [2022-04-08 06:09:41,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {145589#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145589#(< ~counter~0 91)} is VALID [2022-04-08 06:09:41,518 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144875#true} {145589#(< ~counter~0 91)} #96#return; {145589#(< ~counter~0 91)} is VALID [2022-04-08 06:09:41,518 INFO L290 TraceCheckUtils]: 70: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,518 INFO L290 TraceCheckUtils]: 69: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,518 INFO L290 TraceCheckUtils]: 68: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,518 INFO L272 TraceCheckUtils]: 67: Hoare triple {145589#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {145589#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {145589#(< ~counter~0 91)} is VALID [2022-04-08 06:09:41,519 INFO L290 TraceCheckUtils]: 65: Hoare triple {145614#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145589#(< ~counter~0 91)} is VALID [2022-04-08 06:09:41,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {145614#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145614#(< ~counter~0 90)} is VALID [2022-04-08 06:09:41,520 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144875#true} {145614#(< ~counter~0 90)} #96#return; {145614#(< ~counter~0 90)} is VALID [2022-04-08 06:09:41,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,520 INFO L272 TraceCheckUtils]: 59: Hoare triple {145614#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {145614#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {145614#(< ~counter~0 90)} is VALID [2022-04-08 06:09:41,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {145639#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145614#(< ~counter~0 90)} is VALID [2022-04-08 06:09:41,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {145639#(< ~counter~0 89)} assume !!(0 != ~r~0); {145639#(< ~counter~0 89)} is VALID [2022-04-08 06:09:41,522 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144875#true} {145639#(< ~counter~0 89)} #94#return; {145639#(< ~counter~0 89)} is VALID [2022-04-08 06:09:41,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,523 INFO L272 TraceCheckUtils]: 51: Hoare triple {145639#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {145639#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {145639#(< ~counter~0 89)} is VALID [2022-04-08 06:09:41,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {145664#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145639#(< ~counter~0 89)} is VALID [2022-04-08 06:09:41,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {145664#(< ~counter~0 88)} assume !(~r~0 < 0); {145664#(< ~counter~0 88)} is VALID [2022-04-08 06:09:41,525 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144875#true} {145664#(< ~counter~0 88)} #98#return; {145664#(< ~counter~0 88)} is VALID [2022-04-08 06:09:41,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,525 INFO L272 TraceCheckUtils]: 43: Hoare triple {145664#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {145664#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {145664#(< ~counter~0 88)} is VALID [2022-04-08 06:09:41,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {145689#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145664#(< ~counter~0 88)} is VALID [2022-04-08 06:09:41,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {145689#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145689#(< ~counter~0 87)} is VALID [2022-04-08 06:09:41,527 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144875#true} {145689#(< ~counter~0 87)} #98#return; {145689#(< ~counter~0 87)} is VALID [2022-04-08 06:09:41,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,527 INFO L272 TraceCheckUtils]: 35: Hoare triple {145689#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {145689#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {145689#(< ~counter~0 87)} is VALID [2022-04-08 06:09:41,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {145714#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145689#(< ~counter~0 87)} is VALID [2022-04-08 06:09:41,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {145714#(< ~counter~0 86)} assume !(~r~0 > 0); {145714#(< ~counter~0 86)} is VALID [2022-04-08 06:09:41,529 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144875#true} {145714#(< ~counter~0 86)} #96#return; {145714#(< ~counter~0 86)} is VALID [2022-04-08 06:09:41,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,530 INFO L272 TraceCheckUtils]: 27: Hoare triple {145714#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {145714#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {145714#(< ~counter~0 86)} is VALID [2022-04-08 06:09:41,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {145739#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145714#(< ~counter~0 86)} is VALID [2022-04-08 06:09:41,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {145739#(< ~counter~0 85)} assume !!(0 != ~r~0); {145739#(< ~counter~0 85)} is VALID [2022-04-08 06:09:41,532 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144875#true} {145739#(< ~counter~0 85)} #94#return; {145739#(< ~counter~0 85)} is VALID [2022-04-08 06:09:41,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,532 INFO L272 TraceCheckUtils]: 19: Hoare triple {145739#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {145739#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {145739#(< ~counter~0 85)} is VALID [2022-04-08 06:09:41,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {145764#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145739#(< ~counter~0 85)} is VALID [2022-04-08 06:09:41,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {145764#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,534 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144875#true} {145764#(< ~counter~0 84)} #92#return; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,534 INFO L272 TraceCheckUtils]: 11: Hoare triple {145764#(< ~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)); {144875#true} is VALID [2022-04-08 06:09:41,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144875#true} {145764#(< ~counter~0 84)} #90#return; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-08 06:09:41,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-08 06:09:41,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-08 06:09:41,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {145764#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144875#true} is VALID [2022-04-08 06:09:41,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {145764#(< ~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; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {145764#(< ~counter~0 84)} call #t~ret9 := main(); {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145764#(< ~counter~0 84)} {144875#true} #102#return; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {145764#(< ~counter~0 84)} assume true; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {144875#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {145764#(< ~counter~0 84)} is VALID [2022-04-08 06:09:41,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {144875#true} call ULTIMATE.init(); {144875#true} is VALID [2022-04-08 06:09:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 162 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 06:09:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:09:41,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889556869] [2022-04-08 06:09:41,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:09:41,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400670181] [2022-04-08 06:09:41,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400670181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:09:41,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:09:41,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:09:41,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:09:41,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [246707459] [2022-04-08 06:09:41,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [246707459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:09:41,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:09:41,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:09:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906985660] [2022-04-08 06:09:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:09:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-08 06:09:41,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:09:41,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:41,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:41,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:09:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:41,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:09:41,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:09:41,683 INFO L87 Difference]: Start difference. First operand 795 states and 1058 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:45,827 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-08 06:09:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 06:09:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 151 [2022-04-08 06:09:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:09:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 06:09:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-08 06:09:45,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-08 06:09:46,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:46,142 INFO L225 Difference]: With dead ends: 846 [2022-04-08 06:09:46,142 INFO L226 Difference]: Without dead ends: 841 [2022-04-08 06:09:46,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1080, Invalid=1470, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 06:09:46,143 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 289 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:09:46,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 346 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 06:09:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-08 06:09:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-08 06:09:48,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:09:48,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:09:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:09:48,011 INFO L87 Difference]: Start difference. First operand 841 states. Second operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:09:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:48,036 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 06:09:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 06:09:48,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:48,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:48,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 06:09:48,039 INFO L87 Difference]: Start difference. First operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 841 states. [2022-04-08 06:09:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:09:48,079 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-08 06:09:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-08 06:09:48,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:09:48,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:09:48,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:09:48,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:09:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 609 states have (on average 1.1822660098522169) internal successors, (720), 626 states have internal predecessors, (720), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:09:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-08 06:09:48,117 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-08 06:09:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:09:48,117 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-08 06:09:48,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:48,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-08 06:09:55,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1095 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-08 06:09:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 06:09:55,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:09:55,378 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:09:55,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 06:09:55,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-08 06:09:55,578 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:09:55,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:09:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-08 06:09:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:55,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073639599] [2022-04-08 06:09:55,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:09:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-08 06:09:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:09:55,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384410871] [2022-04-08 06:09:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:09:55,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:09:55,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:09:55,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413741289] [2022-04-08 06:09:55,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:09:55,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:09:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:09:55,594 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:09:55,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 06:09:55,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:09:55,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:09:55,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:09:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:09:55,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:09:56,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {150856#true} call ULTIMATE.init(); {150856#true} is VALID [2022-04-08 06:09:56,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {150856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150864#(<= ~counter~0 0)} {150856#true} #102#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {150864#(<= ~counter~0 0)} call #t~ret9 := main(); {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {150864#(<= ~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; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {150864#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {150864#(<= ~counter~0 0)} ~cond := #in~cond; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {150864#(<= ~counter~0 0)} assume !(0 == ~cond); {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150864#(<= ~counter~0 0)} {150864#(<= ~counter~0 0)} #90#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,538 INFO L272 TraceCheckUtils]: 11: Hoare triple {150864#(<= ~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)); {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {150864#(<= ~counter~0 0)} ~cond := #in~cond; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {150864#(<= ~counter~0 0)} assume !(0 == ~cond); {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150864#(<= ~counter~0 0)} {150864#(<= ~counter~0 0)} #92#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {150864#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {150864#(<= ~counter~0 0)} is VALID [2022-04-08 06:09:56,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {150864#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {150913#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,543 INFO L272 TraceCheckUtils]: 19: Hoare triple {150913#(<= ~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)); {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {150913#(<= ~counter~0 1)} ~cond := #in~cond; {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {150913#(<= ~counter~0 1)} assume !(0 == ~cond); {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {150913#(<= ~counter~0 1)} assume true; {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150913#(<= ~counter~0 1)} {150913#(<= ~counter~0 1)} #94#return; {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {150913#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150913#(<= ~counter~0 1)} is VALID [2022-04-08 06:09:56,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {150913#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {150938#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,547 INFO L272 TraceCheckUtils]: 27: Hoare triple {150938#(<= ~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)); {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {150938#(<= ~counter~0 2)} ~cond := #in~cond; {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {150938#(<= ~counter~0 2)} assume !(0 == ~cond); {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {150938#(<= ~counter~0 2)} assume true; {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,549 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150938#(<= ~counter~0 2)} {150938#(<= ~counter~0 2)} #96#return; {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {150938#(<= ~counter~0 2)} assume !(~r~0 > 0); {150938#(<= ~counter~0 2)} is VALID [2022-04-08 06:09:56,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {150938#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {150963#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,551 INFO L272 TraceCheckUtils]: 35: Hoare triple {150963#(<= ~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)); {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {150963#(<= ~counter~0 3)} ~cond := #in~cond; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {150963#(<= ~counter~0 3)} assume !(0 == ~cond); {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {150963#(<= ~counter~0 3)} assume true; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,552 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150963#(<= ~counter~0 3)} {150963#(<= ~counter~0 3)} #98#return; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {150963#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {150963#(<= ~counter~0 3)} is VALID [2022-04-08 06:09:56,554 INFO L290 TraceCheckUtils]: 41: Hoare triple {150963#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {150988#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,555 INFO L272 TraceCheckUtils]: 43: Hoare triple {150988#(<= ~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)); {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {150988#(<= ~counter~0 4)} ~cond := #in~cond; {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {150988#(<= ~counter~0 4)} assume !(0 == ~cond); {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {150988#(<= ~counter~0 4)} assume true; {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,556 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150988#(<= ~counter~0 4)} {150988#(<= ~counter~0 4)} #98#return; {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {150988#(<= ~counter~0 4)} assume !(~r~0 < 0); {150988#(<= ~counter~0 4)} is VALID [2022-04-08 06:09:56,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {150988#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {151013#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,559 INFO L272 TraceCheckUtils]: 51: Hoare triple {151013#(<= ~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)); {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {151013#(<= ~counter~0 5)} ~cond := #in~cond; {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {151013#(<= ~counter~0 5)} assume !(0 == ~cond); {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {151013#(<= ~counter~0 5)} assume true; {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,560 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {151013#(<= ~counter~0 5)} {151013#(<= ~counter~0 5)} #94#return; {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {151013#(<= ~counter~0 5)} assume !!(0 != ~r~0); {151013#(<= ~counter~0 5)} is VALID [2022-04-08 06:09:56,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {151013#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {151038#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,563 INFO L272 TraceCheckUtils]: 59: Hoare triple {151038#(<= ~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)); {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {151038#(<= ~counter~0 6)} ~cond := #in~cond; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {151038#(<= ~counter~0 6)} assume !(0 == ~cond); {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {151038#(<= ~counter~0 6)} assume true; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,564 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {151038#(<= ~counter~0 6)} {151038#(<= ~counter~0 6)} #96#return; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {151038#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151038#(<= ~counter~0 6)} is VALID [2022-04-08 06:09:56,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {151038#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {151063#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,566 INFO L272 TraceCheckUtils]: 67: Hoare triple {151063#(<= ~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)); {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,567 INFO L290 TraceCheckUtils]: 68: Hoare triple {151063#(<= ~counter~0 7)} ~cond := #in~cond; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,567 INFO L290 TraceCheckUtils]: 69: Hoare triple {151063#(<= ~counter~0 7)} assume !(0 == ~cond); {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,567 INFO L290 TraceCheckUtils]: 70: Hoare triple {151063#(<= ~counter~0 7)} assume true; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,568 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {151063#(<= ~counter~0 7)} {151063#(<= ~counter~0 7)} #96#return; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {151063#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151063#(<= ~counter~0 7)} is VALID [2022-04-08 06:09:56,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {151063#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {151088#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,570 INFO L272 TraceCheckUtils]: 75: Hoare triple {151088#(<= ~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)); {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {151088#(<= ~counter~0 8)} ~cond := #in~cond; {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {151088#(<= ~counter~0 8)} assume !(0 == ~cond); {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {151088#(<= ~counter~0 8)} assume true; {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,571 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {151088#(<= ~counter~0 8)} {151088#(<= ~counter~0 8)} #96#return; {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {151088#(<= ~counter~0 8)} assume !(~r~0 > 0); {151088#(<= ~counter~0 8)} is VALID [2022-04-08 06:09:56,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {151088#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {151113#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,574 INFO L272 TraceCheckUtils]: 83: Hoare triple {151113#(<= ~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)); {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {151113#(<= ~counter~0 9)} ~cond := #in~cond; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {151113#(<= ~counter~0 9)} assume !(0 == ~cond); {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {151113#(<= ~counter~0 9)} assume true; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,575 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {151113#(<= ~counter~0 9)} {151113#(<= ~counter~0 9)} #98#return; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {151113#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151113#(<= ~counter~0 9)} is VALID [2022-04-08 06:09:56,577 INFO L290 TraceCheckUtils]: 89: Hoare triple {151113#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {151138#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,578 INFO L272 TraceCheckUtils]: 91: Hoare triple {151138#(<= ~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)); {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {151138#(<= ~counter~0 10)} ~cond := #in~cond; {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {151138#(<= ~counter~0 10)} assume !(0 == ~cond); {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,579 INFO L290 TraceCheckUtils]: 94: Hoare triple {151138#(<= ~counter~0 10)} assume true; {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,579 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {151138#(<= ~counter~0 10)} {151138#(<= ~counter~0 10)} #98#return; {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {151138#(<= ~counter~0 10)} assume !(~r~0 < 0); {151138#(<= ~counter~0 10)} is VALID [2022-04-08 06:09:56,581 INFO L290 TraceCheckUtils]: 97: Hoare triple {151138#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,581 INFO L290 TraceCheckUtils]: 98: Hoare triple {151163#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,582 INFO L272 TraceCheckUtils]: 99: Hoare triple {151163#(<= ~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)); {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {151163#(<= ~counter~0 11)} ~cond := #in~cond; {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,582 INFO L290 TraceCheckUtils]: 101: Hoare triple {151163#(<= ~counter~0 11)} assume !(0 == ~cond); {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {151163#(<= ~counter~0 11)} assume true; {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,583 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {151163#(<= ~counter~0 11)} {151163#(<= ~counter~0 11)} #94#return; {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,583 INFO L290 TraceCheckUtils]: 104: Hoare triple {151163#(<= ~counter~0 11)} assume !!(0 != ~r~0); {151163#(<= ~counter~0 11)} is VALID [2022-04-08 06:09:56,585 INFO L290 TraceCheckUtils]: 105: Hoare triple {151163#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,585 INFO L290 TraceCheckUtils]: 106: Hoare triple {151188#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,585 INFO L272 TraceCheckUtils]: 107: Hoare triple {151188#(<= ~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)); {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,586 INFO L290 TraceCheckUtils]: 108: Hoare triple {151188#(<= ~counter~0 12)} ~cond := #in~cond; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,586 INFO L290 TraceCheckUtils]: 109: Hoare triple {151188#(<= ~counter~0 12)} assume !(0 == ~cond); {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,586 INFO L290 TraceCheckUtils]: 110: Hoare triple {151188#(<= ~counter~0 12)} assume true; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,587 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {151188#(<= ~counter~0 12)} {151188#(<= ~counter~0 12)} #96#return; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,587 INFO L290 TraceCheckUtils]: 112: Hoare triple {151188#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151188#(<= ~counter~0 12)} is VALID [2022-04-08 06:09:56,588 INFO L290 TraceCheckUtils]: 113: Hoare triple {151188#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,589 INFO L290 TraceCheckUtils]: 114: Hoare triple {151213#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,589 INFO L272 TraceCheckUtils]: 115: Hoare triple {151213#(<= ~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)); {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,589 INFO L290 TraceCheckUtils]: 116: Hoare triple {151213#(<= ~counter~0 13)} ~cond := #in~cond; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,590 INFO L290 TraceCheckUtils]: 117: Hoare triple {151213#(<= ~counter~0 13)} assume !(0 == ~cond); {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,590 INFO L290 TraceCheckUtils]: 118: Hoare triple {151213#(<= ~counter~0 13)} assume true; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,590 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {151213#(<= ~counter~0 13)} {151213#(<= ~counter~0 13)} #96#return; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,591 INFO L290 TraceCheckUtils]: 120: Hoare triple {151213#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151213#(<= ~counter~0 13)} is VALID [2022-04-08 06:09:56,592 INFO L290 TraceCheckUtils]: 121: Hoare triple {151213#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,592 INFO L290 TraceCheckUtils]: 122: Hoare triple {151238#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,593 INFO L272 TraceCheckUtils]: 123: Hoare triple {151238#(<= ~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)); {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {151238#(<= ~counter~0 14)} ~cond := #in~cond; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,593 INFO L290 TraceCheckUtils]: 125: Hoare triple {151238#(<= ~counter~0 14)} assume !(0 == ~cond); {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,594 INFO L290 TraceCheckUtils]: 126: Hoare triple {151238#(<= ~counter~0 14)} assume true; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,594 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {151238#(<= ~counter~0 14)} {151238#(<= ~counter~0 14)} #96#return; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {151238#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151238#(<= ~counter~0 14)} is VALID [2022-04-08 06:09:56,596 INFO L290 TraceCheckUtils]: 129: Hoare triple {151238#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,596 INFO L290 TraceCheckUtils]: 130: Hoare triple {151263#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,597 INFO L272 TraceCheckUtils]: 131: Hoare triple {151263#(<= ~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)); {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,597 INFO L290 TraceCheckUtils]: 132: Hoare triple {151263#(<= ~counter~0 15)} ~cond := #in~cond; {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,597 INFO L290 TraceCheckUtils]: 133: Hoare triple {151263#(<= ~counter~0 15)} assume !(0 == ~cond); {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,598 INFO L290 TraceCheckUtils]: 134: Hoare triple {151263#(<= ~counter~0 15)} assume true; {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,598 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {151263#(<= ~counter~0 15)} {151263#(<= ~counter~0 15)} #96#return; {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,598 INFO L290 TraceCheckUtils]: 136: Hoare triple {151263#(<= ~counter~0 15)} assume !(~r~0 > 0); {151263#(<= ~counter~0 15)} is VALID [2022-04-08 06:09:56,600 INFO L290 TraceCheckUtils]: 137: Hoare triple {151263#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,600 INFO L290 TraceCheckUtils]: 138: Hoare triple {151288#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,601 INFO L272 TraceCheckUtils]: 139: Hoare triple {151288#(<= ~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)); {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,601 INFO L290 TraceCheckUtils]: 140: Hoare triple {151288#(<= ~counter~0 16)} ~cond := #in~cond; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,601 INFO L290 TraceCheckUtils]: 141: Hoare triple {151288#(<= ~counter~0 16)} assume !(0 == ~cond); {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,601 INFO L290 TraceCheckUtils]: 142: Hoare triple {151288#(<= ~counter~0 16)} assume true; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,602 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {151288#(<= ~counter~0 16)} {151288#(<= ~counter~0 16)} #98#return; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,602 INFO L290 TraceCheckUtils]: 144: Hoare triple {151288#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151288#(<= ~counter~0 16)} is VALID [2022-04-08 06:09:56,602 INFO L290 TraceCheckUtils]: 145: Hoare triple {151288#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151313#(<= |main_#t~post8| 16)} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 146: Hoare triple {151313#(<= |main_#t~post8| 16)} assume !(#t~post8 < 100);havoc #t~post8; {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 147: Hoare triple {150857#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 148: Hoare triple {150857#false} assume !(#t~post6 < 100);havoc #t~post6; {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L272 TraceCheckUtils]: 149: Hoare triple {150857#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 150: Hoare triple {150857#false} ~cond := #in~cond; {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 151: Hoare triple {150857#false} assume 0 == ~cond; {150857#false} is VALID [2022-04-08 06:09:56,603 INFO L290 TraceCheckUtils]: 152: Hoare triple {150857#false} assume !false; {150857#false} is VALID [2022-04-08 06:09:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 654 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:09:56,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:09:57,634 INFO L290 TraceCheckUtils]: 152: Hoare triple {150857#false} assume !false; {150857#false} is VALID [2022-04-08 06:09:57,634 INFO L290 TraceCheckUtils]: 151: Hoare triple {150857#false} assume 0 == ~cond; {150857#false} is VALID [2022-04-08 06:09:57,634 INFO L290 TraceCheckUtils]: 150: Hoare triple {150857#false} ~cond := #in~cond; {150857#false} is VALID [2022-04-08 06:09:57,634 INFO L272 TraceCheckUtils]: 149: Hoare triple {150857#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {150857#false} is VALID [2022-04-08 06:09:57,634 INFO L290 TraceCheckUtils]: 148: Hoare triple {150857#false} assume !(#t~post6 < 100);havoc #t~post6; {150857#false} is VALID [2022-04-08 06:09:57,634 INFO L290 TraceCheckUtils]: 147: Hoare triple {150857#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150857#false} is VALID [2022-04-08 06:09:57,635 INFO L290 TraceCheckUtils]: 146: Hoare triple {151353#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {150857#false} is VALID [2022-04-08 06:09:57,635 INFO L290 TraceCheckUtils]: 145: Hoare triple {151357#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151353#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:09:57,635 INFO L290 TraceCheckUtils]: 144: Hoare triple {151357#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151357#(< ~counter~0 100)} is VALID [2022-04-08 06:09:57,636 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150856#true} {151357#(< ~counter~0 100)} #98#return; {151357#(< ~counter~0 100)} is VALID [2022-04-08 06:09:57,636 INFO L290 TraceCheckUtils]: 142: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,636 INFO L290 TraceCheckUtils]: 141: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,636 INFO L290 TraceCheckUtils]: 140: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,636 INFO L272 TraceCheckUtils]: 139: Hoare triple {151357#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,636 INFO L290 TraceCheckUtils]: 138: Hoare triple {151357#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {151357#(< ~counter~0 100)} is VALID [2022-04-08 06:09:57,639 INFO L290 TraceCheckUtils]: 137: Hoare triple {151382#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151357#(< ~counter~0 100)} is VALID [2022-04-08 06:09:57,640 INFO L290 TraceCheckUtils]: 136: Hoare triple {151382#(< ~counter~0 99)} assume !(~r~0 > 0); {151382#(< ~counter~0 99)} is VALID [2022-04-08 06:09:57,640 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150856#true} {151382#(< ~counter~0 99)} #96#return; {151382#(< ~counter~0 99)} is VALID [2022-04-08 06:09:57,640 INFO L290 TraceCheckUtils]: 134: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,640 INFO L290 TraceCheckUtils]: 133: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,640 INFO L290 TraceCheckUtils]: 132: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,640 INFO L272 TraceCheckUtils]: 131: Hoare triple {151382#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,640 INFO L290 TraceCheckUtils]: 130: Hoare triple {151382#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {151382#(< ~counter~0 99)} is VALID [2022-04-08 06:09:57,642 INFO L290 TraceCheckUtils]: 129: Hoare triple {151407#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151382#(< ~counter~0 99)} is VALID [2022-04-08 06:09:57,642 INFO L290 TraceCheckUtils]: 128: Hoare triple {151407#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151407#(< ~counter~0 98)} is VALID [2022-04-08 06:09:57,643 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150856#true} {151407#(< ~counter~0 98)} #96#return; {151407#(< ~counter~0 98)} is VALID [2022-04-08 06:09:57,643 INFO L290 TraceCheckUtils]: 126: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,643 INFO L290 TraceCheckUtils]: 125: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,643 INFO L290 TraceCheckUtils]: 124: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,643 INFO L272 TraceCheckUtils]: 123: Hoare triple {151407#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,643 INFO L290 TraceCheckUtils]: 122: Hoare triple {151407#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {151407#(< ~counter~0 98)} is VALID [2022-04-08 06:09:57,644 INFO L290 TraceCheckUtils]: 121: Hoare triple {151432#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151407#(< ~counter~0 98)} is VALID [2022-04-08 06:09:57,645 INFO L290 TraceCheckUtils]: 120: Hoare triple {151432#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151432#(< ~counter~0 97)} is VALID [2022-04-08 06:09:57,645 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150856#true} {151432#(< ~counter~0 97)} #96#return; {151432#(< ~counter~0 97)} is VALID [2022-04-08 06:09:57,645 INFO L290 TraceCheckUtils]: 118: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,645 INFO L272 TraceCheckUtils]: 115: Hoare triple {151432#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,646 INFO L290 TraceCheckUtils]: 114: Hoare triple {151432#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {151432#(< ~counter~0 97)} is VALID [2022-04-08 06:09:57,647 INFO L290 TraceCheckUtils]: 113: Hoare triple {151457#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151432#(< ~counter~0 97)} is VALID [2022-04-08 06:09:57,647 INFO L290 TraceCheckUtils]: 112: Hoare triple {151457#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151457#(< ~counter~0 96)} is VALID [2022-04-08 06:09:57,648 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150856#true} {151457#(< ~counter~0 96)} #96#return; {151457#(< ~counter~0 96)} is VALID [2022-04-08 06:09:57,648 INFO L290 TraceCheckUtils]: 110: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,648 INFO L290 TraceCheckUtils]: 109: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,648 INFO L290 TraceCheckUtils]: 108: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,648 INFO L272 TraceCheckUtils]: 107: Hoare triple {151457#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {151457#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {151457#(< ~counter~0 96)} is VALID [2022-04-08 06:09:57,649 INFO L290 TraceCheckUtils]: 105: Hoare triple {151482#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151457#(< ~counter~0 96)} is VALID [2022-04-08 06:09:57,650 INFO L290 TraceCheckUtils]: 104: Hoare triple {151482#(< ~counter~0 95)} assume !!(0 != ~r~0); {151482#(< ~counter~0 95)} is VALID [2022-04-08 06:09:57,650 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150856#true} {151482#(< ~counter~0 95)} #94#return; {151482#(< ~counter~0 95)} is VALID [2022-04-08 06:09:57,650 INFO L290 TraceCheckUtils]: 102: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,650 INFO L290 TraceCheckUtils]: 101: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,650 INFO L290 TraceCheckUtils]: 100: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,650 INFO L272 TraceCheckUtils]: 99: Hoare triple {151482#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,651 INFO L290 TraceCheckUtils]: 98: Hoare triple {151482#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {151482#(< ~counter~0 95)} is VALID [2022-04-08 06:09:57,652 INFO L290 TraceCheckUtils]: 97: Hoare triple {151507#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151482#(< ~counter~0 95)} is VALID [2022-04-08 06:09:57,652 INFO L290 TraceCheckUtils]: 96: Hoare triple {151507#(< ~counter~0 94)} assume !(~r~0 < 0); {151507#(< ~counter~0 94)} is VALID [2022-04-08 06:09:57,653 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150856#true} {151507#(< ~counter~0 94)} #98#return; {151507#(< ~counter~0 94)} is VALID [2022-04-08 06:09:57,653 INFO L290 TraceCheckUtils]: 94: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,653 INFO L290 TraceCheckUtils]: 93: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,653 INFO L290 TraceCheckUtils]: 92: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,653 INFO L272 TraceCheckUtils]: 91: Hoare triple {151507#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,653 INFO L290 TraceCheckUtils]: 90: Hoare triple {151507#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {151507#(< ~counter~0 94)} is VALID [2022-04-08 06:09:57,655 INFO L290 TraceCheckUtils]: 89: Hoare triple {151532#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151507#(< ~counter~0 94)} is VALID [2022-04-08 06:09:57,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {151532#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151532#(< ~counter~0 93)} is VALID [2022-04-08 06:09:57,655 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150856#true} {151532#(< ~counter~0 93)} #98#return; {151532#(< ~counter~0 93)} is VALID [2022-04-08 06:09:57,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,656 INFO L272 TraceCheckUtils]: 83: Hoare triple {151532#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,656 INFO L290 TraceCheckUtils]: 82: Hoare triple {151532#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {151532#(< ~counter~0 93)} is VALID [2022-04-08 06:09:57,657 INFO L290 TraceCheckUtils]: 81: Hoare triple {151557#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151532#(< ~counter~0 93)} is VALID [2022-04-08 06:09:57,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {151557#(< ~counter~0 92)} assume !(~r~0 > 0); {151557#(< ~counter~0 92)} is VALID [2022-04-08 06:09:57,658 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150856#true} {151557#(< ~counter~0 92)} #96#return; {151557#(< ~counter~0 92)} is VALID [2022-04-08 06:09:57,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,658 INFO L290 TraceCheckUtils]: 76: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,658 INFO L272 TraceCheckUtils]: 75: Hoare triple {151557#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {151557#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {151557#(< ~counter~0 92)} is VALID [2022-04-08 06:09:57,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {151582#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151557#(< ~counter~0 92)} is VALID [2022-04-08 06:09:57,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {151582#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151582#(< ~counter~0 91)} is VALID [2022-04-08 06:09:57,660 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150856#true} {151582#(< ~counter~0 91)} #96#return; {151582#(< ~counter~0 91)} is VALID [2022-04-08 06:09:57,660 INFO L290 TraceCheckUtils]: 70: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,661 INFO L290 TraceCheckUtils]: 69: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,661 INFO L272 TraceCheckUtils]: 67: Hoare triple {151582#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {151582#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {151582#(< ~counter~0 91)} is VALID [2022-04-08 06:09:57,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {151607#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151582#(< ~counter~0 91)} is VALID [2022-04-08 06:09:57,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {151607#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151607#(< ~counter~0 90)} is VALID [2022-04-08 06:09:57,663 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150856#true} {151607#(< ~counter~0 90)} #96#return; {151607#(< ~counter~0 90)} is VALID [2022-04-08 06:09:57,663 INFO L290 TraceCheckUtils]: 62: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,663 INFO L290 TraceCheckUtils]: 60: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,663 INFO L272 TraceCheckUtils]: 59: Hoare triple {151607#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {151607#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {151607#(< ~counter~0 90)} is VALID [2022-04-08 06:09:57,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {151632#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151607#(< ~counter~0 90)} is VALID [2022-04-08 06:09:57,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {151632#(< ~counter~0 89)} assume !!(0 != ~r~0); {151632#(< ~counter~0 89)} is VALID [2022-04-08 06:09:57,665 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150856#true} {151632#(< ~counter~0 89)} #94#return; {151632#(< ~counter~0 89)} is VALID [2022-04-08 06:09:57,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,665 INFO L272 TraceCheckUtils]: 51: Hoare triple {151632#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {151632#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {151632#(< ~counter~0 89)} is VALID [2022-04-08 06:09:57,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {151657#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151632#(< ~counter~0 89)} is VALID [2022-04-08 06:09:57,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {151657#(< ~counter~0 88)} assume !(~r~0 < 0); {151657#(< ~counter~0 88)} is VALID [2022-04-08 06:09:57,668 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150856#true} {151657#(< ~counter~0 88)} #98#return; {151657#(< ~counter~0 88)} is VALID [2022-04-08 06:09:57,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,668 INFO L272 TraceCheckUtils]: 43: Hoare triple {151657#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {151657#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {151657#(< ~counter~0 88)} is VALID [2022-04-08 06:09:57,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {151682#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151657#(< ~counter~0 88)} is VALID [2022-04-08 06:09:57,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {151682#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151682#(< ~counter~0 87)} is VALID [2022-04-08 06:09:57,670 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150856#true} {151682#(< ~counter~0 87)} #98#return; {151682#(< ~counter~0 87)} is VALID [2022-04-08 06:09:57,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,670 INFO L272 TraceCheckUtils]: 35: Hoare triple {151682#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {151682#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {151682#(< ~counter~0 87)} is VALID [2022-04-08 06:09:57,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {151707#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151682#(< ~counter~0 87)} is VALID [2022-04-08 06:09:57,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {151707#(< ~counter~0 86)} assume !(~r~0 > 0); {151707#(< ~counter~0 86)} is VALID [2022-04-08 06:09:57,673 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150856#true} {151707#(< ~counter~0 86)} #96#return; {151707#(< ~counter~0 86)} is VALID [2022-04-08 06:09:57,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {151707#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {151707#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {151707#(< ~counter~0 86)} is VALID [2022-04-08 06:09:57,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {151732#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151707#(< ~counter~0 86)} is VALID [2022-04-08 06:09:57,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {151732#(< ~counter~0 85)} assume !!(0 != ~r~0); {151732#(< ~counter~0 85)} is VALID [2022-04-08 06:09:57,675 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150856#true} {151732#(< ~counter~0 85)} #94#return; {151732#(< ~counter~0 85)} is VALID [2022-04-08 06:09:57,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {151732#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {151732#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {151732#(< ~counter~0 85)} is VALID [2022-04-08 06:09:57,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {151757#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151732#(< ~counter~0 85)} is VALID [2022-04-08 06:09:57,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {151757#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150856#true} {151757#(< ~counter~0 84)} #92#return; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,678 INFO L272 TraceCheckUtils]: 11: Hoare triple {151757#(< ~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)); {150856#true} is VALID [2022-04-08 06:09:57,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150856#true} {151757#(< ~counter~0 84)} #90#return; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-08 06:09:57,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-08 06:09:57,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-08 06:09:57,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {151757#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150856#true} is VALID [2022-04-08 06:09:57,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {151757#(< ~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; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {151757#(< ~counter~0 84)} call #t~ret9 := main(); {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151757#(< ~counter~0 84)} {150856#true} #102#return; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {151757#(< ~counter~0 84)} assume true; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {150856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {151757#(< ~counter~0 84)} is VALID [2022-04-08 06:09:57,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {150856#true} call ULTIMATE.init(); {150856#true} is VALID [2022-04-08 06:09:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 06:09:57,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:09:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384410871] [2022-04-08 06:09:57,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:09:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413741289] [2022-04-08 06:09:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413741289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:09:57,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:09:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:09:57,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:09:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073639599] [2022-04-08 06:09:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073639599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:09:57,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:09:57,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:09:57,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59731835] [2022-04-08 06:09:57,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:09:57,682 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-08 06:09:57,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:09:57,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:09:57,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:09:57,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:09:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:09:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:09:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:09:57,864 INFO L87 Difference]: Start difference. First operand 819 states and 1096 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:03,195 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-08 06:10:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 06:10:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 153 [2022-04-08 06:10:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 06:10:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-08 06:10:03,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-08 06:10:03,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:03,670 INFO L225 Difference]: With dead ends: 1023 [2022-04-08 06:10:03,670 INFO L226 Difference]: Without dead ends: 845 [2022-04-08 06:10:03,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1125, Invalid=1527, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 06:10:03,672 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:03,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 342 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 06:10:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-08 06:10:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-08 06:10:07,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:07,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:07,249 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:07,250 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:07,275 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 06:10:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 06:10:07,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:07,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:07,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 06:10:07,276 INFO L87 Difference]: Start difference. First operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-08 06:10:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:07,302 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-08 06:10:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-08 06:10:07,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:07,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:07,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:07,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 624 states have (on average 1.1826923076923077) internal successors, (738), 636 states have internal predecessors, (738), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-08 06:10:07,342 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-08 06:10:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:07,342 INFO L478 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-08 06:10:07,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:07,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-08 06:10:15,266 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-08 06:10:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-08 06:10:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-08 06:10:15,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:15,268 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 10, 9, 9, 9, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:10:15,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-08 06:10:15,469 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:15,469 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:15,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-08 06:10:15,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:15,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456390957] [2022-04-08 06:10:15,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:15,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-08 06:10:15,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:15,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135476132] [2022-04-08 06:10:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:15,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:15,484 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:15,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803161182] [2022-04-08 06:10:15,484 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:10:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:15,485 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:10:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 06:10:15,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:10:15,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:15,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 06:10:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:15,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:16,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {157243#true} call ULTIMATE.init(); {157243#true} is VALID [2022-04-08 06:10:16,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {157243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157251#(<= ~counter~0 0)} {157243#true} #102#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {157251#(<= ~counter~0 0)} call #t~ret9 := main(); {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {157251#(<= ~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; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {157251#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {157251#(<= ~counter~0 0)} ~cond := #in~cond; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {157251#(<= ~counter~0 0)} assume !(0 == ~cond); {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {157251#(<= ~counter~0 0)} {157251#(<= ~counter~0 0)} #90#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {157251#(<= ~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)); {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {157251#(<= ~counter~0 0)} ~cond := #in~cond; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {157251#(<= ~counter~0 0)} assume !(0 == ~cond); {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {157251#(<= ~counter~0 0)} {157251#(<= ~counter~0 0)} #92#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {157251#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {157251#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:16,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {157251#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {157300#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,509 INFO L272 TraceCheckUtils]: 19: Hoare triple {157300#(<= ~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)); {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {157300#(<= ~counter~0 1)} ~cond := #in~cond; {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {157300#(<= ~counter~0 1)} assume !(0 == ~cond); {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {157300#(<= ~counter~0 1)} assume true; {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,510 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {157300#(<= ~counter~0 1)} {157300#(<= ~counter~0 1)} #94#return; {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {157300#(<= ~counter~0 1)} assume !!(0 != ~r~0); {157300#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:16,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {157300#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {157325#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,512 INFO L272 TraceCheckUtils]: 27: Hoare triple {157325#(<= ~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)); {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {157325#(<= ~counter~0 2)} ~cond := #in~cond; {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {157325#(<= ~counter~0 2)} assume !(0 == ~cond); {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {157325#(<= ~counter~0 2)} assume true; {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,513 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {157325#(<= ~counter~0 2)} {157325#(<= ~counter~0 2)} #96#return; {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {157325#(<= ~counter~0 2)} assume !(~r~0 > 0); {157325#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:16,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {157325#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {157350#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,515 INFO L272 TraceCheckUtils]: 35: Hoare triple {157350#(<= ~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)); {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {157350#(<= ~counter~0 3)} ~cond := #in~cond; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {157350#(<= ~counter~0 3)} assume !(0 == ~cond); {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {157350#(<= ~counter~0 3)} assume true; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,516 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {157350#(<= ~counter~0 3)} {157350#(<= ~counter~0 3)} #98#return; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {157350#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157350#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:16,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {157350#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,518 INFO L290 TraceCheckUtils]: 42: Hoare triple {157375#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,518 INFO L272 TraceCheckUtils]: 43: Hoare triple {157375#(<= ~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)); {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {157375#(<= ~counter~0 4)} ~cond := #in~cond; {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {157375#(<= ~counter~0 4)} assume !(0 == ~cond); {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {157375#(<= ~counter~0 4)} assume true; {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,520 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {157375#(<= ~counter~0 4)} {157375#(<= ~counter~0 4)} #98#return; {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {157375#(<= ~counter~0 4)} assume !(~r~0 < 0); {157375#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:16,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {157375#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {157400#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,524 INFO L272 TraceCheckUtils]: 51: Hoare triple {157400#(<= ~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)); {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,524 INFO L290 TraceCheckUtils]: 52: Hoare triple {157400#(<= ~counter~0 5)} ~cond := #in~cond; {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {157400#(<= ~counter~0 5)} assume !(0 == ~cond); {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {157400#(<= ~counter~0 5)} assume true; {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,525 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {157400#(<= ~counter~0 5)} {157400#(<= ~counter~0 5)} #94#return; {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {157400#(<= ~counter~0 5)} assume !!(0 != ~r~0); {157400#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:16,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {157400#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {157425#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,527 INFO L272 TraceCheckUtils]: 59: Hoare triple {157425#(<= ~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)); {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {157425#(<= ~counter~0 6)} ~cond := #in~cond; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {157425#(<= ~counter~0 6)} assume !(0 == ~cond); {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {157425#(<= ~counter~0 6)} assume true; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,529 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157425#(<= ~counter~0 6)} {157425#(<= ~counter~0 6)} #96#return; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,529 INFO L290 TraceCheckUtils]: 64: Hoare triple {157425#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157425#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:16,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {157425#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {157450#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,531 INFO L272 TraceCheckUtils]: 67: Hoare triple {157450#(<= ~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)); {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {157450#(<= ~counter~0 7)} ~cond := #in~cond; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {157450#(<= ~counter~0 7)} assume !(0 == ~cond); {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {157450#(<= ~counter~0 7)} assume true; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,532 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157450#(<= ~counter~0 7)} {157450#(<= ~counter~0 7)} #96#return; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,532 INFO L290 TraceCheckUtils]: 72: Hoare triple {157450#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157450#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:16,533 INFO L290 TraceCheckUtils]: 73: Hoare triple {157450#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {157475#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,534 INFO L272 TraceCheckUtils]: 75: Hoare triple {157475#(<= ~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)); {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {157475#(<= ~counter~0 8)} ~cond := #in~cond; {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,535 INFO L290 TraceCheckUtils]: 77: Hoare triple {157475#(<= ~counter~0 8)} assume !(0 == ~cond); {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,535 INFO L290 TraceCheckUtils]: 78: Hoare triple {157475#(<= ~counter~0 8)} assume true; {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,535 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157475#(<= ~counter~0 8)} {157475#(<= ~counter~0 8)} #96#return; {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,536 INFO L290 TraceCheckUtils]: 80: Hoare triple {157475#(<= ~counter~0 8)} assume !(~r~0 > 0); {157475#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:16,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {157475#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {157500#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,538 INFO L272 TraceCheckUtils]: 83: Hoare triple {157500#(<= ~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)); {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,538 INFO L290 TraceCheckUtils]: 84: Hoare triple {157500#(<= ~counter~0 9)} ~cond := #in~cond; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,538 INFO L290 TraceCheckUtils]: 85: Hoare triple {157500#(<= ~counter~0 9)} assume !(0 == ~cond); {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,538 INFO L290 TraceCheckUtils]: 86: Hoare triple {157500#(<= ~counter~0 9)} assume true; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,539 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157500#(<= ~counter~0 9)} {157500#(<= ~counter~0 9)} #98#return; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {157500#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157500#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:16,540 INFO L290 TraceCheckUtils]: 89: Hoare triple {157500#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,541 INFO L290 TraceCheckUtils]: 90: Hoare triple {157525#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,541 INFO L272 TraceCheckUtils]: 91: Hoare triple {157525#(<= ~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)); {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {157525#(<= ~counter~0 10)} ~cond := #in~cond; {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,542 INFO L290 TraceCheckUtils]: 93: Hoare triple {157525#(<= ~counter~0 10)} assume !(0 == ~cond); {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,542 INFO L290 TraceCheckUtils]: 94: Hoare triple {157525#(<= ~counter~0 10)} assume true; {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,542 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157525#(<= ~counter~0 10)} {157525#(<= ~counter~0 10)} #98#return; {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,543 INFO L290 TraceCheckUtils]: 96: Hoare triple {157525#(<= ~counter~0 10)} assume !(~r~0 < 0); {157525#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:16,544 INFO L290 TraceCheckUtils]: 97: Hoare triple {157525#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,544 INFO L290 TraceCheckUtils]: 98: Hoare triple {157550#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,545 INFO L272 TraceCheckUtils]: 99: Hoare triple {157550#(<= ~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)); {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,545 INFO L290 TraceCheckUtils]: 100: Hoare triple {157550#(<= ~counter~0 11)} ~cond := #in~cond; {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,545 INFO L290 TraceCheckUtils]: 101: Hoare triple {157550#(<= ~counter~0 11)} assume !(0 == ~cond); {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,545 INFO L290 TraceCheckUtils]: 102: Hoare triple {157550#(<= ~counter~0 11)} assume true; {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,546 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157550#(<= ~counter~0 11)} {157550#(<= ~counter~0 11)} #94#return; {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,546 INFO L290 TraceCheckUtils]: 104: Hoare triple {157550#(<= ~counter~0 11)} assume !!(0 != ~r~0); {157550#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:16,547 INFO L290 TraceCheckUtils]: 105: Hoare triple {157550#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {157575#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,548 INFO L272 TraceCheckUtils]: 107: Hoare triple {157575#(<= ~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)); {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,548 INFO L290 TraceCheckUtils]: 108: Hoare triple {157575#(<= ~counter~0 12)} ~cond := #in~cond; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {157575#(<= ~counter~0 12)} assume !(0 == ~cond); {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,549 INFO L290 TraceCheckUtils]: 110: Hoare triple {157575#(<= ~counter~0 12)} assume true; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,549 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157575#(<= ~counter~0 12)} {157575#(<= ~counter~0 12)} #96#return; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,550 INFO L290 TraceCheckUtils]: 112: Hoare triple {157575#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157575#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:16,551 INFO L290 TraceCheckUtils]: 113: Hoare triple {157575#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,551 INFO L290 TraceCheckUtils]: 114: Hoare triple {157600#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,552 INFO L272 TraceCheckUtils]: 115: Hoare triple {157600#(<= ~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)); {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,552 INFO L290 TraceCheckUtils]: 116: Hoare triple {157600#(<= ~counter~0 13)} ~cond := #in~cond; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,552 INFO L290 TraceCheckUtils]: 117: Hoare triple {157600#(<= ~counter~0 13)} assume !(0 == ~cond); {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,552 INFO L290 TraceCheckUtils]: 118: Hoare triple {157600#(<= ~counter~0 13)} assume true; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,553 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157600#(<= ~counter~0 13)} {157600#(<= ~counter~0 13)} #96#return; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,553 INFO L290 TraceCheckUtils]: 120: Hoare triple {157600#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157600#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:16,554 INFO L290 TraceCheckUtils]: 121: Hoare triple {157600#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,555 INFO L290 TraceCheckUtils]: 122: Hoare triple {157625#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,555 INFO L272 TraceCheckUtils]: 123: Hoare triple {157625#(<= ~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)); {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,555 INFO L290 TraceCheckUtils]: 124: Hoare triple {157625#(<= ~counter~0 14)} ~cond := #in~cond; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,556 INFO L290 TraceCheckUtils]: 125: Hoare triple {157625#(<= ~counter~0 14)} assume !(0 == ~cond); {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,556 INFO L290 TraceCheckUtils]: 126: Hoare triple {157625#(<= ~counter~0 14)} assume true; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,556 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157625#(<= ~counter~0 14)} {157625#(<= ~counter~0 14)} #96#return; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,557 INFO L290 TraceCheckUtils]: 128: Hoare triple {157625#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157625#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:16,558 INFO L290 TraceCheckUtils]: 129: Hoare triple {157625#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,558 INFO L290 TraceCheckUtils]: 130: Hoare triple {157650#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,559 INFO L272 TraceCheckUtils]: 131: Hoare triple {157650#(<= ~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)); {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,559 INFO L290 TraceCheckUtils]: 132: Hoare triple {157650#(<= ~counter~0 15)} ~cond := #in~cond; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,559 INFO L290 TraceCheckUtils]: 133: Hoare triple {157650#(<= ~counter~0 15)} assume !(0 == ~cond); {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,559 INFO L290 TraceCheckUtils]: 134: Hoare triple {157650#(<= ~counter~0 15)} assume true; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,560 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157650#(<= ~counter~0 15)} {157650#(<= ~counter~0 15)} #96#return; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,560 INFO L290 TraceCheckUtils]: 136: Hoare triple {157650#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157650#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:16,561 INFO L290 TraceCheckUtils]: 137: Hoare triple {157650#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,562 INFO L290 TraceCheckUtils]: 138: Hoare triple {157675#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,562 INFO L272 TraceCheckUtils]: 139: Hoare triple {157675#(<= ~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)); {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,562 INFO L290 TraceCheckUtils]: 140: Hoare triple {157675#(<= ~counter~0 16)} ~cond := #in~cond; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,563 INFO L290 TraceCheckUtils]: 141: Hoare triple {157675#(<= ~counter~0 16)} assume !(0 == ~cond); {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,563 INFO L290 TraceCheckUtils]: 142: Hoare triple {157675#(<= ~counter~0 16)} assume true; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,563 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157675#(<= ~counter~0 16)} {157675#(<= ~counter~0 16)} #96#return; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,564 INFO L290 TraceCheckUtils]: 144: Hoare triple {157675#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157675#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:16,564 INFO L290 TraceCheckUtils]: 145: Hoare triple {157675#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157700#(<= |main_#t~post7| 16)} is VALID [2022-04-08 06:10:16,564 INFO L290 TraceCheckUtils]: 146: Hoare triple {157700#(<= |main_#t~post7| 16)} assume !(#t~post7 < 100);havoc #t~post7; {157244#false} is VALID [2022-04-08 06:10:16,564 INFO L290 TraceCheckUtils]: 147: Hoare triple {157244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157244#false} is VALID [2022-04-08 06:10:16,564 INFO L290 TraceCheckUtils]: 148: Hoare triple {157244#false} assume !(#t~post8 < 100);havoc #t~post8; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L290 TraceCheckUtils]: 149: Hoare triple {157244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L290 TraceCheckUtils]: 150: Hoare triple {157244#false} assume !(#t~post6 < 100);havoc #t~post6; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L272 TraceCheckUtils]: 151: Hoare triple {157244#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L290 TraceCheckUtils]: 152: Hoare triple {157244#false} ~cond := #in~cond; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L290 TraceCheckUtils]: 153: Hoare triple {157244#false} assume 0 == ~cond; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L290 TraceCheckUtils]: 154: Hoare triple {157244#false} assume !false; {157244#false} is VALID [2022-04-08 06:10:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 678 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:10:16,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 154: Hoare triple {157244#false} assume !false; {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 153: Hoare triple {157244#false} assume 0 == ~cond; {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 152: Hoare triple {157244#false} ~cond := #in~cond; {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L272 TraceCheckUtils]: 151: Hoare triple {157244#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 150: Hoare triple {157244#false} assume !(#t~post6 < 100);havoc #t~post6; {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 149: Hoare triple {157244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157244#false} is VALID [2022-04-08 06:10:17,536 INFO L290 TraceCheckUtils]: 148: Hoare triple {157244#false} assume !(#t~post8 < 100);havoc #t~post8; {157244#false} is VALID [2022-04-08 06:10:17,537 INFO L290 TraceCheckUtils]: 147: Hoare triple {157244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157244#false} is VALID [2022-04-08 06:10:17,537 INFO L290 TraceCheckUtils]: 146: Hoare triple {157752#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {157244#false} is VALID [2022-04-08 06:10:17,537 INFO L290 TraceCheckUtils]: 145: Hoare triple {157756#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157752#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:10:17,537 INFO L290 TraceCheckUtils]: 144: Hoare triple {157756#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157756#(< ~counter~0 100)} is VALID [2022-04-08 06:10:17,538 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157243#true} {157756#(< ~counter~0 100)} #96#return; {157756#(< ~counter~0 100)} is VALID [2022-04-08 06:10:17,538 INFO L290 TraceCheckUtils]: 142: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,538 INFO L290 TraceCheckUtils]: 141: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,538 INFO L290 TraceCheckUtils]: 140: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,538 INFO L272 TraceCheckUtils]: 139: Hoare triple {157756#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,538 INFO L290 TraceCheckUtils]: 138: Hoare triple {157756#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {157756#(< ~counter~0 100)} is VALID [2022-04-08 06:10:17,541 INFO L290 TraceCheckUtils]: 137: Hoare triple {157781#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157756#(< ~counter~0 100)} is VALID [2022-04-08 06:10:17,542 INFO L290 TraceCheckUtils]: 136: Hoare triple {157781#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157781#(< ~counter~0 99)} is VALID [2022-04-08 06:10:17,542 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157243#true} {157781#(< ~counter~0 99)} #96#return; {157781#(< ~counter~0 99)} is VALID [2022-04-08 06:10:17,542 INFO L290 TraceCheckUtils]: 134: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,542 INFO L290 TraceCheckUtils]: 133: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,542 INFO L290 TraceCheckUtils]: 132: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,542 INFO L272 TraceCheckUtils]: 131: Hoare triple {157781#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,543 INFO L290 TraceCheckUtils]: 130: Hoare triple {157781#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {157781#(< ~counter~0 99)} is VALID [2022-04-08 06:10:17,544 INFO L290 TraceCheckUtils]: 129: Hoare triple {157806#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157781#(< ~counter~0 99)} is VALID [2022-04-08 06:10:17,544 INFO L290 TraceCheckUtils]: 128: Hoare triple {157806#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157806#(< ~counter~0 98)} is VALID [2022-04-08 06:10:17,545 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157243#true} {157806#(< ~counter~0 98)} #96#return; {157806#(< ~counter~0 98)} is VALID [2022-04-08 06:10:17,545 INFO L290 TraceCheckUtils]: 126: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,545 INFO L290 TraceCheckUtils]: 125: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,545 INFO L290 TraceCheckUtils]: 124: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,545 INFO L272 TraceCheckUtils]: 123: Hoare triple {157806#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,545 INFO L290 TraceCheckUtils]: 122: Hoare triple {157806#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {157806#(< ~counter~0 98)} is VALID [2022-04-08 06:10:17,546 INFO L290 TraceCheckUtils]: 121: Hoare triple {157831#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157806#(< ~counter~0 98)} is VALID [2022-04-08 06:10:17,547 INFO L290 TraceCheckUtils]: 120: Hoare triple {157831#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157831#(< ~counter~0 97)} is VALID [2022-04-08 06:10:17,547 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157243#true} {157831#(< ~counter~0 97)} #96#return; {157831#(< ~counter~0 97)} is VALID [2022-04-08 06:10:17,547 INFO L290 TraceCheckUtils]: 118: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,547 INFO L290 TraceCheckUtils]: 117: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,547 INFO L290 TraceCheckUtils]: 116: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,548 INFO L272 TraceCheckUtils]: 115: Hoare triple {157831#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,548 INFO L290 TraceCheckUtils]: 114: Hoare triple {157831#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {157831#(< ~counter~0 97)} is VALID [2022-04-08 06:10:17,549 INFO L290 TraceCheckUtils]: 113: Hoare triple {157856#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157831#(< ~counter~0 97)} is VALID [2022-04-08 06:10:17,549 INFO L290 TraceCheckUtils]: 112: Hoare triple {157856#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157856#(< ~counter~0 96)} is VALID [2022-04-08 06:10:17,550 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157243#true} {157856#(< ~counter~0 96)} #96#return; {157856#(< ~counter~0 96)} is VALID [2022-04-08 06:10:17,550 INFO L290 TraceCheckUtils]: 110: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,550 INFO L290 TraceCheckUtils]: 109: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,550 INFO L290 TraceCheckUtils]: 108: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,550 INFO L272 TraceCheckUtils]: 107: Hoare triple {157856#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,550 INFO L290 TraceCheckUtils]: 106: Hoare triple {157856#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {157856#(< ~counter~0 96)} is VALID [2022-04-08 06:10:17,551 INFO L290 TraceCheckUtils]: 105: Hoare triple {157881#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157856#(< ~counter~0 96)} is VALID [2022-04-08 06:10:17,552 INFO L290 TraceCheckUtils]: 104: Hoare triple {157881#(< ~counter~0 95)} assume !!(0 != ~r~0); {157881#(< ~counter~0 95)} is VALID [2022-04-08 06:10:17,552 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157243#true} {157881#(< ~counter~0 95)} #94#return; {157881#(< ~counter~0 95)} is VALID [2022-04-08 06:10:17,552 INFO L290 TraceCheckUtils]: 102: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,552 INFO L290 TraceCheckUtils]: 101: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,552 INFO L290 TraceCheckUtils]: 100: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,553 INFO L272 TraceCheckUtils]: 99: Hoare triple {157881#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,553 INFO L290 TraceCheckUtils]: 98: Hoare triple {157881#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {157881#(< ~counter~0 95)} is VALID [2022-04-08 06:10:17,554 INFO L290 TraceCheckUtils]: 97: Hoare triple {157906#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157881#(< ~counter~0 95)} is VALID [2022-04-08 06:10:17,554 INFO L290 TraceCheckUtils]: 96: Hoare triple {157906#(< ~counter~0 94)} assume !(~r~0 < 0); {157906#(< ~counter~0 94)} is VALID [2022-04-08 06:10:17,555 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157243#true} {157906#(< ~counter~0 94)} #98#return; {157906#(< ~counter~0 94)} is VALID [2022-04-08 06:10:17,555 INFO L290 TraceCheckUtils]: 94: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,555 INFO L290 TraceCheckUtils]: 93: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,555 INFO L290 TraceCheckUtils]: 92: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,555 INFO L272 TraceCheckUtils]: 91: Hoare triple {157906#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {157906#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {157906#(< ~counter~0 94)} is VALID [2022-04-08 06:10:17,556 INFO L290 TraceCheckUtils]: 89: Hoare triple {157931#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157906#(< ~counter~0 94)} is VALID [2022-04-08 06:10:17,557 INFO L290 TraceCheckUtils]: 88: Hoare triple {157931#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157931#(< ~counter~0 93)} is VALID [2022-04-08 06:10:17,557 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157243#true} {157931#(< ~counter~0 93)} #98#return; {157931#(< ~counter~0 93)} is VALID [2022-04-08 06:10:17,557 INFO L290 TraceCheckUtils]: 86: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,557 INFO L290 TraceCheckUtils]: 85: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,557 INFO L290 TraceCheckUtils]: 84: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,557 INFO L272 TraceCheckUtils]: 83: Hoare triple {157931#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,558 INFO L290 TraceCheckUtils]: 82: Hoare triple {157931#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {157931#(< ~counter~0 93)} is VALID [2022-04-08 06:10:17,559 INFO L290 TraceCheckUtils]: 81: Hoare triple {157956#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157931#(< ~counter~0 93)} is VALID [2022-04-08 06:10:17,559 INFO L290 TraceCheckUtils]: 80: Hoare triple {157956#(< ~counter~0 92)} assume !(~r~0 > 0); {157956#(< ~counter~0 92)} is VALID [2022-04-08 06:10:17,560 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157243#true} {157956#(< ~counter~0 92)} #96#return; {157956#(< ~counter~0 92)} is VALID [2022-04-08 06:10:17,560 INFO L290 TraceCheckUtils]: 78: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,560 INFO L290 TraceCheckUtils]: 77: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,560 INFO L290 TraceCheckUtils]: 76: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,560 INFO L272 TraceCheckUtils]: 75: Hoare triple {157956#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,560 INFO L290 TraceCheckUtils]: 74: Hoare triple {157956#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {157956#(< ~counter~0 92)} is VALID [2022-04-08 06:10:17,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {157981#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157956#(< ~counter~0 92)} is VALID [2022-04-08 06:10:17,562 INFO L290 TraceCheckUtils]: 72: Hoare triple {157981#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157981#(< ~counter~0 91)} is VALID [2022-04-08 06:10:17,562 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157243#true} {157981#(< ~counter~0 91)} #96#return; {157981#(< ~counter~0 91)} is VALID [2022-04-08 06:10:17,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,562 INFO L272 TraceCheckUtils]: 67: Hoare triple {157981#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {157981#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {157981#(< ~counter~0 91)} is VALID [2022-04-08 06:10:17,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {158006#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157981#(< ~counter~0 91)} is VALID [2022-04-08 06:10:17,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {158006#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158006#(< ~counter~0 90)} is VALID [2022-04-08 06:10:17,565 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157243#true} {158006#(< ~counter~0 90)} #96#return; {158006#(< ~counter~0 90)} is VALID [2022-04-08 06:10:17,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,565 INFO L272 TraceCheckUtils]: 59: Hoare triple {158006#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,565 INFO L290 TraceCheckUtils]: 58: Hoare triple {158006#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {158006#(< ~counter~0 90)} is VALID [2022-04-08 06:10:17,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {158031#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158006#(< ~counter~0 90)} is VALID [2022-04-08 06:10:17,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {158031#(< ~counter~0 89)} assume !!(0 != ~r~0); {158031#(< ~counter~0 89)} is VALID [2022-04-08 06:10:17,567 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {157243#true} {158031#(< ~counter~0 89)} #94#return; {158031#(< ~counter~0 89)} is VALID [2022-04-08 06:10:17,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,567 INFO L272 TraceCheckUtils]: 51: Hoare triple {158031#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {158031#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {158031#(< ~counter~0 89)} is VALID [2022-04-08 06:10:17,569 INFO L290 TraceCheckUtils]: 49: Hoare triple {158056#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158031#(< ~counter~0 89)} is VALID [2022-04-08 06:10:17,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {158056#(< ~counter~0 88)} assume !(~r~0 < 0); {158056#(< ~counter~0 88)} is VALID [2022-04-08 06:10:17,570 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {157243#true} {158056#(< ~counter~0 88)} #98#return; {158056#(< ~counter~0 88)} is VALID [2022-04-08 06:10:17,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,570 INFO L272 TraceCheckUtils]: 43: Hoare triple {158056#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {158056#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {158056#(< ~counter~0 88)} is VALID [2022-04-08 06:10:17,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {158081#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158056#(< ~counter~0 88)} is VALID [2022-04-08 06:10:17,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {158081#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {158081#(< ~counter~0 87)} is VALID [2022-04-08 06:10:17,572 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {157243#true} {158081#(< ~counter~0 87)} #98#return; {158081#(< ~counter~0 87)} is VALID [2022-04-08 06:10:17,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,572 INFO L272 TraceCheckUtils]: 35: Hoare triple {158081#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {158081#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {158081#(< ~counter~0 87)} is VALID [2022-04-08 06:10:17,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {158106#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158081#(< ~counter~0 87)} is VALID [2022-04-08 06:10:17,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {158106#(< ~counter~0 86)} assume !(~r~0 > 0); {158106#(< ~counter~0 86)} is VALID [2022-04-08 06:10:17,575 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {157243#true} {158106#(< ~counter~0 86)} #96#return; {158106#(< ~counter~0 86)} is VALID [2022-04-08 06:10:17,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,575 INFO L272 TraceCheckUtils]: 27: Hoare triple {158106#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {158106#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {158106#(< ~counter~0 86)} is VALID [2022-04-08 06:10:17,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {158131#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158106#(< ~counter~0 86)} is VALID [2022-04-08 06:10:17,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {158131#(< ~counter~0 85)} assume !!(0 != ~r~0); {158131#(< ~counter~0 85)} is VALID [2022-04-08 06:10:17,577 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {157243#true} {158131#(< ~counter~0 85)} #94#return; {158131#(< ~counter~0 85)} is VALID [2022-04-08 06:10:17,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {158131#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {158131#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {158131#(< ~counter~0 85)} is VALID [2022-04-08 06:10:17,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {158156#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158131#(< ~counter~0 85)} is VALID [2022-04-08 06:10:17,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {158156#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,580 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {157243#true} {158156#(< ~counter~0 84)} #92#return; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,580 INFO L272 TraceCheckUtils]: 11: Hoare triple {158156#(< ~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)); {157243#true} is VALID [2022-04-08 06:10:17,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {157243#true} {158156#(< ~counter~0 84)} #90#return; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-08 06:10:17,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-08 06:10:17,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-08 06:10:17,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {158156#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {157243#true} is VALID [2022-04-08 06:10:17,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {158156#(< ~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; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {158156#(< ~counter~0 84)} call #t~ret9 := main(); {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158156#(< ~counter~0 84)} {157243#true} #102#return; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {158156#(< ~counter~0 84)} assume true; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {157243#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {158156#(< ~counter~0 84)} is VALID [2022-04-08 06:10:17,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {157243#true} call ULTIMATE.init(); {157243#true} is VALID [2022-04-08 06:10:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-08 06:10:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:17,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135476132] [2022-04-08 06:10:17,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:17,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803161182] [2022-04-08 06:10:17,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803161182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:17,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:17,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-08 06:10:17,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:17,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456390957] [2022-04-08 06:10:17,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456390957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:17,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:17,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 06:10:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41830320] [2022-04-08 06:10:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:17,584 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-08 06:10:17,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:17,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:17,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:17,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 06:10:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 06:10:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 06:10:17,756 INFO L87 Difference]: Start difference. First operand 834 states and 1114 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:22,998 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-08 06:10:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 06:10:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-08 06:10:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 06:10:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-08 06:10:23,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-08 06:10:23,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:23,367 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 06:10:23,367 INFO L226 Difference]: Without dead ends: 851 [2022-04-08 06:10:23,368 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1175, Invalid=1581, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 06:10:23,368 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 305 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:23,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 341 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 06:10:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-08 06:10:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-08 06:10:25,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:25,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:25,607 INFO L74 IsIncluded]: Start isIncluded. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:25,608 INFO L87 Difference]: Start difference. First operand 851 states. Second operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:25,633 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 06:10:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:10:25,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:25,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:25,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 06:10:25,634 INFO L87 Difference]: Start difference. First operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 851 states. [2022-04-08 06:10:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:25,658 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-08 06:10:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:10:25,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:25,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:25,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:25,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 641 states have (on average 1.1778471138845554) internal successors, (755), 648 states have internal predecessors, (755), 189 states have call successors, (189), 22 states have call predecessors, (189), 20 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-08 06:10:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-08 06:10:25,702 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-08 06:10:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:25,702 INFO L478 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-08 06:10:25,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-08 06:10:25,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-08 06:10:30,461 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-08 06:10:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-08 06:10:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-08 06:10:30,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:30,463 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:10:30,467 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-08 06:10:30,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:30,663 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-08 06:10:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281056525] [2022-04-08 06:10:30,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-08 06:10:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367061422] [2022-04-08 06:10:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:30,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779515021] [2022-04-08 06:10:30,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:10:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:30,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:30,691 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:10:30,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 06:10:31,343 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:10:31,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:31,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:10:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:31,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:32,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {163686#true} call ULTIMATE.init(); {163686#true} is VALID [2022-04-08 06:10:32,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {163686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163694#(<= ~counter~0 0)} {163686#true} #102#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {163694#(<= ~counter~0 0)} call #t~ret9 := main(); {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {163694#(<= ~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; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {163694#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {163694#(<= ~counter~0 0)} ~cond := #in~cond; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {163694#(<= ~counter~0 0)} assume !(0 == ~cond); {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163694#(<= ~counter~0 0)} {163694#(<= ~counter~0 0)} #90#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {163694#(<= ~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)); {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {163694#(<= ~counter~0 0)} ~cond := #in~cond; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {163694#(<= ~counter~0 0)} assume !(0 == ~cond); {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163694#(<= ~counter~0 0)} {163694#(<= ~counter~0 0)} #92#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {163694#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {163694#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:32,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {163694#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {163743#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,204 INFO L272 TraceCheckUtils]: 19: Hoare triple {163743#(<= ~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)); {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {163743#(<= ~counter~0 1)} ~cond := #in~cond; {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {163743#(<= ~counter~0 1)} assume !(0 == ~cond); {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {163743#(<= ~counter~0 1)} assume true; {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163743#(<= ~counter~0 1)} {163743#(<= ~counter~0 1)} #94#return; {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {163743#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163743#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:32,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {163743#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {163768#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,207 INFO L272 TraceCheckUtils]: 27: Hoare triple {163768#(<= ~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)); {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {163768#(<= ~counter~0 2)} ~cond := #in~cond; {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {163768#(<= ~counter~0 2)} assume !(0 == ~cond); {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {163768#(<= ~counter~0 2)} assume true; {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,208 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163768#(<= ~counter~0 2)} {163768#(<= ~counter~0 2)} #96#return; {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {163768#(<= ~counter~0 2)} assume !(~r~0 > 0); {163768#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:32,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {163768#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {163793#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {163793#(<= ~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)); {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {163793#(<= ~counter~0 3)} ~cond := #in~cond; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {163793#(<= ~counter~0 3)} assume !(0 == ~cond); {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {163793#(<= ~counter~0 3)} assume true; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,212 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163793#(<= ~counter~0 3)} {163793#(<= ~counter~0 3)} #98#return; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {163793#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163793#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:32,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {163793#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {163818#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,214 INFO L272 TraceCheckUtils]: 43: Hoare triple {163818#(<= ~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)); {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {163818#(<= ~counter~0 4)} ~cond := #in~cond; {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {163818#(<= ~counter~0 4)} assume !(0 == ~cond); {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {163818#(<= ~counter~0 4)} assume true; {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,215 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163818#(<= ~counter~0 4)} {163818#(<= ~counter~0 4)} #98#return; {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {163818#(<= ~counter~0 4)} assume !(~r~0 < 0); {163818#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:32,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {163818#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {163843#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,217 INFO L272 TraceCheckUtils]: 51: Hoare triple {163843#(<= ~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)); {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {163843#(<= ~counter~0 5)} ~cond := #in~cond; {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {163843#(<= ~counter~0 5)} assume !(0 == ~cond); {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,218 INFO L290 TraceCheckUtils]: 54: Hoare triple {163843#(<= ~counter~0 5)} assume true; {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,219 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163843#(<= ~counter~0 5)} {163843#(<= ~counter~0 5)} #94#return; {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,219 INFO L290 TraceCheckUtils]: 56: Hoare triple {163843#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163843#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:32,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {163843#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {163868#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,221 INFO L272 TraceCheckUtils]: 59: Hoare triple {163868#(<= ~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)); {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {163868#(<= ~counter~0 6)} ~cond := #in~cond; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,221 INFO L290 TraceCheckUtils]: 61: Hoare triple {163868#(<= ~counter~0 6)} assume !(0 == ~cond); {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {163868#(<= ~counter~0 6)} assume true; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,222 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163868#(<= ~counter~0 6)} {163868#(<= ~counter~0 6)} #96#return; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {163868#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163868#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:32,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {163868#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {163893#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,224 INFO L272 TraceCheckUtils]: 67: Hoare triple {163893#(<= ~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)); {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {163893#(<= ~counter~0 7)} ~cond := #in~cond; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {163893#(<= ~counter~0 7)} assume !(0 == ~cond); {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {163893#(<= ~counter~0 7)} assume true; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,226 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163893#(<= ~counter~0 7)} {163893#(<= ~counter~0 7)} #96#return; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {163893#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {163893#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:32,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {163893#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {163918#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,228 INFO L272 TraceCheckUtils]: 75: Hoare triple {163918#(<= ~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)); {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {163918#(<= ~counter~0 8)} ~cond := #in~cond; {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {163918#(<= ~counter~0 8)} assume !(0 == ~cond); {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {163918#(<= ~counter~0 8)} assume true; {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,229 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163918#(<= ~counter~0 8)} {163918#(<= ~counter~0 8)} #96#return; {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,229 INFO L290 TraceCheckUtils]: 80: Hoare triple {163918#(<= ~counter~0 8)} assume !(~r~0 > 0); {163918#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:32,230 INFO L290 TraceCheckUtils]: 81: Hoare triple {163918#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,231 INFO L290 TraceCheckUtils]: 82: Hoare triple {163943#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,231 INFO L272 TraceCheckUtils]: 83: Hoare triple {163943#(<= ~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)); {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,231 INFO L290 TraceCheckUtils]: 84: Hoare triple {163943#(<= ~counter~0 9)} ~cond := #in~cond; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,232 INFO L290 TraceCheckUtils]: 85: Hoare triple {163943#(<= ~counter~0 9)} assume !(0 == ~cond); {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,232 INFO L290 TraceCheckUtils]: 86: Hoare triple {163943#(<= ~counter~0 9)} assume true; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,232 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163943#(<= ~counter~0 9)} {163943#(<= ~counter~0 9)} #98#return; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,233 INFO L290 TraceCheckUtils]: 88: Hoare triple {163943#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {163943#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:32,234 INFO L290 TraceCheckUtils]: 89: Hoare triple {163943#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,234 INFO L290 TraceCheckUtils]: 90: Hoare triple {163968#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,235 INFO L272 TraceCheckUtils]: 91: Hoare triple {163968#(<= ~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)); {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {163968#(<= ~counter~0 10)} ~cond := #in~cond; {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {163968#(<= ~counter~0 10)} assume !(0 == ~cond); {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,235 INFO L290 TraceCheckUtils]: 94: Hoare triple {163968#(<= ~counter~0 10)} assume true; {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,236 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163968#(<= ~counter~0 10)} {163968#(<= ~counter~0 10)} #98#return; {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,236 INFO L290 TraceCheckUtils]: 96: Hoare triple {163968#(<= ~counter~0 10)} assume !(~r~0 < 0); {163968#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:32,237 INFO L290 TraceCheckUtils]: 97: Hoare triple {163968#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,238 INFO L290 TraceCheckUtils]: 98: Hoare triple {163993#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,238 INFO L272 TraceCheckUtils]: 99: Hoare triple {163993#(<= ~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)); {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,238 INFO L290 TraceCheckUtils]: 100: Hoare triple {163993#(<= ~counter~0 11)} ~cond := #in~cond; {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,239 INFO L290 TraceCheckUtils]: 101: Hoare triple {163993#(<= ~counter~0 11)} assume !(0 == ~cond); {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,239 INFO L290 TraceCheckUtils]: 102: Hoare triple {163993#(<= ~counter~0 11)} assume true; {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,239 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163993#(<= ~counter~0 11)} {163993#(<= ~counter~0 11)} #94#return; {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,240 INFO L290 TraceCheckUtils]: 104: Hoare triple {163993#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163993#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:32,241 INFO L290 TraceCheckUtils]: 105: Hoare triple {163993#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,241 INFO L290 TraceCheckUtils]: 106: Hoare triple {164018#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,242 INFO L272 TraceCheckUtils]: 107: Hoare triple {164018#(<= ~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)); {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,242 INFO L290 TraceCheckUtils]: 108: Hoare triple {164018#(<= ~counter~0 12)} ~cond := #in~cond; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,242 INFO L290 TraceCheckUtils]: 109: Hoare triple {164018#(<= ~counter~0 12)} assume !(0 == ~cond); {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,242 INFO L290 TraceCheckUtils]: 110: Hoare triple {164018#(<= ~counter~0 12)} assume true; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,243 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {164018#(<= ~counter~0 12)} {164018#(<= ~counter~0 12)} #96#return; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,243 INFO L290 TraceCheckUtils]: 112: Hoare triple {164018#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164018#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:32,244 INFO L290 TraceCheckUtils]: 113: Hoare triple {164018#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,245 INFO L290 TraceCheckUtils]: 114: Hoare triple {164043#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,245 INFO L272 TraceCheckUtils]: 115: Hoare triple {164043#(<= ~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)); {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,245 INFO L290 TraceCheckUtils]: 116: Hoare triple {164043#(<= ~counter~0 13)} ~cond := #in~cond; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,246 INFO L290 TraceCheckUtils]: 117: Hoare triple {164043#(<= ~counter~0 13)} assume !(0 == ~cond); {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,246 INFO L290 TraceCheckUtils]: 118: Hoare triple {164043#(<= ~counter~0 13)} assume true; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,246 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {164043#(<= ~counter~0 13)} {164043#(<= ~counter~0 13)} #96#return; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,247 INFO L290 TraceCheckUtils]: 120: Hoare triple {164043#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164043#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:32,248 INFO L290 TraceCheckUtils]: 121: Hoare triple {164043#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,248 INFO L290 TraceCheckUtils]: 122: Hoare triple {164068#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,249 INFO L272 TraceCheckUtils]: 123: Hoare triple {164068#(<= ~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)); {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,249 INFO L290 TraceCheckUtils]: 124: Hoare triple {164068#(<= ~counter~0 14)} ~cond := #in~cond; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,249 INFO L290 TraceCheckUtils]: 125: Hoare triple {164068#(<= ~counter~0 14)} assume !(0 == ~cond); {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,249 INFO L290 TraceCheckUtils]: 126: Hoare triple {164068#(<= ~counter~0 14)} assume true; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,250 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {164068#(<= ~counter~0 14)} {164068#(<= ~counter~0 14)} #96#return; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,250 INFO L290 TraceCheckUtils]: 128: Hoare triple {164068#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164068#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:32,251 INFO L290 TraceCheckUtils]: 129: Hoare triple {164068#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,252 INFO L290 TraceCheckUtils]: 130: Hoare triple {164093#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,252 INFO L272 TraceCheckUtils]: 131: Hoare triple {164093#(<= ~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)); {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,252 INFO L290 TraceCheckUtils]: 132: Hoare triple {164093#(<= ~counter~0 15)} ~cond := #in~cond; {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,253 INFO L290 TraceCheckUtils]: 133: Hoare triple {164093#(<= ~counter~0 15)} assume !(0 == ~cond); {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,253 INFO L290 TraceCheckUtils]: 134: Hoare triple {164093#(<= ~counter~0 15)} assume true; {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,253 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {164093#(<= ~counter~0 15)} {164093#(<= ~counter~0 15)} #96#return; {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,254 INFO L290 TraceCheckUtils]: 136: Hoare triple {164093#(<= ~counter~0 15)} assume !(~r~0 > 0); {164093#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:32,255 INFO L290 TraceCheckUtils]: 137: Hoare triple {164093#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,255 INFO L290 TraceCheckUtils]: 138: Hoare triple {164118#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,256 INFO L272 TraceCheckUtils]: 139: Hoare triple {164118#(<= ~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)); {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,256 INFO L290 TraceCheckUtils]: 140: Hoare triple {164118#(<= ~counter~0 16)} ~cond := #in~cond; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,256 INFO L290 TraceCheckUtils]: 141: Hoare triple {164118#(<= ~counter~0 16)} assume !(0 == ~cond); {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,256 INFO L290 TraceCheckUtils]: 142: Hoare triple {164118#(<= ~counter~0 16)} assume true; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,257 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {164118#(<= ~counter~0 16)} {164118#(<= ~counter~0 16)} #98#return; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,257 INFO L290 TraceCheckUtils]: 144: Hoare triple {164118#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164118#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:32,258 INFO L290 TraceCheckUtils]: 145: Hoare triple {164118#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,259 INFO L290 TraceCheckUtils]: 146: Hoare triple {164143#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,259 INFO L272 TraceCheckUtils]: 147: Hoare triple {164143#(<= ~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)); {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,259 INFO L290 TraceCheckUtils]: 148: Hoare triple {164143#(<= ~counter~0 17)} ~cond := #in~cond; {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,260 INFO L290 TraceCheckUtils]: 149: Hoare triple {164143#(<= ~counter~0 17)} assume !(0 == ~cond); {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,260 INFO L290 TraceCheckUtils]: 150: Hoare triple {164143#(<= ~counter~0 17)} assume true; {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,260 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {164143#(<= ~counter~0 17)} {164143#(<= ~counter~0 17)} #98#return; {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,261 INFO L290 TraceCheckUtils]: 152: Hoare triple {164143#(<= ~counter~0 17)} assume !(~r~0 < 0); {164143#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:32,261 INFO L290 TraceCheckUtils]: 153: Hoare triple {164143#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164168#(<= |main_#t~post6| 17)} is VALID [2022-04-08 06:10:32,261 INFO L290 TraceCheckUtils]: 154: Hoare triple {164168#(<= |main_#t~post6| 17)} assume !(#t~post6 < 100);havoc #t~post6; {163687#false} is VALID [2022-04-08 06:10:32,261 INFO L272 TraceCheckUtils]: 155: Hoare triple {163687#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163687#false} is VALID [2022-04-08 06:10:32,261 INFO L290 TraceCheckUtils]: 156: Hoare triple {163687#false} ~cond := #in~cond; {163687#false} is VALID [2022-04-08 06:10:32,261 INFO L290 TraceCheckUtils]: 157: Hoare triple {163687#false} assume 0 == ~cond; {163687#false} is VALID [2022-04-08 06:10:32,262 INFO L290 TraceCheckUtils]: 158: Hoare triple {163687#false} assume !false; {163687#false} is VALID [2022-04-08 06:10:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 734 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:10:32,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:33,285 INFO L290 TraceCheckUtils]: 158: Hoare triple {163687#false} assume !false; {163687#false} is VALID [2022-04-08 06:10:33,285 INFO L290 TraceCheckUtils]: 157: Hoare triple {163687#false} assume 0 == ~cond; {163687#false} is VALID [2022-04-08 06:10:33,285 INFO L290 TraceCheckUtils]: 156: Hoare triple {163687#false} ~cond := #in~cond; {163687#false} is VALID [2022-04-08 06:10:33,285 INFO L272 TraceCheckUtils]: 155: Hoare triple {163687#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {163687#false} is VALID [2022-04-08 06:10:33,286 INFO L290 TraceCheckUtils]: 154: Hoare triple {164196#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {163687#false} is VALID [2022-04-08 06:10:33,286 INFO L290 TraceCheckUtils]: 153: Hoare triple {164200#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164196#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:10:33,286 INFO L290 TraceCheckUtils]: 152: Hoare triple {164200#(< ~counter~0 100)} assume !(~r~0 < 0); {164200#(< ~counter~0 100)} is VALID [2022-04-08 06:10:33,287 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163686#true} {164200#(< ~counter~0 100)} #98#return; {164200#(< ~counter~0 100)} is VALID [2022-04-08 06:10:33,287 INFO L290 TraceCheckUtils]: 150: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,287 INFO L290 TraceCheckUtils]: 149: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,287 INFO L290 TraceCheckUtils]: 148: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,287 INFO L272 TraceCheckUtils]: 147: Hoare triple {164200#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,287 INFO L290 TraceCheckUtils]: 146: Hoare triple {164200#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {164200#(< ~counter~0 100)} is VALID [2022-04-08 06:10:33,290 INFO L290 TraceCheckUtils]: 145: Hoare triple {164225#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164200#(< ~counter~0 100)} is VALID [2022-04-08 06:10:33,290 INFO L290 TraceCheckUtils]: 144: Hoare triple {164225#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164225#(< ~counter~0 99)} is VALID [2022-04-08 06:10:33,291 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163686#true} {164225#(< ~counter~0 99)} #98#return; {164225#(< ~counter~0 99)} is VALID [2022-04-08 06:10:33,291 INFO L290 TraceCheckUtils]: 142: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,291 INFO L290 TraceCheckUtils]: 141: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,291 INFO L290 TraceCheckUtils]: 140: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,291 INFO L272 TraceCheckUtils]: 139: Hoare triple {164225#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,291 INFO L290 TraceCheckUtils]: 138: Hoare triple {164225#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {164225#(< ~counter~0 99)} is VALID [2022-04-08 06:10:33,292 INFO L290 TraceCheckUtils]: 137: Hoare triple {164250#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164225#(< ~counter~0 99)} is VALID [2022-04-08 06:10:33,293 INFO L290 TraceCheckUtils]: 136: Hoare triple {164250#(< ~counter~0 98)} assume !(~r~0 > 0); {164250#(< ~counter~0 98)} is VALID [2022-04-08 06:10:33,293 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163686#true} {164250#(< ~counter~0 98)} #96#return; {164250#(< ~counter~0 98)} is VALID [2022-04-08 06:10:33,293 INFO L290 TraceCheckUtils]: 134: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,293 INFO L290 TraceCheckUtils]: 133: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,293 INFO L290 TraceCheckUtils]: 132: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,293 INFO L272 TraceCheckUtils]: 131: Hoare triple {164250#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,294 INFO L290 TraceCheckUtils]: 130: Hoare triple {164250#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {164250#(< ~counter~0 98)} is VALID [2022-04-08 06:10:33,295 INFO L290 TraceCheckUtils]: 129: Hoare triple {164275#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164250#(< ~counter~0 98)} is VALID [2022-04-08 06:10:33,295 INFO L290 TraceCheckUtils]: 128: Hoare triple {164275#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164275#(< ~counter~0 97)} is VALID [2022-04-08 06:10:33,296 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163686#true} {164275#(< ~counter~0 97)} #96#return; {164275#(< ~counter~0 97)} is VALID [2022-04-08 06:10:33,296 INFO L290 TraceCheckUtils]: 126: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,296 INFO L290 TraceCheckUtils]: 125: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,296 INFO L290 TraceCheckUtils]: 124: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,296 INFO L272 TraceCheckUtils]: 123: Hoare triple {164275#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,296 INFO L290 TraceCheckUtils]: 122: Hoare triple {164275#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {164275#(< ~counter~0 97)} is VALID [2022-04-08 06:10:33,297 INFO L290 TraceCheckUtils]: 121: Hoare triple {164300#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164275#(< ~counter~0 97)} is VALID [2022-04-08 06:10:33,298 INFO L290 TraceCheckUtils]: 120: Hoare triple {164300#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164300#(< ~counter~0 96)} is VALID [2022-04-08 06:10:33,298 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163686#true} {164300#(< ~counter~0 96)} #96#return; {164300#(< ~counter~0 96)} is VALID [2022-04-08 06:10:33,298 INFO L290 TraceCheckUtils]: 118: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,298 INFO L290 TraceCheckUtils]: 117: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,298 INFO L290 TraceCheckUtils]: 116: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,298 INFO L272 TraceCheckUtils]: 115: Hoare triple {164300#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,299 INFO L290 TraceCheckUtils]: 114: Hoare triple {164300#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {164300#(< ~counter~0 96)} is VALID [2022-04-08 06:10:33,300 INFO L290 TraceCheckUtils]: 113: Hoare triple {164325#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164300#(< ~counter~0 96)} is VALID [2022-04-08 06:10:33,300 INFO L290 TraceCheckUtils]: 112: Hoare triple {164325#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164325#(< ~counter~0 95)} is VALID [2022-04-08 06:10:33,301 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163686#true} {164325#(< ~counter~0 95)} #96#return; {164325#(< ~counter~0 95)} is VALID [2022-04-08 06:10:33,301 INFO L290 TraceCheckUtils]: 110: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,301 INFO L290 TraceCheckUtils]: 109: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,301 INFO L272 TraceCheckUtils]: 107: Hoare triple {164325#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,301 INFO L290 TraceCheckUtils]: 106: Hoare triple {164325#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {164325#(< ~counter~0 95)} is VALID [2022-04-08 06:10:33,302 INFO L290 TraceCheckUtils]: 105: Hoare triple {164350#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164325#(< ~counter~0 95)} is VALID [2022-04-08 06:10:33,303 INFO L290 TraceCheckUtils]: 104: Hoare triple {164350#(< ~counter~0 94)} assume !!(0 != ~r~0); {164350#(< ~counter~0 94)} is VALID [2022-04-08 06:10:33,303 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163686#true} {164350#(< ~counter~0 94)} #94#return; {164350#(< ~counter~0 94)} is VALID [2022-04-08 06:10:33,303 INFO L290 TraceCheckUtils]: 102: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,303 INFO L290 TraceCheckUtils]: 101: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,303 INFO L290 TraceCheckUtils]: 100: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,303 INFO L272 TraceCheckUtils]: 99: Hoare triple {164350#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {164350#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {164350#(< ~counter~0 94)} is VALID [2022-04-08 06:10:33,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {164375#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164350#(< ~counter~0 94)} is VALID [2022-04-08 06:10:33,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {164375#(< ~counter~0 93)} assume !(~r~0 < 0); {164375#(< ~counter~0 93)} is VALID [2022-04-08 06:10:33,305 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163686#true} {164375#(< ~counter~0 93)} #98#return; {164375#(< ~counter~0 93)} is VALID [2022-04-08 06:10:33,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,306 INFO L272 TraceCheckUtils]: 91: Hoare triple {164375#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {164375#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {164375#(< ~counter~0 93)} is VALID [2022-04-08 06:10:33,307 INFO L290 TraceCheckUtils]: 89: Hoare triple {164400#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164375#(< ~counter~0 93)} is VALID [2022-04-08 06:10:33,307 INFO L290 TraceCheckUtils]: 88: Hoare triple {164400#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164400#(< ~counter~0 92)} is VALID [2022-04-08 06:10:33,308 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163686#true} {164400#(< ~counter~0 92)} #98#return; {164400#(< ~counter~0 92)} is VALID [2022-04-08 06:10:33,308 INFO L290 TraceCheckUtils]: 86: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,308 INFO L290 TraceCheckUtils]: 85: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,308 INFO L272 TraceCheckUtils]: 83: Hoare triple {164400#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,308 INFO L290 TraceCheckUtils]: 82: Hoare triple {164400#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {164400#(< ~counter~0 92)} is VALID [2022-04-08 06:10:33,310 INFO L290 TraceCheckUtils]: 81: Hoare triple {164425#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164400#(< ~counter~0 92)} is VALID [2022-04-08 06:10:33,310 INFO L290 TraceCheckUtils]: 80: Hoare triple {164425#(< ~counter~0 91)} assume !(~r~0 > 0); {164425#(< ~counter~0 91)} is VALID [2022-04-08 06:10:33,310 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163686#true} {164425#(< ~counter~0 91)} #96#return; {164425#(< ~counter~0 91)} is VALID [2022-04-08 06:10:33,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,310 INFO L290 TraceCheckUtils]: 77: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,310 INFO L290 TraceCheckUtils]: 76: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,310 INFO L272 TraceCheckUtils]: 75: Hoare triple {164425#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {164425#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {164425#(< ~counter~0 91)} is VALID [2022-04-08 06:10:33,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {164450#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164425#(< ~counter~0 91)} is VALID [2022-04-08 06:10:33,312 INFO L290 TraceCheckUtils]: 72: Hoare triple {164450#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164450#(< ~counter~0 90)} is VALID [2022-04-08 06:10:33,313 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163686#true} {164450#(< ~counter~0 90)} #96#return; {164450#(< ~counter~0 90)} is VALID [2022-04-08 06:10:33,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,313 INFO L272 TraceCheckUtils]: 67: Hoare triple {164450#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {164450#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {164450#(< ~counter~0 90)} is VALID [2022-04-08 06:10:33,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {164475#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164450#(< ~counter~0 90)} is VALID [2022-04-08 06:10:33,315 INFO L290 TraceCheckUtils]: 64: Hoare triple {164475#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164475#(< ~counter~0 89)} is VALID [2022-04-08 06:10:33,315 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163686#true} {164475#(< ~counter~0 89)} #96#return; {164475#(< ~counter~0 89)} is VALID [2022-04-08 06:10:33,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,315 INFO L290 TraceCheckUtils]: 61: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,315 INFO L272 TraceCheckUtils]: 59: Hoare triple {164475#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,316 INFO L290 TraceCheckUtils]: 58: Hoare triple {164475#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {164475#(< ~counter~0 89)} is VALID [2022-04-08 06:10:33,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {164500#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164475#(< ~counter~0 89)} is VALID [2022-04-08 06:10:33,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {164500#(< ~counter~0 88)} assume !!(0 != ~r~0); {164500#(< ~counter~0 88)} is VALID [2022-04-08 06:10:33,318 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163686#true} {164500#(< ~counter~0 88)} #94#return; {164500#(< ~counter~0 88)} is VALID [2022-04-08 06:10:33,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,318 INFO L272 TraceCheckUtils]: 51: Hoare triple {164500#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {164500#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {164500#(< ~counter~0 88)} is VALID [2022-04-08 06:10:33,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {164525#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164500#(< ~counter~0 88)} is VALID [2022-04-08 06:10:33,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {164525#(< ~counter~0 87)} assume !(~r~0 < 0); {164525#(< ~counter~0 87)} is VALID [2022-04-08 06:10:33,320 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163686#true} {164525#(< ~counter~0 87)} #98#return; {164525#(< ~counter~0 87)} is VALID [2022-04-08 06:10:33,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,320 INFO L272 TraceCheckUtils]: 43: Hoare triple {164525#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {164525#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {164525#(< ~counter~0 87)} is VALID [2022-04-08 06:10:33,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {164550#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164525#(< ~counter~0 87)} is VALID [2022-04-08 06:10:33,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {164550#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164550#(< ~counter~0 86)} is VALID [2022-04-08 06:10:33,322 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163686#true} {164550#(< ~counter~0 86)} #98#return; {164550#(< ~counter~0 86)} is VALID [2022-04-08 06:10:33,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,323 INFO L272 TraceCheckUtils]: 35: Hoare triple {164550#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {164550#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {164550#(< ~counter~0 86)} is VALID [2022-04-08 06:10:33,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {164575#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164550#(< ~counter~0 86)} is VALID [2022-04-08 06:10:33,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {164575#(< ~counter~0 85)} assume !(~r~0 > 0); {164575#(< ~counter~0 85)} is VALID [2022-04-08 06:10:33,325 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163686#true} {164575#(< ~counter~0 85)} #96#return; {164575#(< ~counter~0 85)} is VALID [2022-04-08 06:10:33,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {164575#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {164575#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {164575#(< ~counter~0 85)} is VALID [2022-04-08 06:10:33,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {164600#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164575#(< ~counter~0 85)} is VALID [2022-04-08 06:10:33,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {164600#(< ~counter~0 84)} assume !!(0 != ~r~0); {164600#(< ~counter~0 84)} is VALID [2022-04-08 06:10:33,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163686#true} {164600#(< ~counter~0 84)} #94#return; {164600#(< ~counter~0 84)} is VALID [2022-04-08 06:10:33,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,328 INFO L272 TraceCheckUtils]: 19: Hoare triple {164600#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {164600#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {164600#(< ~counter~0 84)} is VALID [2022-04-08 06:10:33,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {164625#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164600#(< ~counter~0 84)} is VALID [2022-04-08 06:10:33,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {164625#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,330 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163686#true} {164625#(< ~counter~0 83)} #92#return; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L272 TraceCheckUtils]: 11: Hoare triple {164625#(< ~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)); {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163686#true} {164625#(< ~counter~0 83)} #90#return; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-08 06:10:33,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {164625#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163686#true} is VALID [2022-04-08 06:10:33,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {164625#(< ~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; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {164625#(< ~counter~0 83)} call #t~ret9 := main(); {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164625#(< ~counter~0 83)} {163686#true} #102#return; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {164625#(< ~counter~0 83)} assume true; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {163686#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {164625#(< ~counter~0 83)} is VALID [2022-04-08 06:10:33,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {163686#true} call ULTIMATE.init(); {163686#true} is VALID [2022-04-08 06:10:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 190 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 06:10:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367061422] [2022-04-08 06:10:33,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779515021] [2022-04-08 06:10:33,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779515021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:33,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:33,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:10:33,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281056525] [2022-04-08 06:10:33,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281056525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:33,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:33,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:10:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860640285] [2022-04-08 06:10:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-08 06:10:33,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:33,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:33,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:33,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:10:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:10:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:10:33,518 INFO L87 Difference]: Start difference. First operand 851 states and 1131 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:39,197 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-08 06:10:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 06:10:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 159 [2022-04-08 06:10:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 06:10:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-08 06:10:39,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-08 06:10:39,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:39,651 INFO L225 Difference]: With dead ends: 902 [2022-04-08 06:10:39,651 INFO L226 Difference]: Without dead ends: 897 [2022-04-08 06:10:39,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1215, Invalid=1647, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 06:10:39,651 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 280 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:39,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 383 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 06:10:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-08 06:10:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-08 06:10:42,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:42,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:10:42,612 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:10:42,613 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:10:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:42,640 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 06:10:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 06:10:42,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:42,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:42,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 06:10:42,642 INFO L87 Difference]: Start difference. First operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 897 states. [2022-04-08 06:10:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:42,670 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-08 06:10:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-08 06:10:42,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:42,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:42,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:42,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 651 states have (on average 1.1781874039938556) internal successors, (767), 668 states have internal predecessors, (767), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:10:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-08 06:10:42,722 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-08 06:10:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:42,722 INFO L478 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-08 06:10:42,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:42,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-08 06:10:52,037 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-08 06:10:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-08 06:10:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 06:10:52,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:52,039 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:10:52,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-04-08 06:10:52,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:52,239 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-08 06:10:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:52,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [696739027] [2022-04-08 06:10:52,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:52,240 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-08 06:10:52,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:52,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199056698] [2022-04-08 06:10:52,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:52,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:52,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259991836] [2022-04-08 06:10:52,260 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:10:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:52,260 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:10:52,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 06:10:53,274 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 06:10:53,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:53,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:10:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:53,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:54,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {170055#true} call ULTIMATE.init(); {170055#true} is VALID [2022-04-08 06:10:54,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {170055#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170063#(<= ~counter~0 0)} {170055#true} #102#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {170063#(<= ~counter~0 0)} call #t~ret9 := main(); {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {170063#(<= ~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; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,121 INFO L272 TraceCheckUtils]: 6: Hoare triple {170063#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {170063#(<= ~counter~0 0)} ~cond := #in~cond; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {170063#(<= ~counter~0 0)} assume !(0 == ~cond); {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,121 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170063#(<= ~counter~0 0)} {170063#(<= ~counter~0 0)} #90#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,122 INFO L272 TraceCheckUtils]: 11: Hoare triple {170063#(<= ~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)); {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {170063#(<= ~counter~0 0)} ~cond := #in~cond; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {170063#(<= ~counter~0 0)} assume !(0 == ~cond); {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,122 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {170063#(<= ~counter~0 0)} {170063#(<= ~counter~0 0)} #92#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {170063#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {170063#(<= ~counter~0 0)} is VALID [2022-04-08 06:10:54,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {170063#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {170112#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,127 INFO L272 TraceCheckUtils]: 19: Hoare triple {170112#(<= ~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)); {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {170112#(<= ~counter~0 1)} ~cond := #in~cond; {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {170112#(<= ~counter~0 1)} assume !(0 == ~cond); {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {170112#(<= ~counter~0 1)} assume true; {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,127 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {170112#(<= ~counter~0 1)} {170112#(<= ~counter~0 1)} #94#return; {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {170112#(<= ~counter~0 1)} assume !!(0 != ~r~0); {170112#(<= ~counter~0 1)} is VALID [2022-04-08 06:10:54,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {170112#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {170137#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,129 INFO L272 TraceCheckUtils]: 27: Hoare triple {170137#(<= ~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)); {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {170137#(<= ~counter~0 2)} ~cond := #in~cond; {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {170137#(<= ~counter~0 2)} assume !(0 == ~cond); {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {170137#(<= ~counter~0 2)} assume true; {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,130 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {170137#(<= ~counter~0 2)} {170137#(<= ~counter~0 2)} #96#return; {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {170137#(<= ~counter~0 2)} assume !(~r~0 > 0); {170137#(<= ~counter~0 2)} is VALID [2022-04-08 06:10:54,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {170137#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {170162#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,132 INFO L272 TraceCheckUtils]: 35: Hoare triple {170162#(<= ~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)); {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {170162#(<= ~counter~0 3)} ~cond := #in~cond; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {170162#(<= ~counter~0 3)} assume !(0 == ~cond); {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {170162#(<= ~counter~0 3)} assume true; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,133 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {170162#(<= ~counter~0 3)} {170162#(<= ~counter~0 3)} #98#return; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {170162#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170162#(<= ~counter~0 3)} is VALID [2022-04-08 06:10:54,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {170162#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,134 INFO L290 TraceCheckUtils]: 42: Hoare triple {170187#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,135 INFO L272 TraceCheckUtils]: 43: Hoare triple {170187#(<= ~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)); {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {170187#(<= ~counter~0 4)} ~cond := #in~cond; {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {170187#(<= ~counter~0 4)} assume !(0 == ~cond); {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {170187#(<= ~counter~0 4)} assume true; {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,136 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {170187#(<= ~counter~0 4)} {170187#(<= ~counter~0 4)} #98#return; {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {170187#(<= ~counter~0 4)} assume !(~r~0 < 0); {170187#(<= ~counter~0 4)} is VALID [2022-04-08 06:10:54,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {170187#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {170212#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,138 INFO L272 TraceCheckUtils]: 51: Hoare triple {170212#(<= ~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)); {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {170212#(<= ~counter~0 5)} ~cond := #in~cond; {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {170212#(<= ~counter~0 5)} assume !(0 == ~cond); {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {170212#(<= ~counter~0 5)} assume true; {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,139 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {170212#(<= ~counter~0 5)} {170212#(<= ~counter~0 5)} #94#return; {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {170212#(<= ~counter~0 5)} assume !!(0 != ~r~0); {170212#(<= ~counter~0 5)} is VALID [2022-04-08 06:10:54,140 INFO L290 TraceCheckUtils]: 57: Hoare triple {170212#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {170237#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,141 INFO L272 TraceCheckUtils]: 59: Hoare triple {170237#(<= ~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)); {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {170237#(<= ~counter~0 6)} ~cond := #in~cond; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,141 INFO L290 TraceCheckUtils]: 61: Hoare triple {170237#(<= ~counter~0 6)} assume !(0 == ~cond); {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {170237#(<= ~counter~0 6)} assume true; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,142 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {170237#(<= ~counter~0 6)} {170237#(<= ~counter~0 6)} #96#return; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,142 INFO L290 TraceCheckUtils]: 64: Hoare triple {170237#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170237#(<= ~counter~0 6)} is VALID [2022-04-08 06:10:54,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {170237#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,143 INFO L290 TraceCheckUtils]: 66: Hoare triple {170262#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,144 INFO L272 TraceCheckUtils]: 67: Hoare triple {170262#(<= ~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)); {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,144 INFO L290 TraceCheckUtils]: 68: Hoare triple {170262#(<= ~counter~0 7)} ~cond := #in~cond; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,144 INFO L290 TraceCheckUtils]: 69: Hoare triple {170262#(<= ~counter~0 7)} assume !(0 == ~cond); {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {170262#(<= ~counter~0 7)} assume true; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,145 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {170262#(<= ~counter~0 7)} {170262#(<= ~counter~0 7)} #96#return; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {170262#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170262#(<= ~counter~0 7)} is VALID [2022-04-08 06:10:54,146 INFO L290 TraceCheckUtils]: 73: Hoare triple {170262#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,146 INFO L290 TraceCheckUtils]: 74: Hoare triple {170287#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,147 INFO L272 TraceCheckUtils]: 75: Hoare triple {170287#(<= ~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)); {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,147 INFO L290 TraceCheckUtils]: 76: Hoare triple {170287#(<= ~counter~0 8)} ~cond := #in~cond; {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,147 INFO L290 TraceCheckUtils]: 77: Hoare triple {170287#(<= ~counter~0 8)} assume !(0 == ~cond); {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {170287#(<= ~counter~0 8)} assume true; {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,148 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {170287#(<= ~counter~0 8)} {170287#(<= ~counter~0 8)} #96#return; {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,148 INFO L290 TraceCheckUtils]: 80: Hoare triple {170287#(<= ~counter~0 8)} assume !(~r~0 > 0); {170287#(<= ~counter~0 8)} is VALID [2022-04-08 06:10:54,149 INFO L290 TraceCheckUtils]: 81: Hoare triple {170287#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,149 INFO L290 TraceCheckUtils]: 82: Hoare triple {170312#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,150 INFO L272 TraceCheckUtils]: 83: Hoare triple {170312#(<= ~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)); {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,150 INFO L290 TraceCheckUtils]: 84: Hoare triple {170312#(<= ~counter~0 9)} ~cond := #in~cond; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,150 INFO L290 TraceCheckUtils]: 85: Hoare triple {170312#(<= ~counter~0 9)} assume !(0 == ~cond); {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,150 INFO L290 TraceCheckUtils]: 86: Hoare triple {170312#(<= ~counter~0 9)} assume true; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,151 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {170312#(<= ~counter~0 9)} {170312#(<= ~counter~0 9)} #98#return; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,151 INFO L290 TraceCheckUtils]: 88: Hoare triple {170312#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170312#(<= ~counter~0 9)} is VALID [2022-04-08 06:10:54,152 INFO L290 TraceCheckUtils]: 89: Hoare triple {170312#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,152 INFO L290 TraceCheckUtils]: 90: Hoare triple {170337#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,153 INFO L272 TraceCheckUtils]: 91: Hoare triple {170337#(<= ~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)); {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,153 INFO L290 TraceCheckUtils]: 92: Hoare triple {170337#(<= ~counter~0 10)} ~cond := #in~cond; {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,153 INFO L290 TraceCheckUtils]: 93: Hoare triple {170337#(<= ~counter~0 10)} assume !(0 == ~cond); {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,153 INFO L290 TraceCheckUtils]: 94: Hoare triple {170337#(<= ~counter~0 10)} assume true; {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,153 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {170337#(<= ~counter~0 10)} {170337#(<= ~counter~0 10)} #98#return; {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,154 INFO L290 TraceCheckUtils]: 96: Hoare triple {170337#(<= ~counter~0 10)} assume !(~r~0 < 0); {170337#(<= ~counter~0 10)} is VALID [2022-04-08 06:10:54,155 INFO L290 TraceCheckUtils]: 97: Hoare triple {170337#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,155 INFO L290 TraceCheckUtils]: 98: Hoare triple {170362#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,155 INFO L272 TraceCheckUtils]: 99: Hoare triple {170362#(<= ~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)); {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,155 INFO L290 TraceCheckUtils]: 100: Hoare triple {170362#(<= ~counter~0 11)} ~cond := #in~cond; {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,156 INFO L290 TraceCheckUtils]: 101: Hoare triple {170362#(<= ~counter~0 11)} assume !(0 == ~cond); {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,156 INFO L290 TraceCheckUtils]: 102: Hoare triple {170362#(<= ~counter~0 11)} assume true; {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,156 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {170362#(<= ~counter~0 11)} {170362#(<= ~counter~0 11)} #94#return; {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,156 INFO L290 TraceCheckUtils]: 104: Hoare triple {170362#(<= ~counter~0 11)} assume !!(0 != ~r~0); {170362#(<= ~counter~0 11)} is VALID [2022-04-08 06:10:54,157 INFO L290 TraceCheckUtils]: 105: Hoare triple {170362#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,158 INFO L290 TraceCheckUtils]: 106: Hoare triple {170387#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,158 INFO L272 TraceCheckUtils]: 107: Hoare triple {170387#(<= ~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)); {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {170387#(<= ~counter~0 12)} ~cond := #in~cond; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {170387#(<= ~counter~0 12)} assume !(0 == ~cond); {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,158 INFO L290 TraceCheckUtils]: 110: Hoare triple {170387#(<= ~counter~0 12)} assume true; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,159 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {170387#(<= ~counter~0 12)} {170387#(<= ~counter~0 12)} #96#return; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,159 INFO L290 TraceCheckUtils]: 112: Hoare triple {170387#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170387#(<= ~counter~0 12)} is VALID [2022-04-08 06:10:54,160 INFO L290 TraceCheckUtils]: 113: Hoare triple {170387#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,160 INFO L290 TraceCheckUtils]: 114: Hoare triple {170412#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,160 INFO L272 TraceCheckUtils]: 115: Hoare triple {170412#(<= ~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)); {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,161 INFO L290 TraceCheckUtils]: 116: Hoare triple {170412#(<= ~counter~0 13)} ~cond := #in~cond; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,161 INFO L290 TraceCheckUtils]: 117: Hoare triple {170412#(<= ~counter~0 13)} assume !(0 == ~cond); {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,161 INFO L290 TraceCheckUtils]: 118: Hoare triple {170412#(<= ~counter~0 13)} assume true; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,161 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {170412#(<= ~counter~0 13)} {170412#(<= ~counter~0 13)} #96#return; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,161 INFO L290 TraceCheckUtils]: 120: Hoare triple {170412#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170412#(<= ~counter~0 13)} is VALID [2022-04-08 06:10:54,163 INFO L290 TraceCheckUtils]: 121: Hoare triple {170412#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,163 INFO L290 TraceCheckUtils]: 122: Hoare triple {170437#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,163 INFO L272 TraceCheckUtils]: 123: Hoare triple {170437#(<= ~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)); {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,163 INFO L290 TraceCheckUtils]: 124: Hoare triple {170437#(<= ~counter~0 14)} ~cond := #in~cond; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,163 INFO L290 TraceCheckUtils]: 125: Hoare triple {170437#(<= ~counter~0 14)} assume !(0 == ~cond); {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,164 INFO L290 TraceCheckUtils]: 126: Hoare triple {170437#(<= ~counter~0 14)} assume true; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,164 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170437#(<= ~counter~0 14)} {170437#(<= ~counter~0 14)} #96#return; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,164 INFO L290 TraceCheckUtils]: 128: Hoare triple {170437#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170437#(<= ~counter~0 14)} is VALID [2022-04-08 06:10:54,165 INFO L290 TraceCheckUtils]: 129: Hoare triple {170437#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,165 INFO L290 TraceCheckUtils]: 130: Hoare triple {170462#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,166 INFO L272 TraceCheckUtils]: 131: Hoare triple {170462#(<= ~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)); {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,166 INFO L290 TraceCheckUtils]: 132: Hoare triple {170462#(<= ~counter~0 15)} ~cond := #in~cond; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,166 INFO L290 TraceCheckUtils]: 133: Hoare triple {170462#(<= ~counter~0 15)} assume !(0 == ~cond); {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,166 INFO L290 TraceCheckUtils]: 134: Hoare triple {170462#(<= ~counter~0 15)} assume true; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,167 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170462#(<= ~counter~0 15)} {170462#(<= ~counter~0 15)} #96#return; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,167 INFO L290 TraceCheckUtils]: 136: Hoare triple {170462#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170462#(<= ~counter~0 15)} is VALID [2022-04-08 06:10:54,168 INFO L290 TraceCheckUtils]: 137: Hoare triple {170462#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,168 INFO L290 TraceCheckUtils]: 138: Hoare triple {170487#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,168 INFO L272 TraceCheckUtils]: 139: Hoare triple {170487#(<= ~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)); {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,169 INFO L290 TraceCheckUtils]: 140: Hoare triple {170487#(<= ~counter~0 16)} ~cond := #in~cond; {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,169 INFO L290 TraceCheckUtils]: 141: Hoare triple {170487#(<= ~counter~0 16)} assume !(0 == ~cond); {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,169 INFO L290 TraceCheckUtils]: 142: Hoare triple {170487#(<= ~counter~0 16)} assume true; {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,169 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170487#(<= ~counter~0 16)} {170487#(<= ~counter~0 16)} #96#return; {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,169 INFO L290 TraceCheckUtils]: 144: Hoare triple {170487#(<= ~counter~0 16)} assume !(~r~0 > 0); {170487#(<= ~counter~0 16)} is VALID [2022-04-08 06:10:54,171 INFO L290 TraceCheckUtils]: 145: Hoare triple {170487#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,171 INFO L290 TraceCheckUtils]: 146: Hoare triple {170512#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,171 INFO L272 TraceCheckUtils]: 147: Hoare triple {170512#(<= ~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)); {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,171 INFO L290 TraceCheckUtils]: 148: Hoare triple {170512#(<= ~counter~0 17)} ~cond := #in~cond; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,171 INFO L290 TraceCheckUtils]: 149: Hoare triple {170512#(<= ~counter~0 17)} assume !(0 == ~cond); {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,172 INFO L290 TraceCheckUtils]: 150: Hoare triple {170512#(<= ~counter~0 17)} assume true; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,172 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170512#(<= ~counter~0 17)} {170512#(<= ~counter~0 17)} #98#return; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,172 INFO L290 TraceCheckUtils]: 152: Hoare triple {170512#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170512#(<= ~counter~0 17)} is VALID [2022-04-08 06:10:54,172 INFO L290 TraceCheckUtils]: 153: Hoare triple {170512#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170537#(<= |main_#t~post8| 17)} is VALID [2022-04-08 06:10:54,172 INFO L290 TraceCheckUtils]: 154: Hoare triple {170537#(<= |main_#t~post8| 17)} assume !(#t~post8 < 100);havoc #t~post8; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L290 TraceCheckUtils]: 155: Hoare triple {170056#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L290 TraceCheckUtils]: 156: Hoare triple {170056#false} assume !(#t~post6 < 100);havoc #t~post6; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L272 TraceCheckUtils]: 157: Hoare triple {170056#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L290 TraceCheckUtils]: 158: Hoare triple {170056#false} ~cond := #in~cond; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L290 TraceCheckUtils]: 159: Hoare triple {170056#false} assume 0 == ~cond; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L290 TraceCheckUtils]: 160: Hoare triple {170056#false} assume !false; {170056#false} is VALID [2022-04-08 06:10:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 750 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:10:54,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:10:54,901 INFO L290 TraceCheckUtils]: 160: Hoare triple {170056#false} assume !false; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 159: Hoare triple {170056#false} assume 0 == ~cond; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 158: Hoare triple {170056#false} ~cond := #in~cond; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L272 TraceCheckUtils]: 157: Hoare triple {170056#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 156: Hoare triple {170056#false} assume !(#t~post6 < 100);havoc #t~post6; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 155: Hoare triple {170056#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 154: Hoare triple {170577#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {170056#false} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 153: Hoare triple {170581#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170577#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:10:54,902 INFO L290 TraceCheckUtils]: 152: Hoare triple {170581#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170581#(< ~counter~0 100)} is VALID [2022-04-08 06:10:54,903 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170055#true} {170581#(< ~counter~0 100)} #98#return; {170581#(< ~counter~0 100)} is VALID [2022-04-08 06:10:54,903 INFO L290 TraceCheckUtils]: 150: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,903 INFO L290 TraceCheckUtils]: 149: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,903 INFO L290 TraceCheckUtils]: 148: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,903 INFO L272 TraceCheckUtils]: 147: Hoare triple {170581#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,903 INFO L290 TraceCheckUtils]: 146: Hoare triple {170581#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {170581#(< ~counter~0 100)} is VALID [2022-04-08 06:10:54,906 INFO L290 TraceCheckUtils]: 145: Hoare triple {170606#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170581#(< ~counter~0 100)} is VALID [2022-04-08 06:10:54,907 INFO L290 TraceCheckUtils]: 144: Hoare triple {170606#(< ~counter~0 99)} assume !(~r~0 > 0); {170606#(< ~counter~0 99)} is VALID [2022-04-08 06:10:54,907 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170055#true} {170606#(< ~counter~0 99)} #96#return; {170606#(< ~counter~0 99)} is VALID [2022-04-08 06:10:54,907 INFO L290 TraceCheckUtils]: 142: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,907 INFO L290 TraceCheckUtils]: 141: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,907 INFO L290 TraceCheckUtils]: 140: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,907 INFO L272 TraceCheckUtils]: 139: Hoare triple {170606#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,907 INFO L290 TraceCheckUtils]: 138: Hoare triple {170606#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {170606#(< ~counter~0 99)} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 137: Hoare triple {170631#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170606#(< ~counter~0 99)} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 136: Hoare triple {170631#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170631#(< ~counter~0 98)} is VALID [2022-04-08 06:10:54,909 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170055#true} {170631#(< ~counter~0 98)} #96#return; {170631#(< ~counter~0 98)} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 134: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 133: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 132: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,909 INFO L272 TraceCheckUtils]: 131: Hoare triple {170631#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,909 INFO L290 TraceCheckUtils]: 130: Hoare triple {170631#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {170631#(< ~counter~0 98)} is VALID [2022-04-08 06:10:54,911 INFO L290 TraceCheckUtils]: 129: Hoare triple {170656#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170631#(< ~counter~0 98)} is VALID [2022-04-08 06:10:54,911 INFO L290 TraceCheckUtils]: 128: Hoare triple {170656#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170656#(< ~counter~0 97)} is VALID [2022-04-08 06:10:54,911 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170055#true} {170656#(< ~counter~0 97)} #96#return; {170656#(< ~counter~0 97)} is VALID [2022-04-08 06:10:54,911 INFO L290 TraceCheckUtils]: 126: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,911 INFO L290 TraceCheckUtils]: 125: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,911 INFO L290 TraceCheckUtils]: 124: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,911 INFO L272 TraceCheckUtils]: 123: Hoare triple {170656#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,912 INFO L290 TraceCheckUtils]: 122: Hoare triple {170656#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {170656#(< ~counter~0 97)} is VALID [2022-04-08 06:10:54,913 INFO L290 TraceCheckUtils]: 121: Hoare triple {170681#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170656#(< ~counter~0 97)} is VALID [2022-04-08 06:10:54,913 INFO L290 TraceCheckUtils]: 120: Hoare triple {170681#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170681#(< ~counter~0 96)} is VALID [2022-04-08 06:10:54,913 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {170055#true} {170681#(< ~counter~0 96)} #96#return; {170681#(< ~counter~0 96)} is VALID [2022-04-08 06:10:54,913 INFO L290 TraceCheckUtils]: 118: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,914 INFO L290 TraceCheckUtils]: 117: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,914 INFO L290 TraceCheckUtils]: 116: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,914 INFO L272 TraceCheckUtils]: 115: Hoare triple {170681#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,914 INFO L290 TraceCheckUtils]: 114: Hoare triple {170681#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {170681#(< ~counter~0 96)} is VALID [2022-04-08 06:10:54,915 INFO L290 TraceCheckUtils]: 113: Hoare triple {170706#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170681#(< ~counter~0 96)} is VALID [2022-04-08 06:10:54,915 INFO L290 TraceCheckUtils]: 112: Hoare triple {170706#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170706#(< ~counter~0 95)} is VALID [2022-04-08 06:10:54,916 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {170055#true} {170706#(< ~counter~0 95)} #96#return; {170706#(< ~counter~0 95)} is VALID [2022-04-08 06:10:54,916 INFO L290 TraceCheckUtils]: 110: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,916 INFO L290 TraceCheckUtils]: 109: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,916 INFO L290 TraceCheckUtils]: 108: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,916 INFO L272 TraceCheckUtils]: 107: Hoare triple {170706#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,916 INFO L290 TraceCheckUtils]: 106: Hoare triple {170706#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {170706#(< ~counter~0 95)} is VALID [2022-04-08 06:10:54,917 INFO L290 TraceCheckUtils]: 105: Hoare triple {170731#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170706#(< ~counter~0 95)} is VALID [2022-04-08 06:10:54,917 INFO L290 TraceCheckUtils]: 104: Hoare triple {170731#(< ~counter~0 94)} assume !!(0 != ~r~0); {170731#(< ~counter~0 94)} is VALID [2022-04-08 06:10:54,918 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {170055#true} {170731#(< ~counter~0 94)} #94#return; {170731#(< ~counter~0 94)} is VALID [2022-04-08 06:10:54,918 INFO L290 TraceCheckUtils]: 102: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,918 INFO L290 TraceCheckUtils]: 101: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,918 INFO L290 TraceCheckUtils]: 100: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,918 INFO L272 TraceCheckUtils]: 99: Hoare triple {170731#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,918 INFO L290 TraceCheckUtils]: 98: Hoare triple {170731#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {170731#(< ~counter~0 94)} is VALID [2022-04-08 06:10:54,919 INFO L290 TraceCheckUtils]: 97: Hoare triple {170756#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170731#(< ~counter~0 94)} is VALID [2022-04-08 06:10:54,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {170756#(< ~counter~0 93)} assume !(~r~0 < 0); {170756#(< ~counter~0 93)} is VALID [2022-04-08 06:10:54,920 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {170055#true} {170756#(< ~counter~0 93)} #98#return; {170756#(< ~counter~0 93)} is VALID [2022-04-08 06:10:54,920 INFO L290 TraceCheckUtils]: 94: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,920 INFO L272 TraceCheckUtils]: 91: Hoare triple {170756#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {170756#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {170756#(< ~counter~0 93)} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 89: Hoare triple {170781#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170756#(< ~counter~0 93)} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 88: Hoare triple {170781#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170781#(< ~counter~0 92)} is VALID [2022-04-08 06:10:54,922 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {170055#true} {170781#(< ~counter~0 92)} #98#return; {170781#(< ~counter~0 92)} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 86: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 85: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 84: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,922 INFO L272 TraceCheckUtils]: 83: Hoare triple {170781#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,922 INFO L290 TraceCheckUtils]: 82: Hoare triple {170781#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {170781#(< ~counter~0 92)} is VALID [2022-04-08 06:10:54,924 INFO L290 TraceCheckUtils]: 81: Hoare triple {170806#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170781#(< ~counter~0 92)} is VALID [2022-04-08 06:10:54,924 INFO L290 TraceCheckUtils]: 80: Hoare triple {170806#(< ~counter~0 91)} assume !(~r~0 > 0); {170806#(< ~counter~0 91)} is VALID [2022-04-08 06:10:54,924 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {170055#true} {170806#(< ~counter~0 91)} #96#return; {170806#(< ~counter~0 91)} is VALID [2022-04-08 06:10:54,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,925 INFO L272 TraceCheckUtils]: 75: Hoare triple {170806#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,925 INFO L290 TraceCheckUtils]: 74: Hoare triple {170806#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {170806#(< ~counter~0 91)} is VALID [2022-04-08 06:10:54,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {170831#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170806#(< ~counter~0 91)} is VALID [2022-04-08 06:10:54,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {170831#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170831#(< ~counter~0 90)} is VALID [2022-04-08 06:10:54,927 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {170055#true} {170831#(< ~counter~0 90)} #96#return; {170831#(< ~counter~0 90)} is VALID [2022-04-08 06:10:54,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,927 INFO L272 TraceCheckUtils]: 67: Hoare triple {170831#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {170831#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {170831#(< ~counter~0 90)} is VALID [2022-04-08 06:10:54,928 INFO L290 TraceCheckUtils]: 65: Hoare triple {170856#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170831#(< ~counter~0 90)} is VALID [2022-04-08 06:10:54,928 INFO L290 TraceCheckUtils]: 64: Hoare triple {170856#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170856#(< ~counter~0 89)} is VALID [2022-04-08 06:10:54,929 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {170055#true} {170856#(< ~counter~0 89)} #96#return; {170856#(< ~counter~0 89)} is VALID [2022-04-08 06:10:54,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,929 INFO L272 TraceCheckUtils]: 59: Hoare triple {170856#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {170856#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {170856#(< ~counter~0 89)} is VALID [2022-04-08 06:10:54,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {170881#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170856#(< ~counter~0 89)} is VALID [2022-04-08 06:10:54,930 INFO L290 TraceCheckUtils]: 56: Hoare triple {170881#(< ~counter~0 88)} assume !!(0 != ~r~0); {170881#(< ~counter~0 88)} is VALID [2022-04-08 06:10:54,931 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {170055#true} {170881#(< ~counter~0 88)} #94#return; {170881#(< ~counter~0 88)} is VALID [2022-04-08 06:10:54,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,931 INFO L272 TraceCheckUtils]: 51: Hoare triple {170881#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,931 INFO L290 TraceCheckUtils]: 50: Hoare triple {170881#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {170881#(< ~counter~0 88)} is VALID [2022-04-08 06:10:54,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {170906#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170881#(< ~counter~0 88)} is VALID [2022-04-08 06:10:54,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {170906#(< ~counter~0 87)} assume !(~r~0 < 0); {170906#(< ~counter~0 87)} is VALID [2022-04-08 06:10:54,933 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {170055#true} {170906#(< ~counter~0 87)} #98#return; {170906#(< ~counter~0 87)} is VALID [2022-04-08 06:10:54,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,933 INFO L272 TraceCheckUtils]: 43: Hoare triple {170906#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {170906#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {170906#(< ~counter~0 87)} is VALID [2022-04-08 06:10:54,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {170931#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170906#(< ~counter~0 87)} is VALID [2022-04-08 06:10:54,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {170931#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170931#(< ~counter~0 86)} is VALID [2022-04-08 06:10:54,935 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {170055#true} {170931#(< ~counter~0 86)} #98#return; {170931#(< ~counter~0 86)} is VALID [2022-04-08 06:10:54,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,935 INFO L272 TraceCheckUtils]: 35: Hoare triple {170931#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {170931#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {170931#(< ~counter~0 86)} is VALID [2022-04-08 06:10:54,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {170956#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170931#(< ~counter~0 86)} is VALID [2022-04-08 06:10:54,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {170956#(< ~counter~0 85)} assume !(~r~0 > 0); {170956#(< ~counter~0 85)} is VALID [2022-04-08 06:10:54,937 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {170055#true} {170956#(< ~counter~0 85)} #96#return; {170956#(< ~counter~0 85)} is VALID [2022-04-08 06:10:54,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,937 INFO L272 TraceCheckUtils]: 27: Hoare triple {170956#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {170956#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {170956#(< ~counter~0 85)} is VALID [2022-04-08 06:10:54,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {170981#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170956#(< ~counter~0 85)} is VALID [2022-04-08 06:10:54,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {170981#(< ~counter~0 84)} assume !!(0 != ~r~0); {170981#(< ~counter~0 84)} is VALID [2022-04-08 06:10:54,939 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {170055#true} {170981#(< ~counter~0 84)} #94#return; {170981#(< ~counter~0 84)} is VALID [2022-04-08 06:10:54,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,939 INFO L272 TraceCheckUtils]: 19: Hoare triple {170981#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {170981#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {170981#(< ~counter~0 84)} is VALID [2022-04-08 06:10:54,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {171006#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170981#(< ~counter~0 84)} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {171006#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,941 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {170055#true} {171006#(< ~counter~0 83)} #92#return; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L272 TraceCheckUtils]: 11: Hoare triple {171006#(< ~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)); {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170055#true} {171006#(< ~counter~0 83)} #90#return; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-08 06:10:54,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {171006#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {170055#true} is VALID [2022-04-08 06:10:54,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {171006#(< ~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; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {171006#(< ~counter~0 83)} call #t~ret9 := main(); {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171006#(< ~counter~0 83)} {170055#true} #102#return; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {171006#(< ~counter~0 83)} assume true; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {170055#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {171006#(< ~counter~0 83)} is VALID [2022-04-08 06:10:54,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {170055#true} call ULTIMATE.init(); {170055#true} is VALID [2022-04-08 06:10:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 206 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 06:10:54,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199056698] [2022-04-08 06:10:54,943 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259991836] [2022-04-08 06:10:54,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259991836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:10:54,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:10:54,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:10:54,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:54,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [696739027] [2022-04-08 06:10:54,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [696739027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:54,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:54,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:10:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633409270] [2022-04-08 06:10:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:54,944 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-08 06:10:54,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:54,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:10:55,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:55,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:10:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:10:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:10:55,093 INFO L87 Difference]: Start difference. First operand 875 states and 1169 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:00,017 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-08 06:11:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 06:11:00,017 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 161 [2022-04-08 06:11:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 06:11:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-08 06:11:00,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-08 06:11:00,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:00,527 INFO L225 Difference]: With dead ends: 1079 [2022-04-08 06:11:00,527 INFO L226 Difference]: Without dead ends: 901 [2022-04-08 06:11:00,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1263, Invalid=1707, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 06:11:00,541 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 316 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:00,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 363 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 06:11:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-08 06:11:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-08 06:11:06,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:06,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:06,063 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:06,064 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:06,090 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 06:11:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 06:11:06,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:06,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:06,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 06:11:06,093 INFO L87 Difference]: Start difference. First operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-08 06:11:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:06,121 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-08 06:11:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-08 06:11:06,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:06,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:06,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:06,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 666 states have (on average 1.1786786786786787) internal successors, (785), 678 states have internal predecessors, (785), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-08 06:11:06,157 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-08 06:11:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:06,157 INFO L478 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-08 06:11:06,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:06,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-08 06:11:18,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1187 edges. 1185 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-08 06:11:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 06:11:18,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:18,683 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:11:18,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-04-08 06:11:18,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:18,883 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-08 06:11:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:18,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476247277] [2022-04-08 06:11:18,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-08 06:11:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:18,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95413277] [2022-04-08 06:11:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:18,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:18,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050623990] [2022-04-08 06:11:18,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:11:18,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:18,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:18,900 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:11:18,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 06:11:18,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:11:18,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:18,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 06:11:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:19,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:19,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {176830#true} call ULTIMATE.init(); {176830#true} is VALID [2022-04-08 06:11:19,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {176830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176838#(<= ~counter~0 0)} {176830#true} #102#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {176838#(<= ~counter~0 0)} call #t~ret9 := main(); {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {176838#(<= ~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; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {176838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {176838#(<= ~counter~0 0)} ~cond := #in~cond; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {176838#(<= ~counter~0 0)} assume !(0 == ~cond); {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176838#(<= ~counter~0 0)} {176838#(<= ~counter~0 0)} #90#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {176838#(<= ~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)); {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {176838#(<= ~counter~0 0)} ~cond := #in~cond; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {176838#(<= ~counter~0 0)} assume !(0 == ~cond); {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,926 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176838#(<= ~counter~0 0)} {176838#(<= ~counter~0 0)} #92#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {176838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176838#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:19,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {176838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {176887#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,931 INFO L272 TraceCheckUtils]: 19: Hoare triple {176887#(<= ~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)); {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {176887#(<= ~counter~0 1)} ~cond := #in~cond; {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {176887#(<= ~counter~0 1)} assume !(0 == ~cond); {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {176887#(<= ~counter~0 1)} assume true; {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,932 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176887#(<= ~counter~0 1)} {176887#(<= ~counter~0 1)} #94#return; {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {176887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176887#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:19,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {176887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {176912#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,934 INFO L272 TraceCheckUtils]: 27: Hoare triple {176912#(<= ~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)); {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {176912#(<= ~counter~0 2)} ~cond := #in~cond; {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {176912#(<= ~counter~0 2)} assume !(0 == ~cond); {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {176912#(<= ~counter~0 2)} assume true; {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,936 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176912#(<= ~counter~0 2)} {176912#(<= ~counter~0 2)} #96#return; {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {176912#(<= ~counter~0 2)} assume !(~r~0 > 0); {176912#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:19,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {176912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {176937#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,938 INFO L272 TraceCheckUtils]: 35: Hoare triple {176937#(<= ~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)); {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {176937#(<= ~counter~0 3)} ~cond := #in~cond; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {176937#(<= ~counter~0 3)} assume !(0 == ~cond); {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {176937#(<= ~counter~0 3)} assume true; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,939 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176937#(<= ~counter~0 3)} {176937#(<= ~counter~0 3)} #98#return; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {176937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176937#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:19,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {176937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {176962#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,942 INFO L272 TraceCheckUtils]: 43: Hoare triple {176962#(<= ~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)); {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {176962#(<= ~counter~0 4)} ~cond := #in~cond; {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {176962#(<= ~counter~0 4)} assume !(0 == ~cond); {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {176962#(<= ~counter~0 4)} assume true; {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,943 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176962#(<= ~counter~0 4)} {176962#(<= ~counter~0 4)} #98#return; {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {176962#(<= ~counter~0 4)} assume !(~r~0 < 0); {176962#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:19,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {176962#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {176987#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,945 INFO L272 TraceCheckUtils]: 51: Hoare triple {176987#(<= ~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)); {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {176987#(<= ~counter~0 5)} ~cond := #in~cond; {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {176987#(<= ~counter~0 5)} assume !(0 == ~cond); {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {176987#(<= ~counter~0 5)} assume true; {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,947 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176987#(<= ~counter~0 5)} {176987#(<= ~counter~0 5)} #94#return; {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {176987#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176987#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:19,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {176987#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {177012#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,949 INFO L272 TraceCheckUtils]: 59: Hoare triple {177012#(<= ~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)); {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {177012#(<= ~counter~0 6)} ~cond := #in~cond; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {177012#(<= ~counter~0 6)} assume !(0 == ~cond); {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {177012#(<= ~counter~0 6)} assume true; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,950 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {177012#(<= ~counter~0 6)} {177012#(<= ~counter~0 6)} #96#return; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {177012#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177012#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:19,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {177012#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,952 INFO L290 TraceCheckUtils]: 66: Hoare triple {177037#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,953 INFO L272 TraceCheckUtils]: 67: Hoare triple {177037#(<= ~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)); {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {177037#(<= ~counter~0 7)} ~cond := #in~cond; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,953 INFO L290 TraceCheckUtils]: 69: Hoare triple {177037#(<= ~counter~0 7)} assume !(0 == ~cond); {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {177037#(<= ~counter~0 7)} assume true; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,954 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {177037#(<= ~counter~0 7)} {177037#(<= ~counter~0 7)} #96#return; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,954 INFO L290 TraceCheckUtils]: 72: Hoare triple {177037#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177037#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:19,956 INFO L290 TraceCheckUtils]: 73: Hoare triple {177037#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,956 INFO L290 TraceCheckUtils]: 74: Hoare triple {177062#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,956 INFO L272 TraceCheckUtils]: 75: Hoare triple {177062#(<= ~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)); {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,957 INFO L290 TraceCheckUtils]: 76: Hoare triple {177062#(<= ~counter~0 8)} ~cond := #in~cond; {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,957 INFO L290 TraceCheckUtils]: 77: Hoare triple {177062#(<= ~counter~0 8)} assume !(0 == ~cond); {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,957 INFO L290 TraceCheckUtils]: 78: Hoare triple {177062#(<= ~counter~0 8)} assume true; {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,958 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {177062#(<= ~counter~0 8)} {177062#(<= ~counter~0 8)} #96#return; {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {177062#(<= ~counter~0 8)} assume !(~r~0 > 0); {177062#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:19,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {177062#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,959 INFO L290 TraceCheckUtils]: 82: Hoare triple {177087#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,960 INFO L272 TraceCheckUtils]: 83: Hoare triple {177087#(<= ~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)); {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {177087#(<= ~counter~0 9)} ~cond := #in~cond; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,960 INFO L290 TraceCheckUtils]: 85: Hoare triple {177087#(<= ~counter~0 9)} assume !(0 == ~cond); {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,961 INFO L290 TraceCheckUtils]: 86: Hoare triple {177087#(<= ~counter~0 9)} assume true; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,961 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {177087#(<= ~counter~0 9)} {177087#(<= ~counter~0 9)} #98#return; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {177087#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177087#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:19,963 INFO L290 TraceCheckUtils]: 89: Hoare triple {177087#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,963 INFO L290 TraceCheckUtils]: 90: Hoare triple {177112#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,964 INFO L272 TraceCheckUtils]: 91: Hoare triple {177112#(<= ~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)); {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,964 INFO L290 TraceCheckUtils]: 92: Hoare triple {177112#(<= ~counter~0 10)} ~cond := #in~cond; {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,964 INFO L290 TraceCheckUtils]: 93: Hoare triple {177112#(<= ~counter~0 10)} assume !(0 == ~cond); {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,964 INFO L290 TraceCheckUtils]: 94: Hoare triple {177112#(<= ~counter~0 10)} assume true; {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,965 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {177112#(<= ~counter~0 10)} {177112#(<= ~counter~0 10)} #98#return; {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {177112#(<= ~counter~0 10)} assume !(~r~0 < 0); {177112#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:19,966 INFO L290 TraceCheckUtils]: 97: Hoare triple {177112#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,967 INFO L290 TraceCheckUtils]: 98: Hoare triple {177137#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,967 INFO L272 TraceCheckUtils]: 99: Hoare triple {177137#(<= ~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)); {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,967 INFO L290 TraceCheckUtils]: 100: Hoare triple {177137#(<= ~counter~0 11)} ~cond := #in~cond; {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,968 INFO L290 TraceCheckUtils]: 101: Hoare triple {177137#(<= ~counter~0 11)} assume !(0 == ~cond); {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,968 INFO L290 TraceCheckUtils]: 102: Hoare triple {177137#(<= ~counter~0 11)} assume true; {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,968 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {177137#(<= ~counter~0 11)} {177137#(<= ~counter~0 11)} #94#return; {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,969 INFO L290 TraceCheckUtils]: 104: Hoare triple {177137#(<= ~counter~0 11)} assume !!(0 != ~r~0); {177137#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:19,970 INFO L290 TraceCheckUtils]: 105: Hoare triple {177137#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,970 INFO L290 TraceCheckUtils]: 106: Hoare triple {177162#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,971 INFO L272 TraceCheckUtils]: 107: Hoare triple {177162#(<= ~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)); {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,971 INFO L290 TraceCheckUtils]: 108: Hoare triple {177162#(<= ~counter~0 12)} ~cond := #in~cond; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,971 INFO L290 TraceCheckUtils]: 109: Hoare triple {177162#(<= ~counter~0 12)} assume !(0 == ~cond); {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,972 INFO L290 TraceCheckUtils]: 110: Hoare triple {177162#(<= ~counter~0 12)} assume true; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,972 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {177162#(<= ~counter~0 12)} {177162#(<= ~counter~0 12)} #96#return; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,972 INFO L290 TraceCheckUtils]: 112: Hoare triple {177162#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177162#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:19,974 INFO L290 TraceCheckUtils]: 113: Hoare triple {177162#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,974 INFO L290 TraceCheckUtils]: 114: Hoare triple {177187#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,974 INFO L272 TraceCheckUtils]: 115: Hoare triple {177187#(<= ~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)); {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,975 INFO L290 TraceCheckUtils]: 116: Hoare triple {177187#(<= ~counter~0 13)} ~cond := #in~cond; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,975 INFO L290 TraceCheckUtils]: 117: Hoare triple {177187#(<= ~counter~0 13)} assume !(0 == ~cond); {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,975 INFO L290 TraceCheckUtils]: 118: Hoare triple {177187#(<= ~counter~0 13)} assume true; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,976 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {177187#(<= ~counter~0 13)} {177187#(<= ~counter~0 13)} #96#return; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,976 INFO L290 TraceCheckUtils]: 120: Hoare triple {177187#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177187#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:19,977 INFO L290 TraceCheckUtils]: 121: Hoare triple {177187#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,978 INFO L290 TraceCheckUtils]: 122: Hoare triple {177212#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,978 INFO L272 TraceCheckUtils]: 123: Hoare triple {177212#(<= ~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)); {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,979 INFO L290 TraceCheckUtils]: 124: Hoare triple {177212#(<= ~counter~0 14)} ~cond := #in~cond; {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,979 INFO L290 TraceCheckUtils]: 125: Hoare triple {177212#(<= ~counter~0 14)} assume !(0 == ~cond); {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,979 INFO L290 TraceCheckUtils]: 126: Hoare triple {177212#(<= ~counter~0 14)} assume true; {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,980 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {177212#(<= ~counter~0 14)} {177212#(<= ~counter~0 14)} #96#return; {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,980 INFO L290 TraceCheckUtils]: 128: Hoare triple {177212#(<= ~counter~0 14)} assume !(~r~0 > 0); {177212#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:19,981 INFO L290 TraceCheckUtils]: 129: Hoare triple {177212#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,981 INFO L290 TraceCheckUtils]: 130: Hoare triple {177237#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,982 INFO L272 TraceCheckUtils]: 131: Hoare triple {177237#(<= ~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)); {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,982 INFO L290 TraceCheckUtils]: 132: Hoare triple {177237#(<= ~counter~0 15)} ~cond := #in~cond; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,982 INFO L290 TraceCheckUtils]: 133: Hoare triple {177237#(<= ~counter~0 15)} assume !(0 == ~cond); {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,983 INFO L290 TraceCheckUtils]: 134: Hoare triple {177237#(<= ~counter~0 15)} assume true; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,983 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {177237#(<= ~counter~0 15)} {177237#(<= ~counter~0 15)} #98#return; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,983 INFO L290 TraceCheckUtils]: 136: Hoare triple {177237#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177237#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:19,985 INFO L290 TraceCheckUtils]: 137: Hoare triple {177237#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,985 INFO L290 TraceCheckUtils]: 138: Hoare triple {177262#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,986 INFO L272 TraceCheckUtils]: 139: Hoare triple {177262#(<= ~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)); {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,986 INFO L290 TraceCheckUtils]: 140: Hoare triple {177262#(<= ~counter~0 16)} ~cond := #in~cond; {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,986 INFO L290 TraceCheckUtils]: 141: Hoare triple {177262#(<= ~counter~0 16)} assume !(0 == ~cond); {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,986 INFO L290 TraceCheckUtils]: 142: Hoare triple {177262#(<= ~counter~0 16)} assume true; {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,987 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {177262#(<= ~counter~0 16)} {177262#(<= ~counter~0 16)} #98#return; {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,987 INFO L290 TraceCheckUtils]: 144: Hoare triple {177262#(<= ~counter~0 16)} assume !(~r~0 < 0); {177262#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:19,988 INFO L290 TraceCheckUtils]: 145: Hoare triple {177262#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,989 INFO L290 TraceCheckUtils]: 146: Hoare triple {177287#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,989 INFO L272 TraceCheckUtils]: 147: Hoare triple {177287#(<= ~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)); {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,989 INFO L290 TraceCheckUtils]: 148: Hoare triple {177287#(<= ~counter~0 17)} ~cond := #in~cond; {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,990 INFO L290 TraceCheckUtils]: 149: Hoare triple {177287#(<= ~counter~0 17)} assume !(0 == ~cond); {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,990 INFO L290 TraceCheckUtils]: 150: Hoare triple {177287#(<= ~counter~0 17)} assume true; {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,990 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {177287#(<= ~counter~0 17)} {177287#(<= ~counter~0 17)} #94#return; {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,991 INFO L290 TraceCheckUtils]: 152: Hoare triple {177287#(<= ~counter~0 17)} assume !!(0 != ~r~0); {177287#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:19,991 INFO L290 TraceCheckUtils]: 153: Hoare triple {177287#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177312#(<= |main_#t~post7| 17)} is VALID [2022-04-08 06:11:19,991 INFO L290 TraceCheckUtils]: 154: Hoare triple {177312#(<= |main_#t~post7| 17)} assume !(#t~post7 < 100);havoc #t~post7; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 155: Hoare triple {176831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 156: Hoare triple {176831#false} assume !(#t~post8 < 100);havoc #t~post8; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 157: Hoare triple {176831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 158: Hoare triple {176831#false} assume !(#t~post6 < 100);havoc #t~post6; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L272 TraceCheckUtils]: 159: Hoare triple {176831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 160: Hoare triple {176831#false} ~cond := #in~cond; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 161: Hoare triple {176831#false} assume 0 == ~cond; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L290 TraceCheckUtils]: 162: Hoare triple {176831#false} assume !false; {176831#false} is VALID [2022-04-08 06:11:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 726 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:11:19,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:21,040 INFO L290 TraceCheckUtils]: 162: Hoare triple {176831#false} assume !false; {176831#false} is VALID [2022-04-08 06:11:21,040 INFO L290 TraceCheckUtils]: 161: Hoare triple {176831#false} assume 0 == ~cond; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 160: Hoare triple {176831#false} ~cond := #in~cond; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L272 TraceCheckUtils]: 159: Hoare triple {176831#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 158: Hoare triple {176831#false} assume !(#t~post6 < 100);havoc #t~post6; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 157: Hoare triple {176831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 156: Hoare triple {176831#false} assume !(#t~post8 < 100);havoc #t~post8; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 155: Hoare triple {176831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 154: Hoare triple {177364#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {176831#false} is VALID [2022-04-08 06:11:21,041 INFO L290 TraceCheckUtils]: 153: Hoare triple {177368#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177364#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:11:21,042 INFO L290 TraceCheckUtils]: 152: Hoare triple {177368#(< ~counter~0 100)} assume !!(0 != ~r~0); {177368#(< ~counter~0 100)} is VALID [2022-04-08 06:11:21,042 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176830#true} {177368#(< ~counter~0 100)} #94#return; {177368#(< ~counter~0 100)} is VALID [2022-04-08 06:11:21,042 INFO L290 TraceCheckUtils]: 150: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,042 INFO L290 TraceCheckUtils]: 149: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,042 INFO L290 TraceCheckUtils]: 148: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,042 INFO L272 TraceCheckUtils]: 147: Hoare triple {177368#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,043 INFO L290 TraceCheckUtils]: 146: Hoare triple {177368#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {177368#(< ~counter~0 100)} is VALID [2022-04-08 06:11:21,046 INFO L290 TraceCheckUtils]: 145: Hoare triple {177393#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177368#(< ~counter~0 100)} is VALID [2022-04-08 06:11:21,046 INFO L290 TraceCheckUtils]: 144: Hoare triple {177393#(< ~counter~0 99)} assume !(~r~0 < 0); {177393#(< ~counter~0 99)} is VALID [2022-04-08 06:11:21,047 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176830#true} {177393#(< ~counter~0 99)} #98#return; {177393#(< ~counter~0 99)} is VALID [2022-04-08 06:11:21,047 INFO L290 TraceCheckUtils]: 142: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,047 INFO L290 TraceCheckUtils]: 141: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,047 INFO L290 TraceCheckUtils]: 140: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,047 INFO L272 TraceCheckUtils]: 139: Hoare triple {177393#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,047 INFO L290 TraceCheckUtils]: 138: Hoare triple {177393#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {177393#(< ~counter~0 99)} is VALID [2022-04-08 06:11:21,049 INFO L290 TraceCheckUtils]: 137: Hoare triple {177418#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177393#(< ~counter~0 99)} is VALID [2022-04-08 06:11:21,049 INFO L290 TraceCheckUtils]: 136: Hoare triple {177418#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177418#(< ~counter~0 98)} is VALID [2022-04-08 06:11:21,049 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176830#true} {177418#(< ~counter~0 98)} #98#return; {177418#(< ~counter~0 98)} is VALID [2022-04-08 06:11:21,049 INFO L290 TraceCheckUtils]: 134: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,049 INFO L290 TraceCheckUtils]: 133: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,050 INFO L272 TraceCheckUtils]: 131: Hoare triple {177418#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,050 INFO L290 TraceCheckUtils]: 130: Hoare triple {177418#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {177418#(< ~counter~0 98)} is VALID [2022-04-08 06:11:21,051 INFO L290 TraceCheckUtils]: 129: Hoare triple {177443#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177418#(< ~counter~0 98)} is VALID [2022-04-08 06:11:21,051 INFO L290 TraceCheckUtils]: 128: Hoare triple {177443#(< ~counter~0 97)} assume !(~r~0 > 0); {177443#(< ~counter~0 97)} is VALID [2022-04-08 06:11:21,052 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176830#true} {177443#(< ~counter~0 97)} #96#return; {177443#(< ~counter~0 97)} is VALID [2022-04-08 06:11:21,052 INFO L290 TraceCheckUtils]: 126: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,052 INFO L290 TraceCheckUtils]: 125: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,052 INFO L290 TraceCheckUtils]: 124: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,052 INFO L272 TraceCheckUtils]: 123: Hoare triple {177443#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,052 INFO L290 TraceCheckUtils]: 122: Hoare triple {177443#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {177443#(< ~counter~0 97)} is VALID [2022-04-08 06:11:21,054 INFO L290 TraceCheckUtils]: 121: Hoare triple {177468#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177443#(< ~counter~0 97)} is VALID [2022-04-08 06:11:21,054 INFO L290 TraceCheckUtils]: 120: Hoare triple {177468#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177468#(< ~counter~0 96)} is VALID [2022-04-08 06:11:21,054 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176830#true} {177468#(< ~counter~0 96)} #96#return; {177468#(< ~counter~0 96)} is VALID [2022-04-08 06:11:21,054 INFO L290 TraceCheckUtils]: 118: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,054 INFO L290 TraceCheckUtils]: 117: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,054 INFO L290 TraceCheckUtils]: 116: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,055 INFO L272 TraceCheckUtils]: 115: Hoare triple {177468#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,055 INFO L290 TraceCheckUtils]: 114: Hoare triple {177468#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {177468#(< ~counter~0 96)} is VALID [2022-04-08 06:11:21,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {177493#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177468#(< ~counter~0 96)} is VALID [2022-04-08 06:11:21,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {177493#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177493#(< ~counter~0 95)} is VALID [2022-04-08 06:11:21,057 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176830#true} {177493#(< ~counter~0 95)} #96#return; {177493#(< ~counter~0 95)} is VALID [2022-04-08 06:11:21,057 INFO L290 TraceCheckUtils]: 110: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,057 INFO L290 TraceCheckUtils]: 109: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,057 INFO L290 TraceCheckUtils]: 108: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,057 INFO L272 TraceCheckUtils]: 107: Hoare triple {177493#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,057 INFO L290 TraceCheckUtils]: 106: Hoare triple {177493#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {177493#(< ~counter~0 95)} is VALID [2022-04-08 06:11:21,059 INFO L290 TraceCheckUtils]: 105: Hoare triple {177518#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177493#(< ~counter~0 95)} is VALID [2022-04-08 06:11:21,059 INFO L290 TraceCheckUtils]: 104: Hoare triple {177518#(< ~counter~0 94)} assume !!(0 != ~r~0); {177518#(< ~counter~0 94)} is VALID [2022-04-08 06:11:21,059 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176830#true} {177518#(< ~counter~0 94)} #94#return; {177518#(< ~counter~0 94)} is VALID [2022-04-08 06:11:21,059 INFO L290 TraceCheckUtils]: 102: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,059 INFO L290 TraceCheckUtils]: 101: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,059 INFO L290 TraceCheckUtils]: 100: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,060 INFO L272 TraceCheckUtils]: 99: Hoare triple {177518#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,060 INFO L290 TraceCheckUtils]: 98: Hoare triple {177518#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {177518#(< ~counter~0 94)} is VALID [2022-04-08 06:11:21,061 INFO L290 TraceCheckUtils]: 97: Hoare triple {177543#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177518#(< ~counter~0 94)} is VALID [2022-04-08 06:11:21,061 INFO L290 TraceCheckUtils]: 96: Hoare triple {177543#(< ~counter~0 93)} assume !(~r~0 < 0); {177543#(< ~counter~0 93)} is VALID [2022-04-08 06:11:21,062 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176830#true} {177543#(< ~counter~0 93)} #98#return; {177543#(< ~counter~0 93)} is VALID [2022-04-08 06:11:21,062 INFO L290 TraceCheckUtils]: 94: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,062 INFO L290 TraceCheckUtils]: 93: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,062 INFO L290 TraceCheckUtils]: 92: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,062 INFO L272 TraceCheckUtils]: 91: Hoare triple {177543#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,062 INFO L290 TraceCheckUtils]: 90: Hoare triple {177543#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {177543#(< ~counter~0 93)} is VALID [2022-04-08 06:11:21,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {177568#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177543#(< ~counter~0 93)} is VALID [2022-04-08 06:11:21,064 INFO L290 TraceCheckUtils]: 88: Hoare triple {177568#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177568#(< ~counter~0 92)} is VALID [2022-04-08 06:11:21,064 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176830#true} {177568#(< ~counter~0 92)} #98#return; {177568#(< ~counter~0 92)} is VALID [2022-04-08 06:11:21,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,064 INFO L290 TraceCheckUtils]: 85: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,064 INFO L290 TraceCheckUtils]: 84: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,065 INFO L272 TraceCheckUtils]: 83: Hoare triple {177568#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {177568#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {177568#(< ~counter~0 92)} is VALID [2022-04-08 06:11:21,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {177593#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177568#(< ~counter~0 92)} is VALID [2022-04-08 06:11:21,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {177593#(< ~counter~0 91)} assume !(~r~0 > 0); {177593#(< ~counter~0 91)} is VALID [2022-04-08 06:11:21,067 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176830#true} {177593#(< ~counter~0 91)} #96#return; {177593#(< ~counter~0 91)} is VALID [2022-04-08 06:11:21,067 INFO L290 TraceCheckUtils]: 78: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,067 INFO L272 TraceCheckUtils]: 75: Hoare triple {177593#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,067 INFO L290 TraceCheckUtils]: 74: Hoare triple {177593#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {177593#(< ~counter~0 91)} is VALID [2022-04-08 06:11:21,069 INFO L290 TraceCheckUtils]: 73: Hoare triple {177618#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177593#(< ~counter~0 91)} is VALID [2022-04-08 06:11:21,069 INFO L290 TraceCheckUtils]: 72: Hoare triple {177618#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177618#(< ~counter~0 90)} is VALID [2022-04-08 06:11:21,069 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176830#true} {177618#(< ~counter~0 90)} #96#return; {177618#(< ~counter~0 90)} is VALID [2022-04-08 06:11:21,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,070 INFO L272 TraceCheckUtils]: 67: Hoare triple {177618#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {177618#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {177618#(< ~counter~0 90)} is VALID [2022-04-08 06:11:21,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {177643#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177618#(< ~counter~0 90)} is VALID [2022-04-08 06:11:21,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {177643#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177643#(< ~counter~0 89)} is VALID [2022-04-08 06:11:21,072 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176830#true} {177643#(< ~counter~0 89)} #96#return; {177643#(< ~counter~0 89)} is VALID [2022-04-08 06:11:21,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,072 INFO L272 TraceCheckUtils]: 59: Hoare triple {177643#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {177643#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {177643#(< ~counter~0 89)} is VALID [2022-04-08 06:11:21,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {177668#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177643#(< ~counter~0 89)} is VALID [2022-04-08 06:11:21,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {177668#(< ~counter~0 88)} assume !!(0 != ~r~0); {177668#(< ~counter~0 88)} is VALID [2022-04-08 06:11:21,074 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176830#true} {177668#(< ~counter~0 88)} #94#return; {177668#(< ~counter~0 88)} is VALID [2022-04-08 06:11:21,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,075 INFO L272 TraceCheckUtils]: 51: Hoare triple {177668#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {177668#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {177668#(< ~counter~0 88)} is VALID [2022-04-08 06:11:21,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {177693#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177668#(< ~counter~0 88)} is VALID [2022-04-08 06:11:21,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {177693#(< ~counter~0 87)} assume !(~r~0 < 0); {177693#(< ~counter~0 87)} is VALID [2022-04-08 06:11:21,077 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176830#true} {177693#(< ~counter~0 87)} #98#return; {177693#(< ~counter~0 87)} is VALID [2022-04-08 06:11:21,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,077 INFO L272 TraceCheckUtils]: 43: Hoare triple {177693#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {177693#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {177693#(< ~counter~0 87)} is VALID [2022-04-08 06:11:21,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {177718#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177693#(< ~counter~0 87)} is VALID [2022-04-08 06:11:21,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {177718#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177718#(< ~counter~0 86)} is VALID [2022-04-08 06:11:21,080 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176830#true} {177718#(< ~counter~0 86)} #98#return; {177718#(< ~counter~0 86)} is VALID [2022-04-08 06:11:21,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,080 INFO L272 TraceCheckUtils]: 35: Hoare triple {177718#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {177718#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {177718#(< ~counter~0 86)} is VALID [2022-04-08 06:11:21,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {177743#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177718#(< ~counter~0 86)} is VALID [2022-04-08 06:11:21,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {177743#(< ~counter~0 85)} assume !(~r~0 > 0); {177743#(< ~counter~0 85)} is VALID [2022-04-08 06:11:21,082 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176830#true} {177743#(< ~counter~0 85)} #96#return; {177743#(< ~counter~0 85)} is VALID [2022-04-08 06:11:21,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,082 INFO L272 TraceCheckUtils]: 27: Hoare triple {177743#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {177743#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {177743#(< ~counter~0 85)} is VALID [2022-04-08 06:11:21,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {177768#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177743#(< ~counter~0 85)} is VALID [2022-04-08 06:11:21,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {177768#(< ~counter~0 84)} assume !!(0 != ~r~0); {177768#(< ~counter~0 84)} is VALID [2022-04-08 06:11:21,085 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176830#true} {177768#(< ~counter~0 84)} #94#return; {177768#(< ~counter~0 84)} is VALID [2022-04-08 06:11:21,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,085 INFO L272 TraceCheckUtils]: 19: Hoare triple {177768#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {177768#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {177768#(< ~counter~0 84)} is VALID [2022-04-08 06:11:21,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {177793#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177768#(< ~counter~0 84)} is VALID [2022-04-08 06:11:21,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {177793#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,087 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176830#true} {177793#(< ~counter~0 83)} #92#return; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,087 INFO L272 TraceCheckUtils]: 11: Hoare triple {177793#(< ~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)); {176830#true} is VALID [2022-04-08 06:11:21,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176830#true} {177793#(< ~counter~0 83)} #90#return; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-08 06:11:21,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-08 06:11:21,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-08 06:11:21,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {177793#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176830#true} is VALID [2022-04-08 06:11:21,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {177793#(< ~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; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {177793#(< ~counter~0 83)} call #t~ret9 := main(); {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177793#(< ~counter~0 83)} {176830#true} #102#return; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {177793#(< ~counter~0 83)} assume true; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {176830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {177793#(< ~counter~0 83)} is VALID [2022-04-08 06:11:21,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {176830#true} call ULTIMATE.init(); {176830#true} is VALID [2022-04-08 06:11:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-08 06:11:21,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:21,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95413277] [2022-04-08 06:11:21,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:21,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050623990] [2022-04-08 06:11:21,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050623990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:21,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:21,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-08 06:11:21,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:21,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476247277] [2022-04-08 06:11:21,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476247277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:21,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:21,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 06:11:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647746303] [2022-04-08 06:11:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-08 06:11:21,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:21,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:21,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:21,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 06:11:21,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 06:11:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 06:11:21,478 INFO L87 Difference]: Start difference. First operand 890 states and 1187 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:27,447 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-08 06:11:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 06:11:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 163 [2022-04-08 06:11:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 06:11:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-08 06:11:27,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-08 06:11:27,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:27,944 INFO L225 Difference]: With dead ends: 1077 [2022-04-08 06:11:27,944 INFO L226 Difference]: Without dead ends: 907 [2022-04-08 06:11:27,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1316, Invalid=1764, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 06:11:27,945 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 257 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:27,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 386 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 06:11:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-08 06:11:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-08 06:11:31,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:31,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:31,985 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:31,985 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:32,013 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 06:11:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:11:32,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:32,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 06:11:32,015 INFO L87 Difference]: Start difference. First operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 907 states. [2022-04-08 06:11:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:32,052 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-08 06:11:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:11:32,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:32,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:32,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:32,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 683 states have (on average 1.1742313323572475) internal successors, (802), 690 states have internal predecessors, (802), 202 states have call successors, (202), 23 states have call predecessors, (202), 21 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-08 06:11:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-08 06:11:32,089 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-08 06:11:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:32,089 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-08 06:11:32,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 20 states have call successors, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-08 06:11:32,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-08 06:11:39,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1203 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-08 06:11:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 06:11:39,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:39,630 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:11:39,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 06:11:39,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-08 06:11:39,830 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-08 06:11:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006238569] [2022-04-08 06:11:39,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-08 06:11:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777893191] [2022-04-08 06:11:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:39,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [837568165] [2022-04-08 06:11:39,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:11:39,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:39,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:39,868 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:11:39,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 06:11:39,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:11:39,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:39,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 06:11:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:40,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:40,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {183661#true} call ULTIMATE.init(); {183661#true} is VALID [2022-04-08 06:11:40,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {183661#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183669#(<= ~counter~0 0)} {183661#true} #102#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {183669#(<= ~counter~0 0)} call #t~ret9 := main(); {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {183669#(<= ~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; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {183669#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {183669#(<= ~counter~0 0)} ~cond := #in~cond; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {183669#(<= ~counter~0 0)} assume !(0 == ~cond); {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183669#(<= ~counter~0 0)} {183669#(<= ~counter~0 0)} #90#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,960 INFO L272 TraceCheckUtils]: 11: Hoare triple {183669#(<= ~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)); {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {183669#(<= ~counter~0 0)} ~cond := #in~cond; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {183669#(<= ~counter~0 0)} assume !(0 == ~cond); {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183669#(<= ~counter~0 0)} {183669#(<= ~counter~0 0)} #92#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {183669#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {183669#(<= ~counter~0 0)} is VALID [2022-04-08 06:11:40,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {183669#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {183718#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,967 INFO L272 TraceCheckUtils]: 19: Hoare triple {183718#(<= ~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)); {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {183718#(<= ~counter~0 1)} ~cond := #in~cond; {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {183718#(<= ~counter~0 1)} assume !(0 == ~cond); {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {183718#(<= ~counter~0 1)} assume true; {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,968 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183718#(<= ~counter~0 1)} {183718#(<= ~counter~0 1)} #94#return; {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {183718#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183718#(<= ~counter~0 1)} is VALID [2022-04-08 06:11:40,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {183718#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {183743#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,972 INFO L272 TraceCheckUtils]: 27: Hoare triple {183743#(<= ~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)); {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {183743#(<= ~counter~0 2)} ~cond := #in~cond; {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {183743#(<= ~counter~0 2)} assume !(0 == ~cond); {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {183743#(<= ~counter~0 2)} assume true; {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,973 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183743#(<= ~counter~0 2)} {183743#(<= ~counter~0 2)} #96#return; {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {183743#(<= ~counter~0 2)} assume !(~r~0 > 0); {183743#(<= ~counter~0 2)} is VALID [2022-04-08 06:11:40,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {183743#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {183768#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,977 INFO L272 TraceCheckUtils]: 35: Hoare triple {183768#(<= ~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)); {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {183768#(<= ~counter~0 3)} ~cond := #in~cond; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {183768#(<= ~counter~0 3)} assume !(0 == ~cond); {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {183768#(<= ~counter~0 3)} assume true; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,978 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183768#(<= ~counter~0 3)} {183768#(<= ~counter~0 3)} #98#return; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {183768#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183768#(<= ~counter~0 3)} is VALID [2022-04-08 06:11:40,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {183768#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {183793#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,981 INFO L272 TraceCheckUtils]: 43: Hoare triple {183793#(<= ~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)); {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {183793#(<= ~counter~0 4)} ~cond := #in~cond; {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {183793#(<= ~counter~0 4)} assume !(0 == ~cond); {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {183793#(<= ~counter~0 4)} assume true; {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,982 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183793#(<= ~counter~0 4)} {183793#(<= ~counter~0 4)} #98#return; {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {183793#(<= ~counter~0 4)} assume !(~r~0 < 0); {183793#(<= ~counter~0 4)} is VALID [2022-04-08 06:11:40,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {183793#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {183818#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,984 INFO L272 TraceCheckUtils]: 51: Hoare triple {183818#(<= ~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)); {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {183818#(<= ~counter~0 5)} ~cond := #in~cond; {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {183818#(<= ~counter~0 5)} assume !(0 == ~cond); {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {183818#(<= ~counter~0 5)} assume true; {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,986 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183818#(<= ~counter~0 5)} {183818#(<= ~counter~0 5)} #94#return; {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {183818#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183818#(<= ~counter~0 5)} is VALID [2022-04-08 06:11:40,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {183818#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {183843#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,989 INFO L272 TraceCheckUtils]: 59: Hoare triple {183843#(<= ~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)); {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {183843#(<= ~counter~0 6)} ~cond := #in~cond; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {183843#(<= ~counter~0 6)} assume !(0 == ~cond); {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {183843#(<= ~counter~0 6)} assume true; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183843#(<= ~counter~0 6)} {183843#(<= ~counter~0 6)} #96#return; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {183843#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183843#(<= ~counter~0 6)} is VALID [2022-04-08 06:11:40,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {183843#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {183868#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,992 INFO L272 TraceCheckUtils]: 67: Hoare triple {183868#(<= ~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)); {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,993 INFO L290 TraceCheckUtils]: 68: Hoare triple {183868#(<= ~counter~0 7)} ~cond := #in~cond; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,993 INFO L290 TraceCheckUtils]: 69: Hoare triple {183868#(<= ~counter~0 7)} assume !(0 == ~cond); {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {183868#(<= ~counter~0 7)} assume true; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,994 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183868#(<= ~counter~0 7)} {183868#(<= ~counter~0 7)} #96#return; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,994 INFO L290 TraceCheckUtils]: 72: Hoare triple {183868#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183868#(<= ~counter~0 7)} is VALID [2022-04-08 06:11:40,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {183868#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {183893#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,996 INFO L272 TraceCheckUtils]: 75: Hoare triple {183893#(<= ~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)); {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {183893#(<= ~counter~0 8)} ~cond := #in~cond; {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,997 INFO L290 TraceCheckUtils]: 77: Hoare triple {183893#(<= ~counter~0 8)} assume !(0 == ~cond); {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,997 INFO L290 TraceCheckUtils]: 78: Hoare triple {183893#(<= ~counter~0 8)} assume true; {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,997 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183893#(<= ~counter~0 8)} {183893#(<= ~counter~0 8)} #96#return; {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,998 INFO L290 TraceCheckUtils]: 80: Hoare triple {183893#(<= ~counter~0 8)} assume !(~r~0 > 0); {183893#(<= ~counter~0 8)} is VALID [2022-04-08 06:11:40,999 INFO L290 TraceCheckUtils]: 81: Hoare triple {183893#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,000 INFO L290 TraceCheckUtils]: 82: Hoare triple {183918#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,000 INFO L272 TraceCheckUtils]: 83: Hoare triple {183918#(<= ~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)); {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,001 INFO L290 TraceCheckUtils]: 84: Hoare triple {183918#(<= ~counter~0 9)} ~cond := #in~cond; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {183918#(<= ~counter~0 9)} assume !(0 == ~cond); {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {183918#(<= ~counter~0 9)} assume true; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,002 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183918#(<= ~counter~0 9)} {183918#(<= ~counter~0 9)} #98#return; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,002 INFO L290 TraceCheckUtils]: 88: Hoare triple {183918#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {183918#(<= ~counter~0 9)} is VALID [2022-04-08 06:11:41,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {183918#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {183943#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,005 INFO L272 TraceCheckUtils]: 91: Hoare triple {183943#(<= ~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)); {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {183943#(<= ~counter~0 10)} ~cond := #in~cond; {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {183943#(<= ~counter~0 10)} assume !(0 == ~cond); {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,006 INFO L290 TraceCheckUtils]: 94: Hoare triple {183943#(<= ~counter~0 10)} assume true; {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,006 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183943#(<= ~counter~0 10)} {183943#(<= ~counter~0 10)} #98#return; {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,006 INFO L290 TraceCheckUtils]: 96: Hoare triple {183943#(<= ~counter~0 10)} assume !(~r~0 < 0); {183943#(<= ~counter~0 10)} is VALID [2022-04-08 06:11:41,008 INFO L290 TraceCheckUtils]: 97: Hoare triple {183943#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,008 INFO L290 TraceCheckUtils]: 98: Hoare triple {183968#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,009 INFO L272 TraceCheckUtils]: 99: Hoare triple {183968#(<= ~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)); {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {183968#(<= ~counter~0 11)} ~cond := #in~cond; {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {183968#(<= ~counter~0 11)} assume !(0 == ~cond); {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,010 INFO L290 TraceCheckUtils]: 102: Hoare triple {183968#(<= ~counter~0 11)} assume true; {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,010 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183968#(<= ~counter~0 11)} {183968#(<= ~counter~0 11)} #94#return; {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,010 INFO L290 TraceCheckUtils]: 104: Hoare triple {183968#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183968#(<= ~counter~0 11)} is VALID [2022-04-08 06:11:41,012 INFO L290 TraceCheckUtils]: 105: Hoare triple {183968#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,012 INFO L290 TraceCheckUtils]: 106: Hoare triple {183993#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,013 INFO L272 TraceCheckUtils]: 107: Hoare triple {183993#(<= ~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)); {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {183993#(<= ~counter~0 12)} ~cond := #in~cond; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,013 INFO L290 TraceCheckUtils]: 109: Hoare triple {183993#(<= ~counter~0 12)} assume !(0 == ~cond); {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,014 INFO L290 TraceCheckUtils]: 110: Hoare triple {183993#(<= ~counter~0 12)} assume true; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,014 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183993#(<= ~counter~0 12)} {183993#(<= ~counter~0 12)} #96#return; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,014 INFO L290 TraceCheckUtils]: 112: Hoare triple {183993#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {183993#(<= ~counter~0 12)} is VALID [2022-04-08 06:11:41,016 INFO L290 TraceCheckUtils]: 113: Hoare triple {183993#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,016 INFO L290 TraceCheckUtils]: 114: Hoare triple {184018#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,017 INFO L272 TraceCheckUtils]: 115: Hoare triple {184018#(<= ~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)); {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,017 INFO L290 TraceCheckUtils]: 116: Hoare triple {184018#(<= ~counter~0 13)} ~cond := #in~cond; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,017 INFO L290 TraceCheckUtils]: 117: Hoare triple {184018#(<= ~counter~0 13)} assume !(0 == ~cond); {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,017 INFO L290 TraceCheckUtils]: 118: Hoare triple {184018#(<= ~counter~0 13)} assume true; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,018 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {184018#(<= ~counter~0 13)} {184018#(<= ~counter~0 13)} #96#return; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,018 INFO L290 TraceCheckUtils]: 120: Hoare triple {184018#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184018#(<= ~counter~0 13)} is VALID [2022-04-08 06:11:41,020 INFO L290 TraceCheckUtils]: 121: Hoare triple {184018#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,020 INFO L290 TraceCheckUtils]: 122: Hoare triple {184043#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,020 INFO L272 TraceCheckUtils]: 123: Hoare triple {184043#(<= ~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)); {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,021 INFO L290 TraceCheckUtils]: 124: Hoare triple {184043#(<= ~counter~0 14)} ~cond := #in~cond; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,021 INFO L290 TraceCheckUtils]: 125: Hoare triple {184043#(<= ~counter~0 14)} assume !(0 == ~cond); {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,021 INFO L290 TraceCheckUtils]: 126: Hoare triple {184043#(<= ~counter~0 14)} assume true; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,022 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {184043#(<= ~counter~0 14)} {184043#(<= ~counter~0 14)} #96#return; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {184043#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184043#(<= ~counter~0 14)} is VALID [2022-04-08 06:11:41,023 INFO L290 TraceCheckUtils]: 129: Hoare triple {184043#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,024 INFO L290 TraceCheckUtils]: 130: Hoare triple {184068#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,024 INFO L272 TraceCheckUtils]: 131: Hoare triple {184068#(<= ~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)); {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,024 INFO L290 TraceCheckUtils]: 132: Hoare triple {184068#(<= ~counter~0 15)} ~cond := #in~cond; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,025 INFO L290 TraceCheckUtils]: 133: Hoare triple {184068#(<= ~counter~0 15)} assume !(0 == ~cond); {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,025 INFO L290 TraceCheckUtils]: 134: Hoare triple {184068#(<= ~counter~0 15)} assume true; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,025 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {184068#(<= ~counter~0 15)} {184068#(<= ~counter~0 15)} #96#return; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,026 INFO L290 TraceCheckUtils]: 136: Hoare triple {184068#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184068#(<= ~counter~0 15)} is VALID [2022-04-08 06:11:41,027 INFO L290 TraceCheckUtils]: 137: Hoare triple {184068#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,028 INFO L290 TraceCheckUtils]: 138: Hoare triple {184093#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,028 INFO L272 TraceCheckUtils]: 139: Hoare triple {184093#(<= ~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)); {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,029 INFO L290 TraceCheckUtils]: 140: Hoare triple {184093#(<= ~counter~0 16)} ~cond := #in~cond; {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,029 INFO L290 TraceCheckUtils]: 141: Hoare triple {184093#(<= ~counter~0 16)} assume !(0 == ~cond); {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,029 INFO L290 TraceCheckUtils]: 142: Hoare triple {184093#(<= ~counter~0 16)} assume true; {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,030 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {184093#(<= ~counter~0 16)} {184093#(<= ~counter~0 16)} #96#return; {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,030 INFO L290 TraceCheckUtils]: 144: Hoare triple {184093#(<= ~counter~0 16)} assume !(~r~0 > 0); {184093#(<= ~counter~0 16)} is VALID [2022-04-08 06:11:41,031 INFO L290 TraceCheckUtils]: 145: Hoare triple {184093#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,032 INFO L290 TraceCheckUtils]: 146: Hoare triple {184118#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,032 INFO L272 TraceCheckUtils]: 147: Hoare triple {184118#(<= ~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)); {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,033 INFO L290 TraceCheckUtils]: 148: Hoare triple {184118#(<= ~counter~0 17)} ~cond := #in~cond; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,033 INFO L290 TraceCheckUtils]: 149: Hoare triple {184118#(<= ~counter~0 17)} assume !(0 == ~cond); {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,033 INFO L290 TraceCheckUtils]: 150: Hoare triple {184118#(<= ~counter~0 17)} assume true; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,033 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {184118#(<= ~counter~0 17)} {184118#(<= ~counter~0 17)} #98#return; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,034 INFO L290 TraceCheckUtils]: 152: Hoare triple {184118#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184118#(<= ~counter~0 17)} is VALID [2022-04-08 06:11:41,036 INFO L290 TraceCheckUtils]: 153: Hoare triple {184118#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,036 INFO L290 TraceCheckUtils]: 154: Hoare triple {184143#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,037 INFO L272 TraceCheckUtils]: 155: Hoare triple {184143#(<= ~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)); {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,037 INFO L290 TraceCheckUtils]: 156: Hoare triple {184143#(<= ~counter~0 18)} ~cond := #in~cond; {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,037 INFO L290 TraceCheckUtils]: 157: Hoare triple {184143#(<= ~counter~0 18)} assume !(0 == ~cond); {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,038 INFO L290 TraceCheckUtils]: 158: Hoare triple {184143#(<= ~counter~0 18)} assume true; {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,038 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {184143#(<= ~counter~0 18)} {184143#(<= ~counter~0 18)} #98#return; {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,038 INFO L290 TraceCheckUtils]: 160: Hoare triple {184143#(<= ~counter~0 18)} assume !(~r~0 < 0); {184143#(<= ~counter~0 18)} is VALID [2022-04-08 06:11:41,039 INFO L290 TraceCheckUtils]: 161: Hoare triple {184143#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184168#(<= |main_#t~post6| 18)} is VALID [2022-04-08 06:11:41,039 INFO L290 TraceCheckUtils]: 162: Hoare triple {184168#(<= |main_#t~post6| 18)} assume !(#t~post6 < 100);havoc #t~post6; {183662#false} is VALID [2022-04-08 06:11:41,039 INFO L272 TraceCheckUtils]: 163: Hoare triple {183662#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183662#false} is VALID [2022-04-08 06:11:41,039 INFO L290 TraceCheckUtils]: 164: Hoare triple {183662#false} ~cond := #in~cond; {183662#false} is VALID [2022-04-08 06:11:41,039 INFO L290 TraceCheckUtils]: 165: Hoare triple {183662#false} assume 0 == ~cond; {183662#false} is VALID [2022-04-08 06:11:41,039 INFO L290 TraceCheckUtils]: 166: Hoare triple {183662#false} assume !false; {183662#false} is VALID [2022-04-08 06:11:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 834 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:11:41,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:42,145 INFO L290 TraceCheckUtils]: 166: Hoare triple {183662#false} assume !false; {183662#false} is VALID [2022-04-08 06:11:42,145 INFO L290 TraceCheckUtils]: 165: Hoare triple {183662#false} assume 0 == ~cond; {183662#false} is VALID [2022-04-08 06:11:42,145 INFO L290 TraceCheckUtils]: 164: Hoare triple {183662#false} ~cond := #in~cond; {183662#false} is VALID [2022-04-08 06:11:42,145 INFO L272 TraceCheckUtils]: 163: Hoare triple {183662#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {183662#false} is VALID [2022-04-08 06:11:42,146 INFO L290 TraceCheckUtils]: 162: Hoare triple {184196#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {183662#false} is VALID [2022-04-08 06:11:42,146 INFO L290 TraceCheckUtils]: 161: Hoare triple {184200#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184196#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:11:42,146 INFO L290 TraceCheckUtils]: 160: Hoare triple {184200#(< ~counter~0 100)} assume !(~r~0 < 0); {184200#(< ~counter~0 100)} is VALID [2022-04-08 06:11:42,147 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183661#true} {184200#(< ~counter~0 100)} #98#return; {184200#(< ~counter~0 100)} is VALID [2022-04-08 06:11:42,147 INFO L290 TraceCheckUtils]: 158: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,147 INFO L290 TraceCheckUtils]: 157: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,147 INFO L290 TraceCheckUtils]: 156: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,147 INFO L272 TraceCheckUtils]: 155: Hoare triple {184200#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,147 INFO L290 TraceCheckUtils]: 154: Hoare triple {184200#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {184200#(< ~counter~0 100)} is VALID [2022-04-08 06:11:42,151 INFO L290 TraceCheckUtils]: 153: Hoare triple {184225#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184200#(< ~counter~0 100)} is VALID [2022-04-08 06:11:42,152 INFO L290 TraceCheckUtils]: 152: Hoare triple {184225#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184225#(< ~counter~0 99)} is VALID [2022-04-08 06:11:42,152 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183661#true} {184225#(< ~counter~0 99)} #98#return; {184225#(< ~counter~0 99)} is VALID [2022-04-08 06:11:42,152 INFO L290 TraceCheckUtils]: 150: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,152 INFO L290 TraceCheckUtils]: 149: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,152 INFO L290 TraceCheckUtils]: 148: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,152 INFO L272 TraceCheckUtils]: 147: Hoare triple {184225#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,152 INFO L290 TraceCheckUtils]: 146: Hoare triple {184225#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {184225#(< ~counter~0 99)} is VALID [2022-04-08 06:11:42,154 INFO L290 TraceCheckUtils]: 145: Hoare triple {184250#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184225#(< ~counter~0 99)} is VALID [2022-04-08 06:11:42,154 INFO L290 TraceCheckUtils]: 144: Hoare triple {184250#(< ~counter~0 98)} assume !(~r~0 > 0); {184250#(< ~counter~0 98)} is VALID [2022-04-08 06:11:42,155 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183661#true} {184250#(< ~counter~0 98)} #96#return; {184250#(< ~counter~0 98)} is VALID [2022-04-08 06:11:42,155 INFO L290 TraceCheckUtils]: 142: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,155 INFO L290 TraceCheckUtils]: 141: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,155 INFO L290 TraceCheckUtils]: 140: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,155 INFO L272 TraceCheckUtils]: 139: Hoare triple {184250#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,155 INFO L290 TraceCheckUtils]: 138: Hoare triple {184250#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {184250#(< ~counter~0 98)} is VALID [2022-04-08 06:11:42,157 INFO L290 TraceCheckUtils]: 137: Hoare triple {184275#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184250#(< ~counter~0 98)} is VALID [2022-04-08 06:11:42,157 INFO L290 TraceCheckUtils]: 136: Hoare triple {184275#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184275#(< ~counter~0 97)} is VALID [2022-04-08 06:11:42,157 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183661#true} {184275#(< ~counter~0 97)} #96#return; {184275#(< ~counter~0 97)} is VALID [2022-04-08 06:11:42,157 INFO L290 TraceCheckUtils]: 134: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,157 INFO L290 TraceCheckUtils]: 133: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,158 INFO L290 TraceCheckUtils]: 132: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,158 INFO L272 TraceCheckUtils]: 131: Hoare triple {184275#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,158 INFO L290 TraceCheckUtils]: 130: Hoare triple {184275#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {184275#(< ~counter~0 97)} is VALID [2022-04-08 06:11:42,160 INFO L290 TraceCheckUtils]: 129: Hoare triple {184300#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184275#(< ~counter~0 97)} is VALID [2022-04-08 06:11:42,160 INFO L290 TraceCheckUtils]: 128: Hoare triple {184300#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184300#(< ~counter~0 96)} is VALID [2022-04-08 06:11:42,160 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183661#true} {184300#(< ~counter~0 96)} #96#return; {184300#(< ~counter~0 96)} is VALID [2022-04-08 06:11:42,161 INFO L290 TraceCheckUtils]: 126: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,161 INFO L290 TraceCheckUtils]: 125: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,161 INFO L290 TraceCheckUtils]: 124: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,161 INFO L272 TraceCheckUtils]: 123: Hoare triple {184300#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,161 INFO L290 TraceCheckUtils]: 122: Hoare triple {184300#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {184300#(< ~counter~0 96)} is VALID [2022-04-08 06:11:42,165 INFO L290 TraceCheckUtils]: 121: Hoare triple {184325#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184300#(< ~counter~0 96)} is VALID [2022-04-08 06:11:42,165 INFO L290 TraceCheckUtils]: 120: Hoare triple {184325#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184325#(< ~counter~0 95)} is VALID [2022-04-08 06:11:42,166 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183661#true} {184325#(< ~counter~0 95)} #96#return; {184325#(< ~counter~0 95)} is VALID [2022-04-08 06:11:42,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,166 INFO L290 TraceCheckUtils]: 117: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,166 INFO L290 TraceCheckUtils]: 116: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,166 INFO L272 TraceCheckUtils]: 115: Hoare triple {184325#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,166 INFO L290 TraceCheckUtils]: 114: Hoare triple {184325#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {184325#(< ~counter~0 95)} is VALID [2022-04-08 06:11:42,170 INFO L290 TraceCheckUtils]: 113: Hoare triple {184350#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184325#(< ~counter~0 95)} is VALID [2022-04-08 06:11:42,170 INFO L290 TraceCheckUtils]: 112: Hoare triple {184350#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184350#(< ~counter~0 94)} is VALID [2022-04-08 06:11:42,171 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183661#true} {184350#(< ~counter~0 94)} #96#return; {184350#(< ~counter~0 94)} is VALID [2022-04-08 06:11:42,171 INFO L290 TraceCheckUtils]: 110: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,171 INFO L290 TraceCheckUtils]: 109: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,171 INFO L290 TraceCheckUtils]: 108: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,171 INFO L272 TraceCheckUtils]: 107: Hoare triple {184350#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {184350#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {184350#(< ~counter~0 94)} is VALID [2022-04-08 06:11:42,172 INFO L290 TraceCheckUtils]: 105: Hoare triple {184375#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184350#(< ~counter~0 94)} is VALID [2022-04-08 06:11:42,173 INFO L290 TraceCheckUtils]: 104: Hoare triple {184375#(< ~counter~0 93)} assume !!(0 != ~r~0); {184375#(< ~counter~0 93)} is VALID [2022-04-08 06:11:42,173 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183661#true} {184375#(< ~counter~0 93)} #94#return; {184375#(< ~counter~0 93)} is VALID [2022-04-08 06:11:42,173 INFO L290 TraceCheckUtils]: 102: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,173 INFO L290 TraceCheckUtils]: 101: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,173 INFO L290 TraceCheckUtils]: 100: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,173 INFO L272 TraceCheckUtils]: 99: Hoare triple {184375#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {184375#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {184375#(< ~counter~0 93)} is VALID [2022-04-08 06:11:42,175 INFO L290 TraceCheckUtils]: 97: Hoare triple {184400#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184375#(< ~counter~0 93)} is VALID [2022-04-08 06:11:42,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {184400#(< ~counter~0 92)} assume !(~r~0 < 0); {184400#(< ~counter~0 92)} is VALID [2022-04-08 06:11:42,176 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183661#true} {184400#(< ~counter~0 92)} #98#return; {184400#(< ~counter~0 92)} is VALID [2022-04-08 06:11:42,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,176 INFO L272 TraceCheckUtils]: 91: Hoare triple {184400#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {184400#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {184400#(< ~counter~0 92)} is VALID [2022-04-08 06:11:42,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {184425#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184400#(< ~counter~0 92)} is VALID [2022-04-08 06:11:42,178 INFO L290 TraceCheckUtils]: 88: Hoare triple {184425#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184425#(< ~counter~0 91)} is VALID [2022-04-08 06:11:42,178 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183661#true} {184425#(< ~counter~0 91)} #98#return; {184425#(< ~counter~0 91)} is VALID [2022-04-08 06:11:42,178 INFO L290 TraceCheckUtils]: 86: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,179 INFO L272 TraceCheckUtils]: 83: Hoare triple {184425#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {184425#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {184425#(< ~counter~0 91)} is VALID [2022-04-08 06:11:42,180 INFO L290 TraceCheckUtils]: 81: Hoare triple {184450#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184425#(< ~counter~0 91)} is VALID [2022-04-08 06:11:42,180 INFO L290 TraceCheckUtils]: 80: Hoare triple {184450#(< ~counter~0 90)} assume !(~r~0 > 0); {184450#(< ~counter~0 90)} is VALID [2022-04-08 06:11:42,181 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183661#true} {184450#(< ~counter~0 90)} #96#return; {184450#(< ~counter~0 90)} is VALID [2022-04-08 06:11:42,181 INFO L290 TraceCheckUtils]: 78: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,181 INFO L290 TraceCheckUtils]: 77: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,181 INFO L272 TraceCheckUtils]: 75: Hoare triple {184450#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,181 INFO L290 TraceCheckUtils]: 74: Hoare triple {184450#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {184450#(< ~counter~0 90)} is VALID [2022-04-08 06:11:42,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {184475#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184450#(< ~counter~0 90)} is VALID [2022-04-08 06:11:42,183 INFO L290 TraceCheckUtils]: 72: Hoare triple {184475#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184475#(< ~counter~0 89)} is VALID [2022-04-08 06:11:42,184 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183661#true} {184475#(< ~counter~0 89)} #96#return; {184475#(< ~counter~0 89)} is VALID [2022-04-08 06:11:42,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,184 INFO L290 TraceCheckUtils]: 69: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,184 INFO L272 TraceCheckUtils]: 67: Hoare triple {184475#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {184475#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {184475#(< ~counter~0 89)} is VALID [2022-04-08 06:11:42,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {184500#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184475#(< ~counter~0 89)} is VALID [2022-04-08 06:11:42,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {184500#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184500#(< ~counter~0 88)} is VALID [2022-04-08 06:11:42,186 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183661#true} {184500#(< ~counter~0 88)} #96#return; {184500#(< ~counter~0 88)} is VALID [2022-04-08 06:11:42,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,186 INFO L272 TraceCheckUtils]: 59: Hoare triple {184500#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {184500#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {184500#(< ~counter~0 88)} is VALID [2022-04-08 06:11:42,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {184525#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184500#(< ~counter~0 88)} is VALID [2022-04-08 06:11:42,188 INFO L290 TraceCheckUtils]: 56: Hoare triple {184525#(< ~counter~0 87)} assume !!(0 != ~r~0); {184525#(< ~counter~0 87)} is VALID [2022-04-08 06:11:42,189 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183661#true} {184525#(< ~counter~0 87)} #94#return; {184525#(< ~counter~0 87)} is VALID [2022-04-08 06:11:42,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,189 INFO L272 TraceCheckUtils]: 51: Hoare triple {184525#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {184525#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {184525#(< ~counter~0 87)} is VALID [2022-04-08 06:11:42,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {184550#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184525#(< ~counter~0 87)} is VALID [2022-04-08 06:11:42,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {184550#(< ~counter~0 86)} assume !(~r~0 < 0); {184550#(< ~counter~0 86)} is VALID [2022-04-08 06:11:42,191 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183661#true} {184550#(< ~counter~0 86)} #98#return; {184550#(< ~counter~0 86)} is VALID [2022-04-08 06:11:42,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,191 INFO L272 TraceCheckUtils]: 43: Hoare triple {184550#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,192 INFO L290 TraceCheckUtils]: 42: Hoare triple {184550#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {184550#(< ~counter~0 86)} is VALID [2022-04-08 06:11:42,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {184575#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184550#(< ~counter~0 86)} is VALID [2022-04-08 06:11:42,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {184575#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184575#(< ~counter~0 85)} is VALID [2022-04-08 06:11:42,194 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183661#true} {184575#(< ~counter~0 85)} #98#return; {184575#(< ~counter~0 85)} is VALID [2022-04-08 06:11:42,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,194 INFO L272 TraceCheckUtils]: 35: Hoare triple {184575#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {184575#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {184575#(< ~counter~0 85)} is VALID [2022-04-08 06:11:42,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {184600#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184575#(< ~counter~0 85)} is VALID [2022-04-08 06:11:42,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {184600#(< ~counter~0 84)} assume !(~r~0 > 0); {184600#(< ~counter~0 84)} is VALID [2022-04-08 06:11:42,196 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183661#true} {184600#(< ~counter~0 84)} #96#return; {184600#(< ~counter~0 84)} is VALID [2022-04-08 06:11:42,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,197 INFO L272 TraceCheckUtils]: 27: Hoare triple {184600#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {184600#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {184600#(< ~counter~0 84)} is VALID [2022-04-08 06:11:42,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {184625#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184600#(< ~counter~0 84)} is VALID [2022-04-08 06:11:42,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {184625#(< ~counter~0 83)} assume !!(0 != ~r~0); {184625#(< ~counter~0 83)} is VALID [2022-04-08 06:11:42,199 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183661#true} {184625#(< ~counter~0 83)} #94#return; {184625#(< ~counter~0 83)} is VALID [2022-04-08 06:11:42,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,199 INFO L272 TraceCheckUtils]: 19: Hoare triple {184625#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {184625#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {184625#(< ~counter~0 83)} is VALID [2022-04-08 06:11:42,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {184650#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184625#(< ~counter~0 83)} is VALID [2022-04-08 06:11:42,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {184650#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183661#true} {184650#(< ~counter~0 82)} #92#return; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L272 TraceCheckUtils]: 11: Hoare triple {184650#(< ~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)); {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183661#true} {184650#(< ~counter~0 82)} #90#return; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-08 06:11:42,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {184650#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183661#true} is VALID [2022-04-08 06:11:42,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {184650#(< ~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; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {184650#(< ~counter~0 82)} call #t~ret9 := main(); {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184650#(< ~counter~0 82)} {183661#true} #102#return; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {184650#(< ~counter~0 82)} assume true; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {183661#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {184650#(< ~counter~0 82)} is VALID [2022-04-08 06:11:42,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {183661#true} call ULTIMATE.init(); {183661#true} is VALID [2022-04-08 06:11:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 06:11:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:42,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777893191] [2022-04-08 06:11:42,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:42,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837568165] [2022-04-08 06:11:42,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837568165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:42,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:42,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 06:11:42,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:42,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006238569] [2022-04-08 06:11:42,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006238569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:42,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:42,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 06:11:42,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283458216] [2022-04-08 06:11:42,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-08 06:11:42,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:42,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:11:42,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:42,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 06:11:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 06:11:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 06:11:42,442 INFO L87 Difference]: Start difference. First operand 907 states and 1204 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:11:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:48,987 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-08 06:11:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 06:11:48,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 167 [2022-04-08 06:11:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:11:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 06:11:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:11:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-08 06:11:48,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-08 06:11:49,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:49,551 INFO L225 Difference]: With dead ends: 958 [2022-04-08 06:11:49,551 INFO L226 Difference]: Without dead ends: 953 [2022-04-08 06:11:49,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1358, Invalid=1834, Unknown=0, NotChecked=0, Total=3192 [2022-04-08 06:11:49,552 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 352 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:49,552 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 371 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:11:49,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-08 06:11:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-08 06:11:53,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:53,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:11:53,900 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:11:53,900 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:11:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:53,930 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 06:11:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 06:11:53,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:53,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:53,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 06:11:53,932 INFO L87 Difference]: Start difference. First operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 953 states. [2022-04-08 06:11:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:53,975 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-08 06:11:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-08 06:11:53,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:53,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:53,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:53,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 693 states have (on average 1.1746031746031746) internal successors, (814), 710 states have internal predecessors, (814), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:11:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-08 06:11:54,015 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-08 06:11:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:54,015 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-08 06:11:54,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:11:54,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-08 06:12:08,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1241 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-08 06:12:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-08 06:12:08,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:08,247 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 10, 10, 10, 10, 7, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:12:08,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-08 06:12:08,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-08 06:12:08,447 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:08,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-08 06:12:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296507363] [2022-04-08 06:12:08,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-08 06:12:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253306023] [2022-04-08 06:12:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:08,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:08,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268142797] [2022-04-08 06:12:08,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:12:08,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:08,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:08,468 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:12:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 06:12:08,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:12:08,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:08,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 06:12:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:08,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:09,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {190418#true} call ULTIMATE.init(); {190418#true} is VALID [2022-04-08 06:12:09,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {190418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190426#(<= ~counter~0 0)} {190418#true} #102#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {190426#(<= ~counter~0 0)} call #t~ret9 := main(); {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {190426#(<= ~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; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {190426#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {190426#(<= ~counter~0 0)} ~cond := #in~cond; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {190426#(<= ~counter~0 0)} assume !(0 == ~cond); {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190426#(<= ~counter~0 0)} {190426#(<= ~counter~0 0)} #90#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,584 INFO L272 TraceCheckUtils]: 11: Hoare triple {190426#(<= ~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)); {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {190426#(<= ~counter~0 0)} ~cond := #in~cond; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {190426#(<= ~counter~0 0)} assume !(0 == ~cond); {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,585 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190426#(<= ~counter~0 0)} {190426#(<= ~counter~0 0)} #92#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {190426#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {190426#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:09,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {190426#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {190475#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,612 INFO L272 TraceCheckUtils]: 19: Hoare triple {190475#(<= ~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)); {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {190475#(<= ~counter~0 1)} ~cond := #in~cond; {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {190475#(<= ~counter~0 1)} assume !(0 == ~cond); {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {190475#(<= ~counter~0 1)} assume true; {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,612 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190475#(<= ~counter~0 1)} {190475#(<= ~counter~0 1)} #94#return; {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {190475#(<= ~counter~0 1)} assume !!(0 != ~r~0); {190475#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:09,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {190475#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {190500#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,617 INFO L272 TraceCheckUtils]: 27: Hoare triple {190500#(<= ~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)); {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {190500#(<= ~counter~0 2)} ~cond := #in~cond; {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {190500#(<= ~counter~0 2)} assume !(0 == ~cond); {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {190500#(<= ~counter~0 2)} assume true; {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,618 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190500#(<= ~counter~0 2)} {190500#(<= ~counter~0 2)} #96#return; {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {190500#(<= ~counter~0 2)} assume !(~r~0 > 0); {190500#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:09,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {190500#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {190525#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,620 INFO L272 TraceCheckUtils]: 35: Hoare triple {190525#(<= ~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)); {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {190525#(<= ~counter~0 3)} ~cond := #in~cond; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {190525#(<= ~counter~0 3)} assume !(0 == ~cond); {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {190525#(<= ~counter~0 3)} assume true; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,621 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190525#(<= ~counter~0 3)} {190525#(<= ~counter~0 3)} #98#return; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,621 INFO L290 TraceCheckUtils]: 40: Hoare triple {190525#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190525#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:09,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {190525#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {190550#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,623 INFO L272 TraceCheckUtils]: 43: Hoare triple {190550#(<= ~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)); {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {190550#(<= ~counter~0 4)} ~cond := #in~cond; {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {190550#(<= ~counter~0 4)} assume !(0 == ~cond); {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {190550#(<= ~counter~0 4)} assume true; {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,624 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190550#(<= ~counter~0 4)} {190550#(<= ~counter~0 4)} #98#return; {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {190550#(<= ~counter~0 4)} assume !(~r~0 < 0); {190550#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:09,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {190550#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {190575#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,626 INFO L272 TraceCheckUtils]: 51: Hoare triple {190575#(<= ~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)); {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {190575#(<= ~counter~0 5)} ~cond := #in~cond; {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {190575#(<= ~counter~0 5)} assume !(0 == ~cond); {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {190575#(<= ~counter~0 5)} assume true; {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,627 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190575#(<= ~counter~0 5)} {190575#(<= ~counter~0 5)} #94#return; {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {190575#(<= ~counter~0 5)} assume !!(0 != ~r~0); {190575#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:09,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {190575#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {190600#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,629 INFO L272 TraceCheckUtils]: 59: Hoare triple {190600#(<= ~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)); {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {190600#(<= ~counter~0 6)} ~cond := #in~cond; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {190600#(<= ~counter~0 6)} assume !(0 == ~cond); {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {190600#(<= ~counter~0 6)} assume true; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,629 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190600#(<= ~counter~0 6)} {190600#(<= ~counter~0 6)} #96#return; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {190600#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190600#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:09,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {190600#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {190625#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,631 INFO L272 TraceCheckUtils]: 67: Hoare triple {190625#(<= ~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)); {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {190625#(<= ~counter~0 7)} ~cond := #in~cond; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {190625#(<= ~counter~0 7)} assume !(0 == ~cond); {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {190625#(<= ~counter~0 7)} assume true; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190625#(<= ~counter~0 7)} {190625#(<= ~counter~0 7)} #96#return; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,632 INFO L290 TraceCheckUtils]: 72: Hoare triple {190625#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190625#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:09,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {190625#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {190650#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,634 INFO L272 TraceCheckUtils]: 75: Hoare triple {190650#(<= ~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)); {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {190650#(<= ~counter~0 8)} ~cond := #in~cond; {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {190650#(<= ~counter~0 8)} assume !(0 == ~cond); {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,635 INFO L290 TraceCheckUtils]: 78: Hoare triple {190650#(<= ~counter~0 8)} assume true; {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,635 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190650#(<= ~counter~0 8)} {190650#(<= ~counter~0 8)} #96#return; {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,635 INFO L290 TraceCheckUtils]: 80: Hoare triple {190650#(<= ~counter~0 8)} assume !(~r~0 > 0); {190650#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:09,637 INFO L290 TraceCheckUtils]: 81: Hoare triple {190650#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,637 INFO L290 TraceCheckUtils]: 82: Hoare triple {190675#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,637 INFO L272 TraceCheckUtils]: 83: Hoare triple {190675#(<= ~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)); {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {190675#(<= ~counter~0 9)} ~cond := #in~cond; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,638 INFO L290 TraceCheckUtils]: 85: Hoare triple {190675#(<= ~counter~0 9)} assume !(0 == ~cond); {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,638 INFO L290 TraceCheckUtils]: 86: Hoare triple {190675#(<= ~counter~0 9)} assume true; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,638 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190675#(<= ~counter~0 9)} {190675#(<= ~counter~0 9)} #98#return; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,638 INFO L290 TraceCheckUtils]: 88: Hoare triple {190675#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190675#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:09,640 INFO L290 TraceCheckUtils]: 89: Hoare triple {190675#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,640 INFO L290 TraceCheckUtils]: 90: Hoare triple {190700#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,640 INFO L272 TraceCheckUtils]: 91: Hoare triple {190700#(<= ~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)); {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,640 INFO L290 TraceCheckUtils]: 92: Hoare triple {190700#(<= ~counter~0 10)} ~cond := #in~cond; {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,641 INFO L290 TraceCheckUtils]: 93: Hoare triple {190700#(<= ~counter~0 10)} assume !(0 == ~cond); {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,641 INFO L290 TraceCheckUtils]: 94: Hoare triple {190700#(<= ~counter~0 10)} assume true; {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,641 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190700#(<= ~counter~0 10)} {190700#(<= ~counter~0 10)} #98#return; {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {190700#(<= ~counter~0 10)} assume !(~r~0 < 0); {190700#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:09,642 INFO L290 TraceCheckUtils]: 97: Hoare triple {190700#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,643 INFO L290 TraceCheckUtils]: 98: Hoare triple {190725#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,643 INFO L272 TraceCheckUtils]: 99: Hoare triple {190725#(<= ~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)); {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {190725#(<= ~counter~0 11)} ~cond := #in~cond; {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,643 INFO L290 TraceCheckUtils]: 101: Hoare triple {190725#(<= ~counter~0 11)} assume !(0 == ~cond); {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,644 INFO L290 TraceCheckUtils]: 102: Hoare triple {190725#(<= ~counter~0 11)} assume true; {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,644 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190725#(<= ~counter~0 11)} {190725#(<= ~counter~0 11)} #94#return; {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {190725#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190725#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:09,645 INFO L290 TraceCheckUtils]: 105: Hoare triple {190725#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,645 INFO L290 TraceCheckUtils]: 106: Hoare triple {190750#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,646 INFO L272 TraceCheckUtils]: 107: Hoare triple {190750#(<= ~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)); {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,646 INFO L290 TraceCheckUtils]: 108: Hoare triple {190750#(<= ~counter~0 12)} ~cond := #in~cond; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,646 INFO L290 TraceCheckUtils]: 109: Hoare triple {190750#(<= ~counter~0 12)} assume !(0 == ~cond); {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,646 INFO L290 TraceCheckUtils]: 110: Hoare triple {190750#(<= ~counter~0 12)} assume true; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,647 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190750#(<= ~counter~0 12)} {190750#(<= ~counter~0 12)} #96#return; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,647 INFO L290 TraceCheckUtils]: 112: Hoare triple {190750#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190750#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:09,648 INFO L290 TraceCheckUtils]: 113: Hoare triple {190750#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,648 INFO L290 TraceCheckUtils]: 114: Hoare triple {190775#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,649 INFO L272 TraceCheckUtils]: 115: Hoare triple {190775#(<= ~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)); {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,649 INFO L290 TraceCheckUtils]: 116: Hoare triple {190775#(<= ~counter~0 13)} ~cond := #in~cond; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,649 INFO L290 TraceCheckUtils]: 117: Hoare triple {190775#(<= ~counter~0 13)} assume !(0 == ~cond); {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,649 INFO L290 TraceCheckUtils]: 118: Hoare triple {190775#(<= ~counter~0 13)} assume true; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,650 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190775#(<= ~counter~0 13)} {190775#(<= ~counter~0 13)} #96#return; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,650 INFO L290 TraceCheckUtils]: 120: Hoare triple {190775#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190775#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:09,651 INFO L290 TraceCheckUtils]: 121: Hoare triple {190775#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,651 INFO L290 TraceCheckUtils]: 122: Hoare triple {190800#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,652 INFO L272 TraceCheckUtils]: 123: Hoare triple {190800#(<= ~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)); {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,652 INFO L290 TraceCheckUtils]: 124: Hoare triple {190800#(<= ~counter~0 14)} ~cond := #in~cond; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,652 INFO L290 TraceCheckUtils]: 125: Hoare triple {190800#(<= ~counter~0 14)} assume !(0 == ~cond); {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,652 INFO L290 TraceCheckUtils]: 126: Hoare triple {190800#(<= ~counter~0 14)} assume true; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,653 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190800#(<= ~counter~0 14)} {190800#(<= ~counter~0 14)} #96#return; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,653 INFO L290 TraceCheckUtils]: 128: Hoare triple {190800#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190800#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:09,654 INFO L290 TraceCheckUtils]: 129: Hoare triple {190800#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,654 INFO L290 TraceCheckUtils]: 130: Hoare triple {190825#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,655 INFO L272 TraceCheckUtils]: 131: Hoare triple {190825#(<= ~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)); {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,655 INFO L290 TraceCheckUtils]: 132: Hoare triple {190825#(<= ~counter~0 15)} ~cond := #in~cond; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,655 INFO L290 TraceCheckUtils]: 133: Hoare triple {190825#(<= ~counter~0 15)} assume !(0 == ~cond); {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,655 INFO L290 TraceCheckUtils]: 134: Hoare triple {190825#(<= ~counter~0 15)} assume true; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,656 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190825#(<= ~counter~0 15)} {190825#(<= ~counter~0 15)} #96#return; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,656 INFO L290 TraceCheckUtils]: 136: Hoare triple {190825#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190825#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:09,659 INFO L290 TraceCheckUtils]: 137: Hoare triple {190825#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,660 INFO L290 TraceCheckUtils]: 138: Hoare triple {190850#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,660 INFO L272 TraceCheckUtils]: 139: Hoare triple {190850#(<= ~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)); {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,660 INFO L290 TraceCheckUtils]: 140: Hoare triple {190850#(<= ~counter~0 16)} ~cond := #in~cond; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,660 INFO L290 TraceCheckUtils]: 141: Hoare triple {190850#(<= ~counter~0 16)} assume !(0 == ~cond); {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,661 INFO L290 TraceCheckUtils]: 142: Hoare triple {190850#(<= ~counter~0 16)} assume true; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,661 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190850#(<= ~counter~0 16)} {190850#(<= ~counter~0 16)} #96#return; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,661 INFO L290 TraceCheckUtils]: 144: Hoare triple {190850#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {190850#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:09,662 INFO L290 TraceCheckUtils]: 145: Hoare triple {190850#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,663 INFO L290 TraceCheckUtils]: 146: Hoare triple {190875#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,691 INFO L272 TraceCheckUtils]: 147: Hoare triple {190875#(<= ~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)); {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,691 INFO L290 TraceCheckUtils]: 148: Hoare triple {190875#(<= ~counter~0 17)} ~cond := #in~cond; {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,692 INFO L290 TraceCheckUtils]: 149: Hoare triple {190875#(<= ~counter~0 17)} assume !(0 == ~cond); {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,692 INFO L290 TraceCheckUtils]: 150: Hoare triple {190875#(<= ~counter~0 17)} assume true; {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,692 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190875#(<= ~counter~0 17)} {190875#(<= ~counter~0 17)} #96#return; {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,692 INFO L290 TraceCheckUtils]: 152: Hoare triple {190875#(<= ~counter~0 17)} assume !(~r~0 > 0); {190875#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:09,696 INFO L290 TraceCheckUtils]: 153: Hoare triple {190875#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,697 INFO L290 TraceCheckUtils]: 154: Hoare triple {190900#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,697 INFO L272 TraceCheckUtils]: 155: Hoare triple {190900#(<= ~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)); {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,697 INFO L290 TraceCheckUtils]: 156: Hoare triple {190900#(<= ~counter~0 18)} ~cond := #in~cond; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,697 INFO L290 TraceCheckUtils]: 157: Hoare triple {190900#(<= ~counter~0 18)} assume !(0 == ~cond); {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,697 INFO L290 TraceCheckUtils]: 158: Hoare triple {190900#(<= ~counter~0 18)} assume true; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,698 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190900#(<= ~counter~0 18)} {190900#(<= ~counter~0 18)} #98#return; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,698 INFO L290 TraceCheckUtils]: 160: Hoare triple {190900#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190900#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:09,698 INFO L290 TraceCheckUtils]: 161: Hoare triple {190900#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190925#(<= |main_#t~post8| 18)} is VALID [2022-04-08 06:12:09,698 INFO L290 TraceCheckUtils]: 162: Hoare triple {190925#(<= |main_#t~post8| 18)} assume !(#t~post8 < 100);havoc #t~post8; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L290 TraceCheckUtils]: 163: Hoare triple {190419#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L290 TraceCheckUtils]: 164: Hoare triple {190419#false} assume !(#t~post6 < 100);havoc #t~post6; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L272 TraceCheckUtils]: 165: Hoare triple {190419#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L290 TraceCheckUtils]: 166: Hoare triple {190419#false} ~cond := #in~cond; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L290 TraceCheckUtils]: 167: Hoare triple {190419#false} assume 0 == ~cond; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L290 TraceCheckUtils]: 168: Hoare triple {190419#false} assume !false; {190419#false} is VALID [2022-04-08 06:12:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 854 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:12:09,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 168: Hoare triple {190419#false} assume !false; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 167: Hoare triple {190419#false} assume 0 == ~cond; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 166: Hoare triple {190419#false} ~cond := #in~cond; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L272 TraceCheckUtils]: 165: Hoare triple {190419#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 164: Hoare triple {190419#false} assume !(#t~post6 < 100);havoc #t~post6; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 163: Hoare triple {190419#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 162: Hoare triple {190965#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {190419#false} is VALID [2022-04-08 06:12:10,620 INFO L290 TraceCheckUtils]: 161: Hoare triple {190969#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190965#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:12:10,621 INFO L290 TraceCheckUtils]: 160: Hoare triple {190969#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190969#(< ~counter~0 100)} is VALID [2022-04-08 06:12:10,621 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190418#true} {190969#(< ~counter~0 100)} #98#return; {190969#(< ~counter~0 100)} is VALID [2022-04-08 06:12:10,621 INFO L290 TraceCheckUtils]: 158: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,621 INFO L290 TraceCheckUtils]: 157: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,621 INFO L290 TraceCheckUtils]: 156: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,621 INFO L272 TraceCheckUtils]: 155: Hoare triple {190969#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,621 INFO L290 TraceCheckUtils]: 154: Hoare triple {190969#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {190969#(< ~counter~0 100)} is VALID [2022-04-08 06:12:10,625 INFO L290 TraceCheckUtils]: 153: Hoare triple {190994#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190969#(< ~counter~0 100)} is VALID [2022-04-08 06:12:10,625 INFO L290 TraceCheckUtils]: 152: Hoare triple {190994#(< ~counter~0 99)} assume !(~r~0 > 0); {190994#(< ~counter~0 99)} is VALID [2022-04-08 06:12:10,626 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190418#true} {190994#(< ~counter~0 99)} #96#return; {190994#(< ~counter~0 99)} is VALID [2022-04-08 06:12:10,626 INFO L290 TraceCheckUtils]: 150: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,626 INFO L290 TraceCheckUtils]: 149: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,626 INFO L290 TraceCheckUtils]: 148: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,626 INFO L272 TraceCheckUtils]: 147: Hoare triple {190994#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,626 INFO L290 TraceCheckUtils]: 146: Hoare triple {190994#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {190994#(< ~counter~0 99)} is VALID [2022-04-08 06:12:10,627 INFO L290 TraceCheckUtils]: 145: Hoare triple {191019#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190994#(< ~counter~0 99)} is VALID [2022-04-08 06:12:10,627 INFO L290 TraceCheckUtils]: 144: Hoare triple {191019#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191019#(< ~counter~0 98)} is VALID [2022-04-08 06:12:10,628 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190418#true} {191019#(< ~counter~0 98)} #96#return; {191019#(< ~counter~0 98)} is VALID [2022-04-08 06:12:10,628 INFO L290 TraceCheckUtils]: 142: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,628 INFO L290 TraceCheckUtils]: 141: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,628 INFO L290 TraceCheckUtils]: 140: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,628 INFO L272 TraceCheckUtils]: 139: Hoare triple {191019#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {191019#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {191019#(< ~counter~0 98)} is VALID [2022-04-08 06:12:10,629 INFO L290 TraceCheckUtils]: 137: Hoare triple {191044#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191019#(< ~counter~0 98)} is VALID [2022-04-08 06:12:10,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {191044#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191044#(< ~counter~0 97)} is VALID [2022-04-08 06:12:10,630 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190418#true} {191044#(< ~counter~0 97)} #96#return; {191044#(< ~counter~0 97)} is VALID [2022-04-08 06:12:10,630 INFO L290 TraceCheckUtils]: 134: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,630 INFO L290 TraceCheckUtils]: 133: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,630 INFO L290 TraceCheckUtils]: 132: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,630 INFO L272 TraceCheckUtils]: 131: Hoare triple {191044#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,630 INFO L290 TraceCheckUtils]: 130: Hoare triple {191044#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {191044#(< ~counter~0 97)} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 129: Hoare triple {191069#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191044#(< ~counter~0 97)} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 128: Hoare triple {191069#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191069#(< ~counter~0 96)} is VALID [2022-04-08 06:12:10,632 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190418#true} {191069#(< ~counter~0 96)} #96#return; {191069#(< ~counter~0 96)} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 126: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 125: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 124: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,632 INFO L272 TraceCheckUtils]: 123: Hoare triple {191069#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,632 INFO L290 TraceCheckUtils]: 122: Hoare triple {191069#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {191069#(< ~counter~0 96)} is VALID [2022-04-08 06:12:10,634 INFO L290 TraceCheckUtils]: 121: Hoare triple {191094#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191069#(< ~counter~0 96)} is VALID [2022-04-08 06:12:10,634 INFO L290 TraceCheckUtils]: 120: Hoare triple {191094#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191094#(< ~counter~0 95)} is VALID [2022-04-08 06:12:10,634 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190418#true} {191094#(< ~counter~0 95)} #96#return; {191094#(< ~counter~0 95)} is VALID [2022-04-08 06:12:10,634 INFO L290 TraceCheckUtils]: 118: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,634 INFO L290 TraceCheckUtils]: 117: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,634 INFO L290 TraceCheckUtils]: 116: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,634 INFO L272 TraceCheckUtils]: 115: Hoare triple {191094#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,635 INFO L290 TraceCheckUtils]: 114: Hoare triple {191094#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {191094#(< ~counter~0 95)} is VALID [2022-04-08 06:12:10,636 INFO L290 TraceCheckUtils]: 113: Hoare triple {191119#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191094#(< ~counter~0 95)} is VALID [2022-04-08 06:12:10,636 INFO L290 TraceCheckUtils]: 112: Hoare triple {191119#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191119#(< ~counter~0 94)} is VALID [2022-04-08 06:12:10,636 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190418#true} {191119#(< ~counter~0 94)} #96#return; {191119#(< ~counter~0 94)} is VALID [2022-04-08 06:12:10,636 INFO L290 TraceCheckUtils]: 110: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,636 INFO L290 TraceCheckUtils]: 109: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,636 INFO L290 TraceCheckUtils]: 108: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,636 INFO L272 TraceCheckUtils]: 107: Hoare triple {191119#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,637 INFO L290 TraceCheckUtils]: 106: Hoare triple {191119#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {191119#(< ~counter~0 94)} is VALID [2022-04-08 06:12:10,638 INFO L290 TraceCheckUtils]: 105: Hoare triple {191144#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191119#(< ~counter~0 94)} is VALID [2022-04-08 06:12:10,638 INFO L290 TraceCheckUtils]: 104: Hoare triple {191144#(< ~counter~0 93)} assume !!(0 != ~r~0); {191144#(< ~counter~0 93)} is VALID [2022-04-08 06:12:10,638 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190418#true} {191144#(< ~counter~0 93)} #94#return; {191144#(< ~counter~0 93)} is VALID [2022-04-08 06:12:10,638 INFO L290 TraceCheckUtils]: 102: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,638 INFO L290 TraceCheckUtils]: 101: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,639 INFO L272 TraceCheckUtils]: 99: Hoare triple {191144#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {191144#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {191144#(< ~counter~0 93)} is VALID [2022-04-08 06:12:10,640 INFO L290 TraceCheckUtils]: 97: Hoare triple {191169#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191144#(< ~counter~0 93)} is VALID [2022-04-08 06:12:10,640 INFO L290 TraceCheckUtils]: 96: Hoare triple {191169#(< ~counter~0 92)} assume !(~r~0 < 0); {191169#(< ~counter~0 92)} is VALID [2022-04-08 06:12:10,641 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190418#true} {191169#(< ~counter~0 92)} #98#return; {191169#(< ~counter~0 92)} is VALID [2022-04-08 06:12:10,641 INFO L290 TraceCheckUtils]: 94: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,641 INFO L290 TraceCheckUtils]: 93: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,641 INFO L290 TraceCheckUtils]: 92: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,641 INFO L272 TraceCheckUtils]: 91: Hoare triple {191169#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,641 INFO L290 TraceCheckUtils]: 90: Hoare triple {191169#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {191169#(< ~counter~0 92)} is VALID [2022-04-08 06:12:10,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {191194#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191169#(< ~counter~0 92)} is VALID [2022-04-08 06:12:10,642 INFO L290 TraceCheckUtils]: 88: Hoare triple {191194#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191194#(< ~counter~0 91)} is VALID [2022-04-08 06:12:10,643 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190418#true} {191194#(< ~counter~0 91)} #98#return; {191194#(< ~counter~0 91)} is VALID [2022-04-08 06:12:10,643 INFO L290 TraceCheckUtils]: 86: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,643 INFO L290 TraceCheckUtils]: 85: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,643 INFO L272 TraceCheckUtils]: 83: Hoare triple {191194#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {191194#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {191194#(< ~counter~0 91)} is VALID [2022-04-08 06:12:10,644 INFO L290 TraceCheckUtils]: 81: Hoare triple {191219#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191194#(< ~counter~0 91)} is VALID [2022-04-08 06:12:10,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {191219#(< ~counter~0 90)} assume !(~r~0 > 0); {191219#(< ~counter~0 90)} is VALID [2022-04-08 06:12:10,645 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190418#true} {191219#(< ~counter~0 90)} #96#return; {191219#(< ~counter~0 90)} is VALID [2022-04-08 06:12:10,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,645 INFO L272 TraceCheckUtils]: 75: Hoare triple {191219#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {191219#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {191219#(< ~counter~0 90)} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 73: Hoare triple {191244#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191219#(< ~counter~0 90)} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {191244#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191244#(< ~counter~0 89)} is VALID [2022-04-08 06:12:10,647 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190418#true} {191244#(< ~counter~0 89)} #96#return; {191244#(< ~counter~0 89)} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,647 INFO L272 TraceCheckUtils]: 67: Hoare triple {191244#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {191244#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {191244#(< ~counter~0 89)} is VALID [2022-04-08 06:12:10,649 INFO L290 TraceCheckUtils]: 65: Hoare triple {191269#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191244#(< ~counter~0 89)} is VALID [2022-04-08 06:12:10,649 INFO L290 TraceCheckUtils]: 64: Hoare triple {191269#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191269#(< ~counter~0 88)} is VALID [2022-04-08 06:12:10,649 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190418#true} {191269#(< ~counter~0 88)} #96#return; {191269#(< ~counter~0 88)} is VALID [2022-04-08 06:12:10,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,649 INFO L272 TraceCheckUtils]: 59: Hoare triple {191269#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,650 INFO L290 TraceCheckUtils]: 58: Hoare triple {191269#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {191269#(< ~counter~0 88)} is VALID [2022-04-08 06:12:10,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {191294#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191269#(< ~counter~0 88)} is VALID [2022-04-08 06:12:10,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {191294#(< ~counter~0 87)} assume !!(0 != ~r~0); {191294#(< ~counter~0 87)} is VALID [2022-04-08 06:12:10,651 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190418#true} {191294#(< ~counter~0 87)} #94#return; {191294#(< ~counter~0 87)} is VALID [2022-04-08 06:12:10,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,652 INFO L272 TraceCheckUtils]: 51: Hoare triple {191294#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {191294#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {191294#(< ~counter~0 87)} is VALID [2022-04-08 06:12:10,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {191319#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191294#(< ~counter~0 87)} is VALID [2022-04-08 06:12:10,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {191319#(< ~counter~0 86)} assume !(~r~0 < 0); {191319#(< ~counter~0 86)} is VALID [2022-04-08 06:12:10,653 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190418#true} {191319#(< ~counter~0 86)} #98#return; {191319#(< ~counter~0 86)} is VALID [2022-04-08 06:12:10,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,654 INFO L272 TraceCheckUtils]: 43: Hoare triple {191319#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {191319#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {191319#(< ~counter~0 86)} is VALID [2022-04-08 06:12:10,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {191344#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191319#(< ~counter~0 86)} is VALID [2022-04-08 06:12:10,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {191344#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191344#(< ~counter~0 85)} is VALID [2022-04-08 06:12:10,656 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190418#true} {191344#(< ~counter~0 85)} #98#return; {191344#(< ~counter~0 85)} is VALID [2022-04-08 06:12:10,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,656 INFO L272 TraceCheckUtils]: 35: Hoare triple {191344#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {191344#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {191344#(< ~counter~0 85)} is VALID [2022-04-08 06:12:10,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {191369#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191344#(< ~counter~0 85)} is VALID [2022-04-08 06:12:10,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {191369#(< ~counter~0 84)} assume !(~r~0 > 0); {191369#(< ~counter~0 84)} is VALID [2022-04-08 06:12:10,658 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190418#true} {191369#(< ~counter~0 84)} #96#return; {191369#(< ~counter~0 84)} is VALID [2022-04-08 06:12:10,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,658 INFO L272 TraceCheckUtils]: 27: Hoare triple {191369#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {191369#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {191369#(< ~counter~0 84)} is VALID [2022-04-08 06:12:10,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {191394#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191369#(< ~counter~0 84)} is VALID [2022-04-08 06:12:10,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {191394#(< ~counter~0 83)} assume !!(0 != ~r~0); {191394#(< ~counter~0 83)} is VALID [2022-04-08 06:12:10,660 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190418#true} {191394#(< ~counter~0 83)} #94#return; {191394#(< ~counter~0 83)} is VALID [2022-04-08 06:12:10,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,660 INFO L272 TraceCheckUtils]: 19: Hoare triple {191394#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {191394#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {191394#(< ~counter~0 83)} is VALID [2022-04-08 06:12:10,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {191419#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191394#(< ~counter~0 83)} is VALID [2022-04-08 06:12:10,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {191419#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190418#true} {191419#(< ~counter~0 82)} #92#return; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {191419#(< ~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)); {190418#true} is VALID [2022-04-08 06:12:10,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190418#true} {191419#(< ~counter~0 82)} #90#return; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-08 06:12:10,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-08 06:12:10,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-08 06:12:10,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {191419#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {190418#true} is VALID [2022-04-08 06:12:10,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {191419#(< ~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; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {191419#(< ~counter~0 82)} call #t~ret9 := main(); {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191419#(< ~counter~0 82)} {190418#true} #102#return; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {191419#(< ~counter~0 82)} assume true; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {190418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {191419#(< ~counter~0 82)} is VALID [2022-04-08 06:12:10,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {190418#true} call ULTIMATE.init(); {190418#true} is VALID [2022-04-08 06:12:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 06:12:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:10,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253306023] [2022-04-08 06:12:10,664 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:12:10,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268142797] [2022-04-08 06:12:10,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268142797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:12:10,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:12:10,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 06:12:10,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:10,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296507363] [2022-04-08 06:12:10,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296507363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:10,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:10,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 06:12:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275992685] [2022-04-08 06:12:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 169 [2022-04-08 06:12:10,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:10,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:10,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:10,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 06:12:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 06:12:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 06:12:10,955 INFO L87 Difference]: Start difference. First operand 931 states and 1242 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:17,930 INFO L93 Difference]: Finished difference Result 1135 states and 1544 transitions. [2022-04-08 06:12:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 06:12:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 169 [2022-04-08 06:12:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 06:12:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-08 06:12:17,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-08 06:12:18,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:18,461 INFO L225 Difference]: With dead ends: 1135 [2022-04-08 06:12:18,461 INFO L226 Difference]: Without dead ends: 957 [2022-04-08 06:12:18,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1409, Invalid=1897, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 06:12:18,471 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 365 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:18,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 374 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 06:12:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-04-08 06:12:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 946. [2022-04-08 06:12:23,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:23,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:23,301 INFO L74 IsIncluded]: Start isIncluded. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:23,301 INFO L87 Difference]: Start difference. First operand 957 states. Second operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:23,343 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-08 06:12:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-08 06:12:23,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:23,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:23,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-08 06:12:23,346 INFO L87 Difference]: Start difference. First operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-08 06:12:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:23,377 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-08 06:12:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-08 06:12:23,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:23,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:23,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:23,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 708 states have (on average 1.1751412429378532) internal successors, (832), 720 states have internal predecessors, (832), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1260 transitions. [2022-04-08 06:12:23,427 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1260 transitions. Word has length 169 [2022-04-08 06:12:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:23,428 INFO L478 AbstractCegarLoop]: Abstraction has 946 states and 1260 transitions. [2022-04-08 06:12:23,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:23,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 946 states and 1260 transitions. [2022-04-08 06:12:36,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1260 edges. 1258 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1260 transitions. [2022-04-08 06:12:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 06:12:36,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:12:36,760 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:12:36,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 06:12:36,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-08 06:12:36,961 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:12:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:12:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 27 times [2022-04-08 06:12:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:36,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331751899] [2022-04-08 06:12:36,962 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:12:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 28 times [2022-04-08 06:12:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:12:36,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955541224] [2022-04-08 06:12:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:12:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:12:37,026 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:12:37,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402644417] [2022-04-08 06:12:37,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:12:37,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:12:37,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:12:37,027 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:12:37,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 06:12:37,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:12:37,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:12:37,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 06:12:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:12:37,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:12:38,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {197581#true} call ULTIMATE.init(); {197581#true} is VALID [2022-04-08 06:12:38,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {197581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197589#(<= ~counter~0 0)} {197581#true} #102#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {197589#(<= ~counter~0 0)} call #t~ret9 := main(); {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {197589#(<= ~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; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {197589#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {197589#(<= ~counter~0 0)} ~cond := #in~cond; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {197589#(<= ~counter~0 0)} assume !(0 == ~cond); {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197589#(<= ~counter~0 0)} {197589#(<= ~counter~0 0)} #90#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {197589#(<= ~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)); {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {197589#(<= ~counter~0 0)} ~cond := #in~cond; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {197589#(<= ~counter~0 0)} assume !(0 == ~cond); {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197589#(<= ~counter~0 0)} {197589#(<= ~counter~0 0)} #92#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {197589#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {197589#(<= ~counter~0 0)} is VALID [2022-04-08 06:12:38,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {197589#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {197638#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {197638#(<= ~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)); {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {197638#(<= ~counter~0 1)} ~cond := #in~cond; {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {197638#(<= ~counter~0 1)} assume !(0 == ~cond); {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {197638#(<= ~counter~0 1)} assume true; {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,061 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197638#(<= ~counter~0 1)} {197638#(<= ~counter~0 1)} #94#return; {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {197638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {197638#(<= ~counter~0 1)} is VALID [2022-04-08 06:12:38,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {197638#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {197663#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,063 INFO L272 TraceCheckUtils]: 27: Hoare triple {197663#(<= ~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)); {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {197663#(<= ~counter~0 2)} ~cond := #in~cond; {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {197663#(<= ~counter~0 2)} assume !(0 == ~cond); {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {197663#(<= ~counter~0 2)} assume true; {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,065 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197663#(<= ~counter~0 2)} {197663#(<= ~counter~0 2)} #96#return; {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {197663#(<= ~counter~0 2)} assume !(~r~0 > 0); {197663#(<= ~counter~0 2)} is VALID [2022-04-08 06:12:38,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {197663#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {197688#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,067 INFO L272 TraceCheckUtils]: 35: Hoare triple {197688#(<= ~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)); {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {197688#(<= ~counter~0 3)} ~cond := #in~cond; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {197688#(<= ~counter~0 3)} assume !(0 == ~cond); {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {197688#(<= ~counter~0 3)} assume true; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,069 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197688#(<= ~counter~0 3)} {197688#(<= ~counter~0 3)} #98#return; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {197688#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197688#(<= ~counter~0 3)} is VALID [2022-04-08 06:12:38,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {197688#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {197713#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,071 INFO L272 TraceCheckUtils]: 43: Hoare triple {197713#(<= ~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)); {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {197713#(<= ~counter~0 4)} ~cond := #in~cond; {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {197713#(<= ~counter~0 4)} assume !(0 == ~cond); {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {197713#(<= ~counter~0 4)} assume true; {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,073 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197713#(<= ~counter~0 4)} {197713#(<= ~counter~0 4)} #98#return; {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {197713#(<= ~counter~0 4)} assume !(~r~0 < 0); {197713#(<= ~counter~0 4)} is VALID [2022-04-08 06:12:38,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {197713#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {197738#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,075 INFO L272 TraceCheckUtils]: 51: Hoare triple {197738#(<= ~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)); {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {197738#(<= ~counter~0 5)} ~cond := #in~cond; {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {197738#(<= ~counter~0 5)} assume !(0 == ~cond); {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {197738#(<= ~counter~0 5)} assume true; {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,076 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197738#(<= ~counter~0 5)} {197738#(<= ~counter~0 5)} #94#return; {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {197738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {197738#(<= ~counter~0 5)} is VALID [2022-04-08 06:12:38,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {197738#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {197763#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,079 INFO L272 TraceCheckUtils]: 59: Hoare triple {197763#(<= ~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)); {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {197763#(<= ~counter~0 6)} ~cond := #in~cond; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,080 INFO L290 TraceCheckUtils]: 61: Hoare triple {197763#(<= ~counter~0 6)} assume !(0 == ~cond); {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {197763#(<= ~counter~0 6)} assume true; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,080 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197763#(<= ~counter~0 6)} {197763#(<= ~counter~0 6)} #96#return; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,081 INFO L290 TraceCheckUtils]: 64: Hoare triple {197763#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197763#(<= ~counter~0 6)} is VALID [2022-04-08 06:12:38,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {197763#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {197788#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,083 INFO L272 TraceCheckUtils]: 67: Hoare triple {197788#(<= ~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)); {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {197788#(<= ~counter~0 7)} ~cond := #in~cond; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {197788#(<= ~counter~0 7)} assume !(0 == ~cond); {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {197788#(<= ~counter~0 7)} assume true; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,084 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197788#(<= ~counter~0 7)} {197788#(<= ~counter~0 7)} #96#return; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {197788#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197788#(<= ~counter~0 7)} is VALID [2022-04-08 06:12:38,086 INFO L290 TraceCheckUtils]: 73: Hoare triple {197788#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,086 INFO L290 TraceCheckUtils]: 74: Hoare triple {197813#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,087 INFO L272 TraceCheckUtils]: 75: Hoare triple {197813#(<= ~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)); {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,087 INFO L290 TraceCheckUtils]: 76: Hoare triple {197813#(<= ~counter~0 8)} ~cond := #in~cond; {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,087 INFO L290 TraceCheckUtils]: 77: Hoare triple {197813#(<= ~counter~0 8)} assume !(0 == ~cond); {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,088 INFO L290 TraceCheckUtils]: 78: Hoare triple {197813#(<= ~counter~0 8)} assume true; {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,088 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197813#(<= ~counter~0 8)} {197813#(<= ~counter~0 8)} #96#return; {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {197813#(<= ~counter~0 8)} assume !(~r~0 > 0); {197813#(<= ~counter~0 8)} is VALID [2022-04-08 06:12:38,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {197813#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,090 INFO L290 TraceCheckUtils]: 82: Hoare triple {197838#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,091 INFO L272 TraceCheckUtils]: 83: Hoare triple {197838#(<= ~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)); {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,091 INFO L290 TraceCheckUtils]: 84: Hoare triple {197838#(<= ~counter~0 9)} ~cond := #in~cond; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {197838#(<= ~counter~0 9)} assume !(0 == ~cond); {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {197838#(<= ~counter~0 9)} assume true; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,092 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197838#(<= ~counter~0 9)} {197838#(<= ~counter~0 9)} #98#return; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {197838#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197838#(<= ~counter~0 9)} is VALID [2022-04-08 06:12:38,094 INFO L290 TraceCheckUtils]: 89: Hoare triple {197838#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,094 INFO L290 TraceCheckUtils]: 90: Hoare triple {197863#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,095 INFO L272 TraceCheckUtils]: 91: Hoare triple {197863#(<= ~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)); {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,095 INFO L290 TraceCheckUtils]: 92: Hoare triple {197863#(<= ~counter~0 10)} ~cond := #in~cond; {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,095 INFO L290 TraceCheckUtils]: 93: Hoare triple {197863#(<= ~counter~0 10)} assume !(0 == ~cond); {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,095 INFO L290 TraceCheckUtils]: 94: Hoare triple {197863#(<= ~counter~0 10)} assume true; {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,096 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197863#(<= ~counter~0 10)} {197863#(<= ~counter~0 10)} #98#return; {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {197863#(<= ~counter~0 10)} assume !(~r~0 < 0); {197863#(<= ~counter~0 10)} is VALID [2022-04-08 06:12:38,098 INFO L290 TraceCheckUtils]: 97: Hoare triple {197863#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,098 INFO L290 TraceCheckUtils]: 98: Hoare triple {197888#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,098 INFO L272 TraceCheckUtils]: 99: Hoare triple {197888#(<= ~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)); {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,099 INFO L290 TraceCheckUtils]: 100: Hoare triple {197888#(<= ~counter~0 11)} ~cond := #in~cond; {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,099 INFO L290 TraceCheckUtils]: 101: Hoare triple {197888#(<= ~counter~0 11)} assume !(0 == ~cond); {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,099 INFO L290 TraceCheckUtils]: 102: Hoare triple {197888#(<= ~counter~0 11)} assume true; {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,100 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197888#(<= ~counter~0 11)} {197888#(<= ~counter~0 11)} #94#return; {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {197888#(<= ~counter~0 11)} assume !!(0 != ~r~0); {197888#(<= ~counter~0 11)} is VALID [2022-04-08 06:12:38,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {197888#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {197913#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,102 INFO L272 TraceCheckUtils]: 107: Hoare triple {197913#(<= ~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)); {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,102 INFO L290 TraceCheckUtils]: 108: Hoare triple {197913#(<= ~counter~0 12)} ~cond := #in~cond; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {197913#(<= ~counter~0 12)} assume !(0 == ~cond); {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,103 INFO L290 TraceCheckUtils]: 110: Hoare triple {197913#(<= ~counter~0 12)} assume true; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,103 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197913#(<= ~counter~0 12)} {197913#(<= ~counter~0 12)} #96#return; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,104 INFO L290 TraceCheckUtils]: 112: Hoare triple {197913#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197913#(<= ~counter~0 12)} is VALID [2022-04-08 06:12:38,105 INFO L290 TraceCheckUtils]: 113: Hoare triple {197913#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,105 INFO L290 TraceCheckUtils]: 114: Hoare triple {197938#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,106 INFO L272 TraceCheckUtils]: 115: Hoare triple {197938#(<= ~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)); {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {197938#(<= ~counter~0 13)} ~cond := #in~cond; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,106 INFO L290 TraceCheckUtils]: 117: Hoare triple {197938#(<= ~counter~0 13)} assume !(0 == ~cond); {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {197938#(<= ~counter~0 13)} assume true; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,107 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197938#(<= ~counter~0 13)} {197938#(<= ~counter~0 13)} #96#return; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,107 INFO L290 TraceCheckUtils]: 120: Hoare triple {197938#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {197938#(<= ~counter~0 13)} is VALID [2022-04-08 06:12:38,109 INFO L290 TraceCheckUtils]: 121: Hoare triple {197938#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,109 INFO L290 TraceCheckUtils]: 122: Hoare triple {197963#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,110 INFO L272 TraceCheckUtils]: 123: Hoare triple {197963#(<= ~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)); {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,110 INFO L290 TraceCheckUtils]: 124: Hoare triple {197963#(<= ~counter~0 14)} ~cond := #in~cond; {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,110 INFO L290 TraceCheckUtils]: 125: Hoare triple {197963#(<= ~counter~0 14)} assume !(0 == ~cond); {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,111 INFO L290 TraceCheckUtils]: 126: Hoare triple {197963#(<= ~counter~0 14)} assume true; {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,111 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197963#(<= ~counter~0 14)} {197963#(<= ~counter~0 14)} #96#return; {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,111 INFO L290 TraceCheckUtils]: 128: Hoare triple {197963#(<= ~counter~0 14)} assume !(~r~0 > 0); {197963#(<= ~counter~0 14)} is VALID [2022-04-08 06:12:38,113 INFO L290 TraceCheckUtils]: 129: Hoare triple {197963#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,113 INFO L290 TraceCheckUtils]: 130: Hoare triple {197988#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,114 INFO L272 TraceCheckUtils]: 131: Hoare triple {197988#(<= ~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)); {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,114 INFO L290 TraceCheckUtils]: 132: Hoare triple {197988#(<= ~counter~0 15)} ~cond := #in~cond; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,114 INFO L290 TraceCheckUtils]: 133: Hoare triple {197988#(<= ~counter~0 15)} assume !(0 == ~cond); {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,115 INFO L290 TraceCheckUtils]: 134: Hoare triple {197988#(<= ~counter~0 15)} assume true; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,115 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197988#(<= ~counter~0 15)} {197988#(<= ~counter~0 15)} #98#return; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,115 INFO L290 TraceCheckUtils]: 136: Hoare triple {197988#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {197988#(<= ~counter~0 15)} is VALID [2022-04-08 06:12:38,117 INFO L290 TraceCheckUtils]: 137: Hoare triple {197988#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,117 INFO L290 TraceCheckUtils]: 138: Hoare triple {198013#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,118 INFO L272 TraceCheckUtils]: 139: Hoare triple {198013#(<= ~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)); {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,118 INFO L290 TraceCheckUtils]: 140: Hoare triple {198013#(<= ~counter~0 16)} ~cond := #in~cond; {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,118 INFO L290 TraceCheckUtils]: 141: Hoare triple {198013#(<= ~counter~0 16)} assume !(0 == ~cond); {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,118 INFO L290 TraceCheckUtils]: 142: Hoare triple {198013#(<= ~counter~0 16)} assume true; {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,119 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {198013#(<= ~counter~0 16)} {198013#(<= ~counter~0 16)} #98#return; {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,119 INFO L290 TraceCheckUtils]: 144: Hoare triple {198013#(<= ~counter~0 16)} assume !(~r~0 < 0); {198013#(<= ~counter~0 16)} is VALID [2022-04-08 06:12:38,121 INFO L290 TraceCheckUtils]: 145: Hoare triple {198013#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,121 INFO L290 TraceCheckUtils]: 146: Hoare triple {198038#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,122 INFO L272 TraceCheckUtils]: 147: Hoare triple {198038#(<= ~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)); {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,122 INFO L290 TraceCheckUtils]: 148: Hoare triple {198038#(<= ~counter~0 17)} ~cond := #in~cond; {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,122 INFO L290 TraceCheckUtils]: 149: Hoare triple {198038#(<= ~counter~0 17)} assume !(0 == ~cond); {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,122 INFO L290 TraceCheckUtils]: 150: Hoare triple {198038#(<= ~counter~0 17)} assume true; {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,123 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {198038#(<= ~counter~0 17)} {198038#(<= ~counter~0 17)} #94#return; {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,123 INFO L290 TraceCheckUtils]: 152: Hoare triple {198038#(<= ~counter~0 17)} assume !!(0 != ~r~0); {198038#(<= ~counter~0 17)} is VALID [2022-04-08 06:12:38,126 INFO L290 TraceCheckUtils]: 153: Hoare triple {198038#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,127 INFO L290 TraceCheckUtils]: 154: Hoare triple {198063#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,127 INFO L272 TraceCheckUtils]: 155: Hoare triple {198063#(<= ~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)); {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,127 INFO L290 TraceCheckUtils]: 156: Hoare triple {198063#(<= ~counter~0 18)} ~cond := #in~cond; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,128 INFO L290 TraceCheckUtils]: 157: Hoare triple {198063#(<= ~counter~0 18)} assume !(0 == ~cond); {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,128 INFO L290 TraceCheckUtils]: 158: Hoare triple {198063#(<= ~counter~0 18)} assume true; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,128 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {198063#(<= ~counter~0 18)} {198063#(<= ~counter~0 18)} #96#return; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,129 INFO L290 TraceCheckUtils]: 160: Hoare triple {198063#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198063#(<= ~counter~0 18)} is VALID [2022-04-08 06:12:38,129 INFO L290 TraceCheckUtils]: 161: Hoare triple {198063#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198088#(<= |main_#t~post7| 18)} is VALID [2022-04-08 06:12:38,129 INFO L290 TraceCheckUtils]: 162: Hoare triple {198088#(<= |main_#t~post7| 18)} assume !(#t~post7 < 100);havoc #t~post7; {197582#false} is VALID [2022-04-08 06:12:38,129 INFO L290 TraceCheckUtils]: 163: Hoare triple {197582#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 164: Hoare triple {197582#false} assume !(#t~post8 < 100);havoc #t~post8; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 165: Hoare triple {197582#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 166: Hoare triple {197582#false} assume !(#t~post6 < 100);havoc #t~post6; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L272 TraceCheckUtils]: 167: Hoare triple {197582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 168: Hoare triple {197582#false} ~cond := #in~cond; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 169: Hoare triple {197582#false} assume 0 == ~cond; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L290 TraceCheckUtils]: 170: Hoare triple {197582#false} assume !false; {197582#false} is VALID [2022-04-08 06:12:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 824 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:12:38,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:12:39,344 INFO L290 TraceCheckUtils]: 170: Hoare triple {197582#false} assume !false; {197582#false} is VALID [2022-04-08 06:12:39,344 INFO L290 TraceCheckUtils]: 169: Hoare triple {197582#false} assume 0 == ~cond; {197582#false} is VALID [2022-04-08 06:12:39,344 INFO L290 TraceCheckUtils]: 168: Hoare triple {197582#false} ~cond := #in~cond; {197582#false} is VALID [2022-04-08 06:12:39,344 INFO L272 TraceCheckUtils]: 167: Hoare triple {197582#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {197582#false} is VALID [2022-04-08 06:12:39,344 INFO L290 TraceCheckUtils]: 166: Hoare triple {197582#false} assume !(#t~post6 < 100);havoc #t~post6; {197582#false} is VALID [2022-04-08 06:12:39,344 INFO L290 TraceCheckUtils]: 165: Hoare triple {197582#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197582#false} is VALID [2022-04-08 06:12:39,345 INFO L290 TraceCheckUtils]: 164: Hoare triple {197582#false} assume !(#t~post8 < 100);havoc #t~post8; {197582#false} is VALID [2022-04-08 06:12:39,345 INFO L290 TraceCheckUtils]: 163: Hoare triple {197582#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197582#false} is VALID [2022-04-08 06:12:39,345 INFO L290 TraceCheckUtils]: 162: Hoare triple {198140#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {197582#false} is VALID [2022-04-08 06:12:39,345 INFO L290 TraceCheckUtils]: 161: Hoare triple {198144#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198140#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:12:39,345 INFO L290 TraceCheckUtils]: 160: Hoare triple {198144#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198144#(< ~counter~0 100)} is VALID [2022-04-08 06:12:39,346 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {197581#true} {198144#(< ~counter~0 100)} #96#return; {198144#(< ~counter~0 100)} is VALID [2022-04-08 06:12:39,346 INFO L290 TraceCheckUtils]: 158: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,346 INFO L290 TraceCheckUtils]: 157: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,346 INFO L290 TraceCheckUtils]: 156: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,346 INFO L272 TraceCheckUtils]: 155: Hoare triple {198144#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,346 INFO L290 TraceCheckUtils]: 154: Hoare triple {198144#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {198144#(< ~counter~0 100)} is VALID [2022-04-08 06:12:39,350 INFO L290 TraceCheckUtils]: 153: Hoare triple {198169#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198144#(< ~counter~0 100)} is VALID [2022-04-08 06:12:39,351 INFO L290 TraceCheckUtils]: 152: Hoare triple {198169#(< ~counter~0 99)} assume !!(0 != ~r~0); {198169#(< ~counter~0 99)} is VALID [2022-04-08 06:12:39,351 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {197581#true} {198169#(< ~counter~0 99)} #94#return; {198169#(< ~counter~0 99)} is VALID [2022-04-08 06:12:39,351 INFO L290 TraceCheckUtils]: 150: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,351 INFO L290 TraceCheckUtils]: 149: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,351 INFO L290 TraceCheckUtils]: 148: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,351 INFO L272 TraceCheckUtils]: 147: Hoare triple {198169#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,352 INFO L290 TraceCheckUtils]: 146: Hoare triple {198169#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {198169#(< ~counter~0 99)} is VALID [2022-04-08 06:12:39,353 INFO L290 TraceCheckUtils]: 145: Hoare triple {198194#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198169#(< ~counter~0 99)} is VALID [2022-04-08 06:12:39,354 INFO L290 TraceCheckUtils]: 144: Hoare triple {198194#(< ~counter~0 98)} assume !(~r~0 < 0); {198194#(< ~counter~0 98)} is VALID [2022-04-08 06:12:39,354 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {197581#true} {198194#(< ~counter~0 98)} #98#return; {198194#(< ~counter~0 98)} is VALID [2022-04-08 06:12:39,354 INFO L290 TraceCheckUtils]: 142: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,354 INFO L290 TraceCheckUtils]: 141: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,354 INFO L290 TraceCheckUtils]: 140: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,354 INFO L272 TraceCheckUtils]: 139: Hoare triple {198194#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {198194#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {198194#(< ~counter~0 98)} is VALID [2022-04-08 06:12:39,357 INFO L290 TraceCheckUtils]: 137: Hoare triple {198219#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198194#(< ~counter~0 98)} is VALID [2022-04-08 06:12:39,357 INFO L290 TraceCheckUtils]: 136: Hoare triple {198219#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198219#(< ~counter~0 97)} is VALID [2022-04-08 06:12:39,357 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197581#true} {198219#(< ~counter~0 97)} #98#return; {198219#(< ~counter~0 97)} is VALID [2022-04-08 06:12:39,357 INFO L290 TraceCheckUtils]: 134: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,357 INFO L290 TraceCheckUtils]: 133: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,358 INFO L290 TraceCheckUtils]: 132: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,358 INFO L272 TraceCheckUtils]: 131: Hoare triple {198219#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,358 INFO L290 TraceCheckUtils]: 130: Hoare triple {198219#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {198219#(< ~counter~0 97)} is VALID [2022-04-08 06:12:39,359 INFO L290 TraceCheckUtils]: 129: Hoare triple {198244#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198219#(< ~counter~0 97)} is VALID [2022-04-08 06:12:39,360 INFO L290 TraceCheckUtils]: 128: Hoare triple {198244#(< ~counter~0 96)} assume !(~r~0 > 0); {198244#(< ~counter~0 96)} is VALID [2022-04-08 06:12:39,360 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197581#true} {198244#(< ~counter~0 96)} #96#return; {198244#(< ~counter~0 96)} is VALID [2022-04-08 06:12:39,360 INFO L290 TraceCheckUtils]: 126: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,360 INFO L290 TraceCheckUtils]: 125: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,360 INFO L290 TraceCheckUtils]: 124: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,360 INFO L272 TraceCheckUtils]: 123: Hoare triple {198244#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,361 INFO L290 TraceCheckUtils]: 122: Hoare triple {198244#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {198244#(< ~counter~0 96)} is VALID [2022-04-08 06:12:39,362 INFO L290 TraceCheckUtils]: 121: Hoare triple {198269#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198244#(< ~counter~0 96)} is VALID [2022-04-08 06:12:39,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {198269#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198269#(< ~counter~0 95)} is VALID [2022-04-08 06:12:39,363 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197581#true} {198269#(< ~counter~0 95)} #96#return; {198269#(< ~counter~0 95)} is VALID [2022-04-08 06:12:39,363 INFO L290 TraceCheckUtils]: 118: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,363 INFO L290 TraceCheckUtils]: 117: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,363 INFO L272 TraceCheckUtils]: 115: Hoare triple {198269#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {198269#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {198269#(< ~counter~0 95)} is VALID [2022-04-08 06:12:39,365 INFO L290 TraceCheckUtils]: 113: Hoare triple {198294#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198269#(< ~counter~0 95)} is VALID [2022-04-08 06:12:39,365 INFO L290 TraceCheckUtils]: 112: Hoare triple {198294#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198294#(< ~counter~0 94)} is VALID [2022-04-08 06:12:39,366 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197581#true} {198294#(< ~counter~0 94)} #96#return; {198294#(< ~counter~0 94)} is VALID [2022-04-08 06:12:39,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,366 INFO L272 TraceCheckUtils]: 107: Hoare triple {198294#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {198294#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {198294#(< ~counter~0 94)} is VALID [2022-04-08 06:12:39,368 INFO L290 TraceCheckUtils]: 105: Hoare triple {198319#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198294#(< ~counter~0 94)} is VALID [2022-04-08 06:12:39,368 INFO L290 TraceCheckUtils]: 104: Hoare triple {198319#(< ~counter~0 93)} assume !!(0 != ~r~0); {198319#(< ~counter~0 93)} is VALID [2022-04-08 06:12:39,368 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197581#true} {198319#(< ~counter~0 93)} #94#return; {198319#(< ~counter~0 93)} is VALID [2022-04-08 06:12:39,368 INFO L290 TraceCheckUtils]: 102: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,368 INFO L290 TraceCheckUtils]: 101: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,369 INFO L290 TraceCheckUtils]: 100: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,369 INFO L272 TraceCheckUtils]: 99: Hoare triple {198319#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,369 INFO L290 TraceCheckUtils]: 98: Hoare triple {198319#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {198319#(< ~counter~0 93)} is VALID [2022-04-08 06:12:39,370 INFO L290 TraceCheckUtils]: 97: Hoare triple {198344#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198319#(< ~counter~0 93)} is VALID [2022-04-08 06:12:39,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {198344#(< ~counter~0 92)} assume !(~r~0 < 0); {198344#(< ~counter~0 92)} is VALID [2022-04-08 06:12:39,371 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197581#true} {198344#(< ~counter~0 92)} #98#return; {198344#(< ~counter~0 92)} is VALID [2022-04-08 06:12:39,371 INFO L290 TraceCheckUtils]: 94: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,371 INFO L290 TraceCheckUtils]: 93: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,371 INFO L290 TraceCheckUtils]: 92: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,371 INFO L272 TraceCheckUtils]: 91: Hoare triple {198344#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {198344#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {198344#(< ~counter~0 92)} is VALID [2022-04-08 06:12:39,373 INFO L290 TraceCheckUtils]: 89: Hoare triple {198369#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198344#(< ~counter~0 92)} is VALID [2022-04-08 06:12:39,373 INFO L290 TraceCheckUtils]: 88: Hoare triple {198369#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198369#(< ~counter~0 91)} is VALID [2022-04-08 06:12:39,374 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197581#true} {198369#(< ~counter~0 91)} #98#return; {198369#(< ~counter~0 91)} is VALID [2022-04-08 06:12:39,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,374 INFO L272 TraceCheckUtils]: 83: Hoare triple {198369#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {198369#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {198369#(< ~counter~0 91)} is VALID [2022-04-08 06:12:39,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {198394#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198369#(< ~counter~0 91)} is VALID [2022-04-08 06:12:39,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {198394#(< ~counter~0 90)} assume !(~r~0 > 0); {198394#(< ~counter~0 90)} is VALID [2022-04-08 06:12:39,377 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197581#true} {198394#(< ~counter~0 90)} #96#return; {198394#(< ~counter~0 90)} is VALID [2022-04-08 06:12:39,377 INFO L290 TraceCheckUtils]: 78: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,377 INFO L290 TraceCheckUtils]: 77: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,377 INFO L272 TraceCheckUtils]: 75: Hoare triple {198394#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {198394#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {198394#(< ~counter~0 90)} is VALID [2022-04-08 06:12:39,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {198419#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198394#(< ~counter~0 90)} is VALID [2022-04-08 06:12:39,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {198419#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198419#(< ~counter~0 89)} is VALID [2022-04-08 06:12:39,379 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197581#true} {198419#(< ~counter~0 89)} #96#return; {198419#(< ~counter~0 89)} is VALID [2022-04-08 06:12:39,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,380 INFO L272 TraceCheckUtils]: 67: Hoare triple {198419#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {198419#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {198419#(< ~counter~0 89)} is VALID [2022-04-08 06:12:39,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {198444#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198419#(< ~counter~0 89)} is VALID [2022-04-08 06:12:39,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {198444#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198444#(< ~counter~0 88)} is VALID [2022-04-08 06:12:39,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197581#true} {198444#(< ~counter~0 88)} #96#return; {198444#(< ~counter~0 88)} is VALID [2022-04-08 06:12:39,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,382 INFO L272 TraceCheckUtils]: 59: Hoare triple {198444#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {198444#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {198444#(< ~counter~0 88)} is VALID [2022-04-08 06:12:39,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {198469#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198444#(< ~counter~0 88)} is VALID [2022-04-08 06:12:39,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {198469#(< ~counter~0 87)} assume !!(0 != ~r~0); {198469#(< ~counter~0 87)} is VALID [2022-04-08 06:12:39,385 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197581#true} {198469#(< ~counter~0 87)} #94#return; {198469#(< ~counter~0 87)} is VALID [2022-04-08 06:12:39,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,385 INFO L290 TraceCheckUtils]: 53: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,385 INFO L272 TraceCheckUtils]: 51: Hoare triple {198469#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {198469#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {198469#(< ~counter~0 87)} is VALID [2022-04-08 06:12:39,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {198494#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198469#(< ~counter~0 87)} is VALID [2022-04-08 06:12:39,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {198494#(< ~counter~0 86)} assume !(~r~0 < 0); {198494#(< ~counter~0 86)} is VALID [2022-04-08 06:12:39,388 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197581#true} {198494#(< ~counter~0 86)} #98#return; {198494#(< ~counter~0 86)} is VALID [2022-04-08 06:12:39,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,388 INFO L272 TraceCheckUtils]: 43: Hoare triple {198494#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {198494#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {198494#(< ~counter~0 86)} is VALID [2022-04-08 06:12:39,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {198519#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198494#(< ~counter~0 86)} is VALID [2022-04-08 06:12:39,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {198519#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198519#(< ~counter~0 85)} is VALID [2022-04-08 06:12:39,390 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197581#true} {198519#(< ~counter~0 85)} #98#return; {198519#(< ~counter~0 85)} is VALID [2022-04-08 06:12:39,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,391 INFO L272 TraceCheckUtils]: 35: Hoare triple {198519#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {198519#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {198519#(< ~counter~0 85)} is VALID [2022-04-08 06:12:39,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {198544#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198519#(< ~counter~0 85)} is VALID [2022-04-08 06:12:39,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {198544#(< ~counter~0 84)} assume !(~r~0 > 0); {198544#(< ~counter~0 84)} is VALID [2022-04-08 06:12:39,393 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197581#true} {198544#(< ~counter~0 84)} #96#return; {198544#(< ~counter~0 84)} is VALID [2022-04-08 06:12:39,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,393 INFO L272 TraceCheckUtils]: 27: Hoare triple {198544#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {198544#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {198544#(< ~counter~0 84)} is VALID [2022-04-08 06:12:39,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {198569#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198544#(< ~counter~0 84)} is VALID [2022-04-08 06:12:39,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {198569#(< ~counter~0 83)} assume !!(0 != ~r~0); {198569#(< ~counter~0 83)} is VALID [2022-04-08 06:12:39,396 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197581#true} {198569#(< ~counter~0 83)} #94#return; {198569#(< ~counter~0 83)} is VALID [2022-04-08 06:12:39,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,396 INFO L272 TraceCheckUtils]: 19: Hoare triple {198569#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {198569#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {198569#(< ~counter~0 83)} is VALID [2022-04-08 06:12:39,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {198594#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198569#(< ~counter~0 83)} is VALID [2022-04-08 06:12:39,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {198594#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197581#true} {198594#(< ~counter~0 82)} #92#return; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,399 INFO L272 TraceCheckUtils]: 11: Hoare triple {198594#(< ~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)); {197581#true} is VALID [2022-04-08 06:12:39,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197581#true} {198594#(< ~counter~0 82)} #90#return; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-08 06:12:39,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-08 06:12:39,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-08 06:12:39,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {198594#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {197581#true} is VALID [2022-04-08 06:12:39,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {198594#(< ~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; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {198594#(< ~counter~0 82)} call #t~ret9 := main(); {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198594#(< ~counter~0 82)} {197581#true} #102#return; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {198594#(< ~counter~0 82)} assume true; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {197581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {198594#(< ~counter~0 82)} is VALID [2022-04-08 06:12:39,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {197581#true} call ULTIMATE.init(); {197581#true} is VALID [2022-04-08 06:12:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 212 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-08 06:12:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:12:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955541224] [2022-04-08 06:12:39,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:12:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402644417] [2022-04-08 06:12:39,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402644417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:12:39,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:12:39,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-08 06:12:39,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:12:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331751899] [2022-04-08 06:12:39,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331751899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:12:39,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:12:39,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 06:12:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067691010] [2022-04-08 06:12:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:12:39,403 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 171 [2022-04-08 06:12:39,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:12:39,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:39,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:39,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 06:12:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:12:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 06:12:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 06:12:39,637 INFO L87 Difference]: Start difference. First operand 946 states and 1260 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:47,874 INFO L93 Difference]: Finished difference Result 1133 states and 1538 transitions. [2022-04-08 06:12:47,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 06:12:47,874 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 171 [2022-04-08 06:12:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:12:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-08 06:12:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-08 06:12:47,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 396 transitions. [2022-04-08 06:12:48,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:12:48,490 INFO L225 Difference]: With dead ends: 1133 [2022-04-08 06:12:48,490 INFO L226 Difference]: Without dead ends: 963 [2022-04-08 06:12:48,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1465, Invalid=1957, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 06:12:48,491 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 453 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:12:48,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 381 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 06:12:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-04-08 06:12:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-04-08 06:12:52,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:12:52,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:52,136 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:52,136 INFO L87 Difference]: Start difference. First operand 963 states. Second operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:52,168 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-08 06:12:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 06:12:52,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:52,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:52,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 963 states. [2022-04-08 06:12:52,170 INFO L87 Difference]: Start difference. First operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 963 states. [2022-04-08 06:12:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:12:52,200 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-08 06:12:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 06:12:52,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:12:52,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:12:52,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:12:52,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:12:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 725 states have (on average 1.1710344827586208) internal successors, (849), 732 states have internal predecessors, (849), 215 states have call successors, (215), 24 states have call predecessors, (215), 22 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-08 06:12:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1277 transitions. [2022-04-08 06:12:52,249 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1277 transitions. Word has length 171 [2022-04-08 06:12:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:12:52,249 INFO L478 AbstractCegarLoop]: Abstraction has 963 states and 1277 transitions. [2022-04-08 06:12:52,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 21 states have call successors, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-08 06:12:52,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 963 states and 1277 transitions. [2022-04-08 06:13:07,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1277 edges. 1273 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-08 06:13:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-08 06:13:07,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:07,371 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 10, 10, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:07,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-08 06:13:07,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:07,572 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 21 times [2022-04-08 06:13:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650577512] [2022-04-08 06:13:07,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 22 times [2022-04-08 06:13:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290099426] [2022-04-08 06:13:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:07,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131619850] [2022-04-08 06:13:07,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:13:07,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:07,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:07,595 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:13:07,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 06:13:07,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:13:07,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:07,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 06:13:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:07,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:08,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {204800#true} call ULTIMATE.init(); {204800#true} is VALID [2022-04-08 06:13:08,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {204800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204808#(<= ~counter~0 0)} {204800#true} #102#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {204808#(<= ~counter~0 0)} call #t~ret9 := main(); {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {204808#(<= ~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; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {204808#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {204808#(<= ~counter~0 0)} ~cond := #in~cond; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {204808#(<= ~counter~0 0)} assume !(0 == ~cond); {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204808#(<= ~counter~0 0)} {204808#(<= ~counter~0 0)} #90#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,665 INFO L272 TraceCheckUtils]: 11: Hoare triple {204808#(<= ~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)); {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {204808#(<= ~counter~0 0)} ~cond := #in~cond; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {204808#(<= ~counter~0 0)} assume !(0 == ~cond); {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204808#(<= ~counter~0 0)} {204808#(<= ~counter~0 0)} #92#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {204808#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {204808#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:08,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {204808#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {204857#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,674 INFO L272 TraceCheckUtils]: 19: Hoare triple {204857#(<= ~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)); {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {204857#(<= ~counter~0 1)} ~cond := #in~cond; {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {204857#(<= ~counter~0 1)} assume !(0 == ~cond); {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {204857#(<= ~counter~0 1)} assume true; {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,676 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204857#(<= ~counter~0 1)} {204857#(<= ~counter~0 1)} #94#return; {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {204857#(<= ~counter~0 1)} assume !!(0 != ~r~0); {204857#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:08,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {204857#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {204882#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,680 INFO L272 TraceCheckUtils]: 27: Hoare triple {204882#(<= ~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)); {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {204882#(<= ~counter~0 2)} ~cond := #in~cond; {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {204882#(<= ~counter~0 2)} assume !(0 == ~cond); {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {204882#(<= ~counter~0 2)} assume true; {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,681 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204882#(<= ~counter~0 2)} {204882#(<= ~counter~0 2)} #96#return; {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {204882#(<= ~counter~0 2)} assume !(~r~0 > 0); {204882#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:08,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {204882#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {204907#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,690 INFO L272 TraceCheckUtils]: 35: Hoare triple {204907#(<= ~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)); {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {204907#(<= ~counter~0 3)} ~cond := #in~cond; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {204907#(<= ~counter~0 3)} assume !(0 == ~cond); {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {204907#(<= ~counter~0 3)} assume true; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,691 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204907#(<= ~counter~0 3)} {204907#(<= ~counter~0 3)} #98#return; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {204907#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {204907#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:08,695 INFO L290 TraceCheckUtils]: 41: Hoare triple {204907#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {204932#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,696 INFO L272 TraceCheckUtils]: 43: Hoare triple {204932#(<= ~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)); {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {204932#(<= ~counter~0 4)} ~cond := #in~cond; {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {204932#(<= ~counter~0 4)} assume !(0 == ~cond); {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {204932#(<= ~counter~0 4)} assume true; {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,697 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204932#(<= ~counter~0 4)} {204932#(<= ~counter~0 4)} #98#return; {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {204932#(<= ~counter~0 4)} assume !(~r~0 < 0); {204932#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:08,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {204932#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {204957#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,700 INFO L272 TraceCheckUtils]: 51: Hoare triple {204957#(<= ~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)); {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,701 INFO L290 TraceCheckUtils]: 52: Hoare triple {204957#(<= ~counter~0 5)} ~cond := #in~cond; {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {204957#(<= ~counter~0 5)} assume !(0 == ~cond); {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {204957#(<= ~counter~0 5)} assume true; {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,702 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204957#(<= ~counter~0 5)} {204957#(<= ~counter~0 5)} #94#return; {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {204957#(<= ~counter~0 5)} assume !!(0 != ~r~0); {204957#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:08,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {204957#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {204982#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,705 INFO L272 TraceCheckUtils]: 59: Hoare triple {204982#(<= ~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)); {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {204982#(<= ~counter~0 6)} ~cond := #in~cond; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {204982#(<= ~counter~0 6)} assume !(0 == ~cond); {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {204982#(<= ~counter~0 6)} assume true; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,706 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204982#(<= ~counter~0 6)} {204982#(<= ~counter~0 6)} #96#return; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {204982#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {204982#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:08,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {204982#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {205007#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,710 INFO L272 TraceCheckUtils]: 67: Hoare triple {205007#(<= ~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)); {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {205007#(<= ~counter~0 7)} ~cond := #in~cond; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {205007#(<= ~counter~0 7)} assume !(0 == ~cond); {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {205007#(<= ~counter~0 7)} assume true; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,711 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {205007#(<= ~counter~0 7)} {205007#(<= ~counter~0 7)} #96#return; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {205007#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205007#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:08,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {205007#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,714 INFO L290 TraceCheckUtils]: 74: Hoare triple {205032#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,715 INFO L272 TraceCheckUtils]: 75: Hoare triple {205032#(<= ~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)); {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {205032#(<= ~counter~0 8)} ~cond := #in~cond; {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {205032#(<= ~counter~0 8)} assume !(0 == ~cond); {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,716 INFO L290 TraceCheckUtils]: 78: Hoare triple {205032#(<= ~counter~0 8)} assume true; {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,716 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {205032#(<= ~counter~0 8)} {205032#(<= ~counter~0 8)} #96#return; {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,716 INFO L290 TraceCheckUtils]: 80: Hoare triple {205032#(<= ~counter~0 8)} assume !(~r~0 > 0); {205032#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:08,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {205032#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {205057#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,720 INFO L272 TraceCheckUtils]: 83: Hoare triple {205057#(<= ~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)); {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {205057#(<= ~counter~0 9)} ~cond := #in~cond; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {205057#(<= ~counter~0 9)} assume !(0 == ~cond); {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,721 INFO L290 TraceCheckUtils]: 86: Hoare triple {205057#(<= ~counter~0 9)} assume true; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,722 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {205057#(<= ~counter~0 9)} {205057#(<= ~counter~0 9)} #98#return; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {205057#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205057#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:08,724 INFO L290 TraceCheckUtils]: 89: Hoare triple {205057#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,724 INFO L290 TraceCheckUtils]: 90: Hoare triple {205082#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,725 INFO L272 TraceCheckUtils]: 91: Hoare triple {205082#(<= ~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)); {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,725 INFO L290 TraceCheckUtils]: 92: Hoare triple {205082#(<= ~counter~0 10)} ~cond := #in~cond; {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {205082#(<= ~counter~0 10)} assume !(0 == ~cond); {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,726 INFO L290 TraceCheckUtils]: 94: Hoare triple {205082#(<= ~counter~0 10)} assume true; {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,727 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {205082#(<= ~counter~0 10)} {205082#(<= ~counter~0 10)} #98#return; {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,727 INFO L290 TraceCheckUtils]: 96: Hoare triple {205082#(<= ~counter~0 10)} assume !(~r~0 < 0); {205082#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:08,729 INFO L290 TraceCheckUtils]: 97: Hoare triple {205082#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,729 INFO L290 TraceCheckUtils]: 98: Hoare triple {205107#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,730 INFO L272 TraceCheckUtils]: 99: Hoare triple {205107#(<= ~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)); {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,730 INFO L290 TraceCheckUtils]: 100: Hoare triple {205107#(<= ~counter~0 11)} ~cond := #in~cond; {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,730 INFO L290 TraceCheckUtils]: 101: Hoare triple {205107#(<= ~counter~0 11)} assume !(0 == ~cond); {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,731 INFO L290 TraceCheckUtils]: 102: Hoare triple {205107#(<= ~counter~0 11)} assume true; {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,731 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {205107#(<= ~counter~0 11)} {205107#(<= ~counter~0 11)} #94#return; {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,732 INFO L290 TraceCheckUtils]: 104: Hoare triple {205107#(<= ~counter~0 11)} assume !!(0 != ~r~0); {205107#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:08,733 INFO L290 TraceCheckUtils]: 105: Hoare triple {205107#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,734 INFO L290 TraceCheckUtils]: 106: Hoare triple {205132#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,734 INFO L272 TraceCheckUtils]: 107: Hoare triple {205132#(<= ~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)); {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,735 INFO L290 TraceCheckUtils]: 108: Hoare triple {205132#(<= ~counter~0 12)} ~cond := #in~cond; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,735 INFO L290 TraceCheckUtils]: 109: Hoare triple {205132#(<= ~counter~0 12)} assume !(0 == ~cond); {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,735 INFO L290 TraceCheckUtils]: 110: Hoare triple {205132#(<= ~counter~0 12)} assume true; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,736 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {205132#(<= ~counter~0 12)} {205132#(<= ~counter~0 12)} #96#return; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,736 INFO L290 TraceCheckUtils]: 112: Hoare triple {205132#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205132#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:08,738 INFO L290 TraceCheckUtils]: 113: Hoare triple {205132#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,738 INFO L290 TraceCheckUtils]: 114: Hoare triple {205157#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,739 INFO L272 TraceCheckUtils]: 115: Hoare triple {205157#(<= ~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)); {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,739 INFO L290 TraceCheckUtils]: 116: Hoare triple {205157#(<= ~counter~0 13)} ~cond := #in~cond; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,739 INFO L290 TraceCheckUtils]: 117: Hoare triple {205157#(<= ~counter~0 13)} assume !(0 == ~cond); {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,740 INFO L290 TraceCheckUtils]: 118: Hoare triple {205157#(<= ~counter~0 13)} assume true; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,740 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {205157#(<= ~counter~0 13)} {205157#(<= ~counter~0 13)} #96#return; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,740 INFO L290 TraceCheckUtils]: 120: Hoare triple {205157#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205157#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:08,742 INFO L290 TraceCheckUtils]: 121: Hoare triple {205157#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,742 INFO L290 TraceCheckUtils]: 122: Hoare triple {205182#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,743 INFO L272 TraceCheckUtils]: 123: Hoare triple {205182#(<= ~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)); {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,743 INFO L290 TraceCheckUtils]: 124: Hoare triple {205182#(<= ~counter~0 14)} ~cond := #in~cond; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,744 INFO L290 TraceCheckUtils]: 125: Hoare triple {205182#(<= ~counter~0 14)} assume !(0 == ~cond); {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,744 INFO L290 TraceCheckUtils]: 126: Hoare triple {205182#(<= ~counter~0 14)} assume true; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,745 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {205182#(<= ~counter~0 14)} {205182#(<= ~counter~0 14)} #96#return; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,745 INFO L290 TraceCheckUtils]: 128: Hoare triple {205182#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205182#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:08,746 INFO L290 TraceCheckUtils]: 129: Hoare triple {205182#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,747 INFO L290 TraceCheckUtils]: 130: Hoare triple {205207#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,747 INFO L272 TraceCheckUtils]: 131: Hoare triple {205207#(<= ~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)); {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,748 INFO L290 TraceCheckUtils]: 132: Hoare triple {205207#(<= ~counter~0 15)} ~cond := #in~cond; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,748 INFO L290 TraceCheckUtils]: 133: Hoare triple {205207#(<= ~counter~0 15)} assume !(0 == ~cond); {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,748 INFO L290 TraceCheckUtils]: 134: Hoare triple {205207#(<= ~counter~0 15)} assume true; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,749 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {205207#(<= ~counter~0 15)} {205207#(<= ~counter~0 15)} #96#return; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,749 INFO L290 TraceCheckUtils]: 136: Hoare triple {205207#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205207#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:08,751 INFO L290 TraceCheckUtils]: 137: Hoare triple {205207#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,751 INFO L290 TraceCheckUtils]: 138: Hoare triple {205232#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,752 INFO L272 TraceCheckUtils]: 139: Hoare triple {205232#(<= ~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)); {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,752 INFO L290 TraceCheckUtils]: 140: Hoare triple {205232#(<= ~counter~0 16)} ~cond := #in~cond; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,752 INFO L290 TraceCheckUtils]: 141: Hoare triple {205232#(<= ~counter~0 16)} assume !(0 == ~cond); {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,753 INFO L290 TraceCheckUtils]: 142: Hoare triple {205232#(<= ~counter~0 16)} assume true; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,753 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {205232#(<= ~counter~0 16)} {205232#(<= ~counter~0 16)} #96#return; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,754 INFO L290 TraceCheckUtils]: 144: Hoare triple {205232#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205232#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:08,756 INFO L290 TraceCheckUtils]: 145: Hoare triple {205232#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,756 INFO L290 TraceCheckUtils]: 146: Hoare triple {205257#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,757 INFO L272 TraceCheckUtils]: 147: Hoare triple {205257#(<= ~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)); {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,757 INFO L290 TraceCheckUtils]: 148: Hoare triple {205257#(<= ~counter~0 17)} ~cond := #in~cond; {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,758 INFO L290 TraceCheckUtils]: 149: Hoare triple {205257#(<= ~counter~0 17)} assume !(0 == ~cond); {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,758 INFO L290 TraceCheckUtils]: 150: Hoare triple {205257#(<= ~counter~0 17)} assume true; {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,759 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {205257#(<= ~counter~0 17)} {205257#(<= ~counter~0 17)} #96#return; {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,759 INFO L290 TraceCheckUtils]: 152: Hoare triple {205257#(<= ~counter~0 17)} assume !(~r~0 > 0); {205257#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:08,761 INFO L290 TraceCheckUtils]: 153: Hoare triple {205257#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,761 INFO L290 TraceCheckUtils]: 154: Hoare triple {205282#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,762 INFO L272 TraceCheckUtils]: 155: Hoare triple {205282#(<= ~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)); {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,763 INFO L290 TraceCheckUtils]: 156: Hoare triple {205282#(<= ~counter~0 18)} ~cond := #in~cond; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,763 INFO L290 TraceCheckUtils]: 157: Hoare triple {205282#(<= ~counter~0 18)} assume !(0 == ~cond); {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,763 INFO L290 TraceCheckUtils]: 158: Hoare triple {205282#(<= ~counter~0 18)} assume true; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,764 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {205282#(<= ~counter~0 18)} {205282#(<= ~counter~0 18)} #98#return; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,764 INFO L290 TraceCheckUtils]: 160: Hoare triple {205282#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205282#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:08,768 INFO L290 TraceCheckUtils]: 161: Hoare triple {205282#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,768 INFO L290 TraceCheckUtils]: 162: Hoare triple {205307#(<= ~counter~0 19)} assume !!(#t~post8 < 100);havoc #t~post8; {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,769 INFO L272 TraceCheckUtils]: 163: Hoare triple {205307#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,769 INFO L290 TraceCheckUtils]: 164: Hoare triple {205307#(<= ~counter~0 19)} ~cond := #in~cond; {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,769 INFO L290 TraceCheckUtils]: 165: Hoare triple {205307#(<= ~counter~0 19)} assume !(0 == ~cond); {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,770 INFO L290 TraceCheckUtils]: 166: Hoare triple {205307#(<= ~counter~0 19)} assume true; {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,770 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {205307#(<= ~counter~0 19)} {205307#(<= ~counter~0 19)} #98#return; {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,771 INFO L290 TraceCheckUtils]: 168: Hoare triple {205307#(<= ~counter~0 19)} assume !(~r~0 < 0); {205307#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:08,771 INFO L290 TraceCheckUtils]: 169: Hoare triple {205307#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205332#(<= |main_#t~post6| 19)} is VALID [2022-04-08 06:13:08,772 INFO L290 TraceCheckUtils]: 170: Hoare triple {205332#(<= |main_#t~post6| 19)} assume !(#t~post6 < 100);havoc #t~post6; {204801#false} is VALID [2022-04-08 06:13:08,772 INFO L272 TraceCheckUtils]: 171: Hoare triple {204801#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {204801#false} is VALID [2022-04-08 06:13:08,772 INFO L290 TraceCheckUtils]: 172: Hoare triple {204801#false} ~cond := #in~cond; {204801#false} is VALID [2022-04-08 06:13:08,772 INFO L290 TraceCheckUtils]: 173: Hoare triple {204801#false} assume 0 == ~cond; {204801#false} is VALID [2022-04-08 06:13:08,772 INFO L290 TraceCheckUtils]: 174: Hoare triple {204801#false} assume !false; {204801#false} is VALID [2022-04-08 06:13:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 942 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:13:08,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:13:09,920 INFO L290 TraceCheckUtils]: 174: Hoare triple {204801#false} assume !false; {204801#false} is VALID [2022-04-08 06:13:09,920 INFO L290 TraceCheckUtils]: 173: Hoare triple {204801#false} assume 0 == ~cond; {204801#false} is VALID [2022-04-08 06:13:09,920 INFO L290 TraceCheckUtils]: 172: Hoare triple {204801#false} ~cond := #in~cond; {204801#false} is VALID [2022-04-08 06:13:09,920 INFO L272 TraceCheckUtils]: 171: Hoare triple {204801#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {204801#false} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 170: Hoare triple {205360#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {204801#false} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 169: Hoare triple {205364#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205360#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 168: Hoare triple {205364#(< ~counter~0 100)} assume !(~r~0 < 0); {205364#(< ~counter~0 100)} is VALID [2022-04-08 06:13:09,921 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {204800#true} {205364#(< ~counter~0 100)} #98#return; {205364#(< ~counter~0 100)} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 166: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 165: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,921 INFO L290 TraceCheckUtils]: 164: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,922 INFO L272 TraceCheckUtils]: 163: Hoare triple {205364#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,922 INFO L290 TraceCheckUtils]: 162: Hoare triple {205364#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {205364#(< ~counter~0 100)} is VALID [2022-04-08 06:13:09,927 INFO L290 TraceCheckUtils]: 161: Hoare triple {205389#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205364#(< ~counter~0 100)} is VALID [2022-04-08 06:13:09,927 INFO L290 TraceCheckUtils]: 160: Hoare triple {205389#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205389#(< ~counter~0 99)} is VALID [2022-04-08 06:13:09,928 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {204800#true} {205389#(< ~counter~0 99)} #98#return; {205389#(< ~counter~0 99)} is VALID [2022-04-08 06:13:09,928 INFO L290 TraceCheckUtils]: 158: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,928 INFO L290 TraceCheckUtils]: 157: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,928 INFO L290 TraceCheckUtils]: 156: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,928 INFO L272 TraceCheckUtils]: 155: Hoare triple {205389#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,928 INFO L290 TraceCheckUtils]: 154: Hoare triple {205389#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {205389#(< ~counter~0 99)} is VALID [2022-04-08 06:13:09,930 INFO L290 TraceCheckUtils]: 153: Hoare triple {205414#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205389#(< ~counter~0 99)} is VALID [2022-04-08 06:13:09,930 INFO L290 TraceCheckUtils]: 152: Hoare triple {205414#(< ~counter~0 98)} assume !(~r~0 > 0); {205414#(< ~counter~0 98)} is VALID [2022-04-08 06:13:09,931 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {204800#true} {205414#(< ~counter~0 98)} #96#return; {205414#(< ~counter~0 98)} is VALID [2022-04-08 06:13:09,931 INFO L290 TraceCheckUtils]: 150: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,931 INFO L290 TraceCheckUtils]: 149: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,931 INFO L290 TraceCheckUtils]: 148: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,931 INFO L272 TraceCheckUtils]: 147: Hoare triple {205414#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,931 INFO L290 TraceCheckUtils]: 146: Hoare triple {205414#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {205414#(< ~counter~0 98)} is VALID [2022-04-08 06:13:09,933 INFO L290 TraceCheckUtils]: 145: Hoare triple {205439#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205414#(< ~counter~0 98)} is VALID [2022-04-08 06:13:09,933 INFO L290 TraceCheckUtils]: 144: Hoare triple {205439#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205439#(< ~counter~0 97)} is VALID [2022-04-08 06:13:09,933 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {204800#true} {205439#(< ~counter~0 97)} #96#return; {205439#(< ~counter~0 97)} is VALID [2022-04-08 06:13:09,933 INFO L290 TraceCheckUtils]: 142: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,934 INFO L290 TraceCheckUtils]: 141: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,934 INFO L290 TraceCheckUtils]: 140: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,934 INFO L272 TraceCheckUtils]: 139: Hoare triple {205439#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,934 INFO L290 TraceCheckUtils]: 138: Hoare triple {205439#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {205439#(< ~counter~0 97)} is VALID [2022-04-08 06:13:09,936 INFO L290 TraceCheckUtils]: 137: Hoare triple {205464#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205439#(< ~counter~0 97)} is VALID [2022-04-08 06:13:09,936 INFO L290 TraceCheckUtils]: 136: Hoare triple {205464#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205464#(< ~counter~0 96)} is VALID [2022-04-08 06:13:09,936 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {204800#true} {205464#(< ~counter~0 96)} #96#return; {205464#(< ~counter~0 96)} is VALID [2022-04-08 06:13:09,936 INFO L290 TraceCheckUtils]: 134: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,936 INFO L290 TraceCheckUtils]: 133: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,936 INFO L290 TraceCheckUtils]: 132: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,936 INFO L272 TraceCheckUtils]: 131: Hoare triple {205464#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {205464#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {205464#(< ~counter~0 96)} is VALID [2022-04-08 06:13:09,938 INFO L290 TraceCheckUtils]: 129: Hoare triple {205489#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205464#(< ~counter~0 96)} is VALID [2022-04-08 06:13:09,939 INFO L290 TraceCheckUtils]: 128: Hoare triple {205489#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205489#(< ~counter~0 95)} is VALID [2022-04-08 06:13:09,939 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {204800#true} {205489#(< ~counter~0 95)} #96#return; {205489#(< ~counter~0 95)} is VALID [2022-04-08 06:13:09,939 INFO L290 TraceCheckUtils]: 126: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,939 INFO L290 TraceCheckUtils]: 125: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,939 INFO L290 TraceCheckUtils]: 124: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,939 INFO L272 TraceCheckUtils]: 123: Hoare triple {205489#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,939 INFO L290 TraceCheckUtils]: 122: Hoare triple {205489#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {205489#(< ~counter~0 95)} is VALID [2022-04-08 06:13:09,941 INFO L290 TraceCheckUtils]: 121: Hoare triple {205514#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205489#(< ~counter~0 95)} is VALID [2022-04-08 06:13:09,941 INFO L290 TraceCheckUtils]: 120: Hoare triple {205514#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205514#(< ~counter~0 94)} is VALID [2022-04-08 06:13:09,941 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {204800#true} {205514#(< ~counter~0 94)} #96#return; {205514#(< ~counter~0 94)} is VALID [2022-04-08 06:13:09,942 INFO L290 TraceCheckUtils]: 118: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,942 INFO L290 TraceCheckUtils]: 117: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,942 INFO L290 TraceCheckUtils]: 116: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,942 INFO L272 TraceCheckUtils]: 115: Hoare triple {205514#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,942 INFO L290 TraceCheckUtils]: 114: Hoare triple {205514#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {205514#(< ~counter~0 94)} is VALID [2022-04-08 06:13:09,943 INFO L290 TraceCheckUtils]: 113: Hoare triple {205539#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205514#(< ~counter~0 94)} is VALID [2022-04-08 06:13:09,944 INFO L290 TraceCheckUtils]: 112: Hoare triple {205539#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205539#(< ~counter~0 93)} is VALID [2022-04-08 06:13:09,944 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {204800#true} {205539#(< ~counter~0 93)} #96#return; {205539#(< ~counter~0 93)} is VALID [2022-04-08 06:13:09,944 INFO L290 TraceCheckUtils]: 110: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,944 INFO L290 TraceCheckUtils]: 109: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,944 INFO L290 TraceCheckUtils]: 108: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,944 INFO L272 TraceCheckUtils]: 107: Hoare triple {205539#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,944 INFO L290 TraceCheckUtils]: 106: Hoare triple {205539#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {205539#(< ~counter~0 93)} is VALID [2022-04-08 06:13:09,946 INFO L290 TraceCheckUtils]: 105: Hoare triple {205564#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205539#(< ~counter~0 93)} is VALID [2022-04-08 06:13:09,946 INFO L290 TraceCheckUtils]: 104: Hoare triple {205564#(< ~counter~0 92)} assume !!(0 != ~r~0); {205564#(< ~counter~0 92)} is VALID [2022-04-08 06:13:09,947 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {204800#true} {205564#(< ~counter~0 92)} #94#return; {205564#(< ~counter~0 92)} is VALID [2022-04-08 06:13:09,947 INFO L290 TraceCheckUtils]: 102: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,947 INFO L290 TraceCheckUtils]: 101: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,947 INFO L290 TraceCheckUtils]: 100: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,947 INFO L272 TraceCheckUtils]: 99: Hoare triple {205564#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,947 INFO L290 TraceCheckUtils]: 98: Hoare triple {205564#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {205564#(< ~counter~0 92)} is VALID [2022-04-08 06:13:09,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {205589#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205564#(< ~counter~0 92)} is VALID [2022-04-08 06:13:09,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {205589#(< ~counter~0 91)} assume !(~r~0 < 0); {205589#(< ~counter~0 91)} is VALID [2022-04-08 06:13:09,949 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {204800#true} {205589#(< ~counter~0 91)} #98#return; {205589#(< ~counter~0 91)} is VALID [2022-04-08 06:13:09,949 INFO L290 TraceCheckUtils]: 94: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,949 INFO L290 TraceCheckUtils]: 93: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,949 INFO L272 TraceCheckUtils]: 91: Hoare triple {205589#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,950 INFO L290 TraceCheckUtils]: 90: Hoare triple {205589#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {205589#(< ~counter~0 91)} is VALID [2022-04-08 06:13:09,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {205614#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205589#(< ~counter~0 91)} is VALID [2022-04-08 06:13:09,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {205614#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205614#(< ~counter~0 90)} is VALID [2022-04-08 06:13:09,952 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {204800#true} {205614#(< ~counter~0 90)} #98#return; {205614#(< ~counter~0 90)} is VALID [2022-04-08 06:13:09,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,952 INFO L290 TraceCheckUtils]: 85: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,953 INFO L272 TraceCheckUtils]: 83: Hoare triple {205614#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,953 INFO L290 TraceCheckUtils]: 82: Hoare triple {205614#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {205614#(< ~counter~0 90)} is VALID [2022-04-08 06:13:09,954 INFO L290 TraceCheckUtils]: 81: Hoare triple {205639#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205614#(< ~counter~0 90)} is VALID [2022-04-08 06:13:09,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {205639#(< ~counter~0 89)} assume !(~r~0 > 0); {205639#(< ~counter~0 89)} is VALID [2022-04-08 06:13:09,955 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {204800#true} {205639#(< ~counter~0 89)} #96#return; {205639#(< ~counter~0 89)} is VALID [2022-04-08 06:13:09,955 INFO L290 TraceCheckUtils]: 78: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,955 INFO L290 TraceCheckUtils]: 77: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,955 INFO L290 TraceCheckUtils]: 76: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,955 INFO L272 TraceCheckUtils]: 75: Hoare triple {205639#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,955 INFO L290 TraceCheckUtils]: 74: Hoare triple {205639#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {205639#(< ~counter~0 89)} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 73: Hoare triple {205664#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205639#(< ~counter~0 89)} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {205664#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205664#(< ~counter~0 88)} is VALID [2022-04-08 06:13:09,957 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {204800#true} {205664#(< ~counter~0 88)} #96#return; {205664#(< ~counter~0 88)} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,957 INFO L272 TraceCheckUtils]: 67: Hoare triple {205664#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {205664#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {205664#(< ~counter~0 88)} is VALID [2022-04-08 06:13:09,959 INFO L290 TraceCheckUtils]: 65: Hoare triple {205689#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205664#(< ~counter~0 88)} is VALID [2022-04-08 06:13:09,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {205689#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205689#(< ~counter~0 87)} is VALID [2022-04-08 06:13:09,960 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204800#true} {205689#(< ~counter~0 87)} #96#return; {205689#(< ~counter~0 87)} is VALID [2022-04-08 06:13:09,960 INFO L290 TraceCheckUtils]: 62: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,960 INFO L290 TraceCheckUtils]: 61: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,960 INFO L272 TraceCheckUtils]: 59: Hoare triple {205689#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {205689#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {205689#(< ~counter~0 87)} is VALID [2022-04-08 06:13:09,962 INFO L290 TraceCheckUtils]: 57: Hoare triple {205714#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205689#(< ~counter~0 87)} is VALID [2022-04-08 06:13:09,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {205714#(< ~counter~0 86)} assume !!(0 != ~r~0); {205714#(< ~counter~0 86)} is VALID [2022-04-08 06:13:09,963 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204800#true} {205714#(< ~counter~0 86)} #94#return; {205714#(< ~counter~0 86)} is VALID [2022-04-08 06:13:09,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,963 INFO L272 TraceCheckUtils]: 51: Hoare triple {205714#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {205714#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {205714#(< ~counter~0 86)} is VALID [2022-04-08 06:13:09,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {205739#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205714#(< ~counter~0 86)} is VALID [2022-04-08 06:13:09,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {205739#(< ~counter~0 85)} assume !(~r~0 < 0); {205739#(< ~counter~0 85)} is VALID [2022-04-08 06:13:09,966 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204800#true} {205739#(< ~counter~0 85)} #98#return; {205739#(< ~counter~0 85)} is VALID [2022-04-08 06:13:09,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,966 INFO L272 TraceCheckUtils]: 43: Hoare triple {205739#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {205739#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {205739#(< ~counter~0 85)} is VALID [2022-04-08 06:13:09,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {205764#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205739#(< ~counter~0 85)} is VALID [2022-04-08 06:13:09,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {205764#(< ~counter~0 84)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205764#(< ~counter~0 84)} is VALID [2022-04-08 06:13:09,969 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204800#true} {205764#(< ~counter~0 84)} #98#return; {205764#(< ~counter~0 84)} is VALID [2022-04-08 06:13:09,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,969 INFO L272 TraceCheckUtils]: 35: Hoare triple {205764#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {205764#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {205764#(< ~counter~0 84)} is VALID [2022-04-08 06:13:09,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {205789#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205764#(< ~counter~0 84)} is VALID [2022-04-08 06:13:09,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {205789#(< ~counter~0 83)} assume !(~r~0 > 0); {205789#(< ~counter~0 83)} is VALID [2022-04-08 06:13:09,972 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204800#true} {205789#(< ~counter~0 83)} #96#return; {205789#(< ~counter~0 83)} is VALID [2022-04-08 06:13:09,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,972 INFO L272 TraceCheckUtils]: 27: Hoare triple {205789#(< ~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)); {204800#true} is VALID [2022-04-08 06:13:09,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {205789#(< ~counter~0 83)} assume !!(#t~post7 < 100);havoc #t~post7; {205789#(< ~counter~0 83)} is VALID [2022-04-08 06:13:09,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {205814#(< ~counter~0 82)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205789#(< ~counter~0 83)} is VALID [2022-04-08 06:13:09,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {205814#(< ~counter~0 82)} assume !!(0 != ~r~0); {205814#(< ~counter~0 82)} is VALID [2022-04-08 06:13:09,975 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204800#true} {205814#(< ~counter~0 82)} #94#return; {205814#(< ~counter~0 82)} is VALID [2022-04-08 06:13:09,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,975 INFO L272 TraceCheckUtils]: 19: Hoare triple {205814#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {204800#true} is VALID [2022-04-08 06:13:09,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {205814#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {205814#(< ~counter~0 82)} is VALID [2022-04-08 06:13:09,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {205839#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205814#(< ~counter~0 82)} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {205839#(< ~counter~0 81)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,977 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204800#true} {205839#(< ~counter~0 81)} #92#return; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,977 INFO L272 TraceCheckUtils]: 11: Hoare triple {205839#(< ~counter~0 81)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {204800#true} is VALID [2022-04-08 06:13:09,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204800#true} {205839#(< ~counter~0 81)} #90#return; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-08 06:13:09,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-08 06:13:09,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-08 06:13:09,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {205839#(< ~counter~0 81)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {204800#true} is VALID [2022-04-08 06:13:09,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {205839#(< ~counter~0 81)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {205839#(< ~counter~0 81)} call #t~ret9 := main(); {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205839#(< ~counter~0 81)} {204800#true} #102#return; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {205839#(< ~counter~0 81)} assume true; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {204800#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {205839#(< ~counter~0 81)} is VALID [2022-04-08 06:13:09,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {204800#true} call ULTIMATE.init(); {204800#true} is VALID [2022-04-08 06:13:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 258 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-08 06:13:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290099426] [2022-04-08 06:13:09,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:09,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131619850] [2022-04-08 06:13:09,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131619850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:13:09,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:13:09,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-08 06:13:09,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:09,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650577512] [2022-04-08 06:13:09,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650577512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:09,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:09,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 06:13:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120685970] [2022-04-08 06:13:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 175 [2022-04-08 06:13:09,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:09,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:10,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:10,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 06:13:10,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:10,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 06:13:10,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 06:13:10,266 INFO L87 Difference]: Start difference. First operand 963 states and 1277 transitions. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:16,570 INFO L93 Difference]: Finished difference Result 1014 states and 1347 transitions. [2022-04-08 06:13:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 06:13:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 175 [2022-04-08 06:13:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-08 06:13:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-08 06:13:16,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 394 transitions. [2022-04-08 06:13:17,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:17,234 INFO L225 Difference]: With dead ends: 1014 [2022-04-08 06:13:17,234 INFO L226 Difference]: Without dead ends: 1009 [2022-04-08 06:13:17,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1509, Invalid=2031, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 06:13:17,235 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 368 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:17,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 413 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:13:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-04-08 06:13:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 987. [2022-04-08 06:13:21,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:21,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:21,883 INFO L74 IsIncluded]: Start isIncluded. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:21,884 INFO L87 Difference]: Start difference. First operand 1009 states. Second operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:21,915 INFO L93 Difference]: Finished difference Result 1009 states and 1341 transitions. [2022-04-08 06:13:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1341 transitions. [2022-04-08 06:13:21,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:21,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:21,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1009 states. [2022-04-08 06:13:21,917 INFO L87 Difference]: Start difference. First operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1009 states. [2022-04-08 06:13:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:21,949 INFO L93 Difference]: Finished difference Result 1009 states and 1341 transitions. [2022-04-08 06:13:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1341 transitions. [2022-04-08 06:13:21,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:21,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:21,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:21,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 735 states have (on average 1.1714285714285715) internal successors, (861), 752 states have internal predecessors, (861), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1315 transitions. [2022-04-08 06:13:21,993 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1315 transitions. Word has length 175 [2022-04-08 06:13:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:21,993 INFO L478 AbstractCegarLoop]: Abstraction has 987 states and 1315 transitions. [2022-04-08 06:13:21,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:21,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 987 states and 1315 transitions. [2022-04-08 06:13:36,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1315 edges. 1313 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1315 transitions. [2022-04-08 06:13:36,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-08 06:13:36,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:13:36,510 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 9, 9, 9, 9, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:13:36,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-04-08 06:13:36,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:36,711 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:13:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:13:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash -743527641, now seen corresponding path program 33 times [2022-04-08 06:13:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:36,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536532144] [2022-04-08 06:13:36,711 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:13:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -743527641, now seen corresponding path program 34 times [2022-04-08 06:13:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:13:36,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436472016] [2022-04-08 06:13:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:13:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:13:36,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:13:36,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114146263] [2022-04-08 06:13:36,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:13:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:13:36,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:13:36,758 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:13:36,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 06:13:36,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:13:36,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:13:36,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 06:13:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:13:36,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:13:37,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {211945#true} call ULTIMATE.init(); {211945#true} is VALID [2022-04-08 06:13:37,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {211945#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {211953#(<= ~counter~0 0)} assume true; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211953#(<= ~counter~0 0)} {211945#true} #102#return; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {211953#(<= ~counter~0 0)} call #t~ret9 := main(); {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {211953#(<= ~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; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {211953#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {211953#(<= ~counter~0 0)} ~cond := #in~cond; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {211953#(<= ~counter~0 0)} assume !(0 == ~cond); {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {211953#(<= ~counter~0 0)} assume true; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,859 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {211953#(<= ~counter~0 0)} {211953#(<= ~counter~0 0)} #90#return; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,859 INFO L272 TraceCheckUtils]: 11: Hoare triple {211953#(<= ~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)); {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {211953#(<= ~counter~0 0)} ~cond := #in~cond; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {211953#(<= ~counter~0 0)} assume !(0 == ~cond); {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {211953#(<= ~counter~0 0)} assume true; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211953#(<= ~counter~0 0)} {211953#(<= ~counter~0 0)} #92#return; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {211953#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {211953#(<= ~counter~0 0)} is VALID [2022-04-08 06:13:37,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {211953#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {212002#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,868 INFO L272 TraceCheckUtils]: 19: Hoare triple {212002#(<= ~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)); {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {212002#(<= ~counter~0 1)} ~cond := #in~cond; {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {212002#(<= ~counter~0 1)} assume !(0 == ~cond); {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {212002#(<= ~counter~0 1)} assume true; {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,869 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {212002#(<= ~counter~0 1)} {212002#(<= ~counter~0 1)} #94#return; {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {212002#(<= ~counter~0 1)} assume !!(0 != ~r~0); {212002#(<= ~counter~0 1)} is VALID [2022-04-08 06:13:37,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {212002#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {212027#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {212027#(<= ~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)); {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {212027#(<= ~counter~0 2)} ~cond := #in~cond; {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {212027#(<= ~counter~0 2)} assume !(0 == ~cond); {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {212027#(<= ~counter~0 2)} assume true; {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {212027#(<= ~counter~0 2)} {212027#(<= ~counter~0 2)} #96#return; {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {212027#(<= ~counter~0 2)} assume !(~r~0 > 0); {212027#(<= ~counter~0 2)} is VALID [2022-04-08 06:13:37,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {212027#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {212052#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,877 INFO L272 TraceCheckUtils]: 35: Hoare triple {212052#(<= ~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)); {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {212052#(<= ~counter~0 3)} ~cond := #in~cond; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {212052#(<= ~counter~0 3)} assume !(0 == ~cond); {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {212052#(<= ~counter~0 3)} assume true; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,878 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {212052#(<= ~counter~0 3)} {212052#(<= ~counter~0 3)} #98#return; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {212052#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212052#(<= ~counter~0 3)} is VALID [2022-04-08 06:13:37,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {212052#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {212077#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,881 INFO L272 TraceCheckUtils]: 43: Hoare triple {212077#(<= ~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)); {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {212077#(<= ~counter~0 4)} ~cond := #in~cond; {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {212077#(<= ~counter~0 4)} assume !(0 == ~cond); {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {212077#(<= ~counter~0 4)} assume true; {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,882 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {212077#(<= ~counter~0 4)} {212077#(<= ~counter~0 4)} #98#return; {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {212077#(<= ~counter~0 4)} assume !(~r~0 < 0); {212077#(<= ~counter~0 4)} is VALID [2022-04-08 06:13:37,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {212077#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {212102#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,885 INFO L272 TraceCheckUtils]: 51: Hoare triple {212102#(<= ~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)); {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {212102#(<= ~counter~0 5)} ~cond := #in~cond; {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {212102#(<= ~counter~0 5)} assume !(0 == ~cond); {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {212102#(<= ~counter~0 5)} assume true; {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,887 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {212102#(<= ~counter~0 5)} {212102#(<= ~counter~0 5)} #94#return; {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {212102#(<= ~counter~0 5)} assume !!(0 != ~r~0); {212102#(<= ~counter~0 5)} is VALID [2022-04-08 06:13:37,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {212102#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {212127#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,889 INFO L272 TraceCheckUtils]: 59: Hoare triple {212127#(<= ~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)); {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,890 INFO L290 TraceCheckUtils]: 60: Hoare triple {212127#(<= ~counter~0 6)} ~cond := #in~cond; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {212127#(<= ~counter~0 6)} assume !(0 == ~cond); {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {212127#(<= ~counter~0 6)} assume true; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,891 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {212127#(<= ~counter~0 6)} {212127#(<= ~counter~0 6)} #96#return; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,891 INFO L290 TraceCheckUtils]: 64: Hoare triple {212127#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212127#(<= ~counter~0 6)} is VALID [2022-04-08 06:13:37,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {212127#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {212152#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,894 INFO L272 TraceCheckUtils]: 67: Hoare triple {212152#(<= ~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)); {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,894 INFO L290 TraceCheckUtils]: 68: Hoare triple {212152#(<= ~counter~0 7)} ~cond := #in~cond; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,894 INFO L290 TraceCheckUtils]: 69: Hoare triple {212152#(<= ~counter~0 7)} assume !(0 == ~cond); {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {212152#(<= ~counter~0 7)} assume true; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,895 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {212152#(<= ~counter~0 7)} {212152#(<= ~counter~0 7)} #96#return; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,895 INFO L290 TraceCheckUtils]: 72: Hoare triple {212152#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212152#(<= ~counter~0 7)} is VALID [2022-04-08 06:13:37,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {212152#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {212177#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,899 INFO L272 TraceCheckUtils]: 75: Hoare triple {212177#(<= ~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)); {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,899 INFO L290 TraceCheckUtils]: 76: Hoare triple {212177#(<= ~counter~0 8)} ~cond := #in~cond; {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {212177#(<= ~counter~0 8)} assume !(0 == ~cond); {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {212177#(<= ~counter~0 8)} assume true; {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,900 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {212177#(<= ~counter~0 8)} {212177#(<= ~counter~0 8)} #96#return; {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {212177#(<= ~counter~0 8)} assume !(~r~0 > 0); {212177#(<= ~counter~0 8)} is VALID [2022-04-08 06:13:37,903 INFO L290 TraceCheckUtils]: 81: Hoare triple {212177#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,904 INFO L290 TraceCheckUtils]: 82: Hoare triple {212202#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,904 INFO L272 TraceCheckUtils]: 83: Hoare triple {212202#(<= ~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)); {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,905 INFO L290 TraceCheckUtils]: 84: Hoare triple {212202#(<= ~counter~0 9)} ~cond := #in~cond; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,905 INFO L290 TraceCheckUtils]: 85: Hoare triple {212202#(<= ~counter~0 9)} assume !(0 == ~cond); {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,905 INFO L290 TraceCheckUtils]: 86: Hoare triple {212202#(<= ~counter~0 9)} assume true; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,906 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {212202#(<= ~counter~0 9)} {212202#(<= ~counter~0 9)} #98#return; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,906 INFO L290 TraceCheckUtils]: 88: Hoare triple {212202#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212202#(<= ~counter~0 9)} is VALID [2022-04-08 06:13:37,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {212202#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {212227#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,909 INFO L272 TraceCheckUtils]: 91: Hoare triple {212227#(<= ~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)); {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,909 INFO L290 TraceCheckUtils]: 92: Hoare triple {212227#(<= ~counter~0 10)} ~cond := #in~cond; {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,909 INFO L290 TraceCheckUtils]: 93: Hoare triple {212227#(<= ~counter~0 10)} assume !(0 == ~cond); {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,910 INFO L290 TraceCheckUtils]: 94: Hoare triple {212227#(<= ~counter~0 10)} assume true; {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,910 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {212227#(<= ~counter~0 10)} {212227#(<= ~counter~0 10)} #98#return; {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,910 INFO L290 TraceCheckUtils]: 96: Hoare triple {212227#(<= ~counter~0 10)} assume !(~r~0 < 0); {212227#(<= ~counter~0 10)} is VALID [2022-04-08 06:13:37,912 INFO L290 TraceCheckUtils]: 97: Hoare triple {212227#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,912 INFO L290 TraceCheckUtils]: 98: Hoare triple {212252#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,913 INFO L272 TraceCheckUtils]: 99: Hoare triple {212252#(<= ~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)); {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,913 INFO L290 TraceCheckUtils]: 100: Hoare triple {212252#(<= ~counter~0 11)} ~cond := #in~cond; {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,913 INFO L290 TraceCheckUtils]: 101: Hoare triple {212252#(<= ~counter~0 11)} assume !(0 == ~cond); {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,914 INFO L290 TraceCheckUtils]: 102: Hoare triple {212252#(<= ~counter~0 11)} assume true; {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,914 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {212252#(<= ~counter~0 11)} {212252#(<= ~counter~0 11)} #94#return; {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,914 INFO L290 TraceCheckUtils]: 104: Hoare triple {212252#(<= ~counter~0 11)} assume !!(0 != ~r~0); {212252#(<= ~counter~0 11)} is VALID [2022-04-08 06:13:37,916 INFO L290 TraceCheckUtils]: 105: Hoare triple {212252#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,916 INFO L290 TraceCheckUtils]: 106: Hoare triple {212277#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,917 INFO L272 TraceCheckUtils]: 107: Hoare triple {212277#(<= ~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)); {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,917 INFO L290 TraceCheckUtils]: 108: Hoare triple {212277#(<= ~counter~0 12)} ~cond := #in~cond; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,917 INFO L290 TraceCheckUtils]: 109: Hoare triple {212277#(<= ~counter~0 12)} assume !(0 == ~cond); {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,918 INFO L290 TraceCheckUtils]: 110: Hoare triple {212277#(<= ~counter~0 12)} assume true; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,918 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {212277#(<= ~counter~0 12)} {212277#(<= ~counter~0 12)} #96#return; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,918 INFO L290 TraceCheckUtils]: 112: Hoare triple {212277#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212277#(<= ~counter~0 12)} is VALID [2022-04-08 06:13:37,920 INFO L290 TraceCheckUtils]: 113: Hoare triple {212277#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,920 INFO L290 TraceCheckUtils]: 114: Hoare triple {212302#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,921 INFO L272 TraceCheckUtils]: 115: Hoare triple {212302#(<= ~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)); {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,921 INFO L290 TraceCheckUtils]: 116: Hoare triple {212302#(<= ~counter~0 13)} ~cond := #in~cond; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,921 INFO L290 TraceCheckUtils]: 117: Hoare triple {212302#(<= ~counter~0 13)} assume !(0 == ~cond); {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {212302#(<= ~counter~0 13)} assume true; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,922 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {212302#(<= ~counter~0 13)} {212302#(<= ~counter~0 13)} #96#return; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,922 INFO L290 TraceCheckUtils]: 120: Hoare triple {212302#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212302#(<= ~counter~0 13)} is VALID [2022-04-08 06:13:37,924 INFO L290 TraceCheckUtils]: 121: Hoare triple {212302#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,925 INFO L290 TraceCheckUtils]: 122: Hoare triple {212327#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,925 INFO L272 TraceCheckUtils]: 123: Hoare triple {212327#(<= ~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)); {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,926 INFO L290 TraceCheckUtils]: 124: Hoare triple {212327#(<= ~counter~0 14)} ~cond := #in~cond; {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {212327#(<= ~counter~0 14)} assume !(0 == ~cond); {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,926 INFO L290 TraceCheckUtils]: 126: Hoare triple {212327#(<= ~counter~0 14)} assume true; {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,927 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {212327#(<= ~counter~0 14)} {212327#(<= ~counter~0 14)} #96#return; {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,927 INFO L290 TraceCheckUtils]: 128: Hoare triple {212327#(<= ~counter~0 14)} assume !(~r~0 > 0); {212327#(<= ~counter~0 14)} is VALID [2022-04-08 06:13:37,930 INFO L290 TraceCheckUtils]: 129: Hoare triple {212327#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,931 INFO L290 TraceCheckUtils]: 130: Hoare triple {212352#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,931 INFO L272 TraceCheckUtils]: 131: Hoare triple {212352#(<= ~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)); {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,931 INFO L290 TraceCheckUtils]: 132: Hoare triple {212352#(<= ~counter~0 15)} ~cond := #in~cond; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,932 INFO L290 TraceCheckUtils]: 133: Hoare triple {212352#(<= ~counter~0 15)} assume !(0 == ~cond); {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,932 INFO L290 TraceCheckUtils]: 134: Hoare triple {212352#(<= ~counter~0 15)} assume true; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,932 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {212352#(<= ~counter~0 15)} {212352#(<= ~counter~0 15)} #98#return; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,933 INFO L290 TraceCheckUtils]: 136: Hoare triple {212352#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212352#(<= ~counter~0 15)} is VALID [2022-04-08 06:13:37,935 INFO L290 TraceCheckUtils]: 137: Hoare triple {212352#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,936 INFO L290 TraceCheckUtils]: 138: Hoare triple {212377#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,936 INFO L272 TraceCheckUtils]: 139: Hoare triple {212377#(<= ~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)); {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,936 INFO L290 TraceCheckUtils]: 140: Hoare triple {212377#(<= ~counter~0 16)} ~cond := #in~cond; {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,937 INFO L290 TraceCheckUtils]: 141: Hoare triple {212377#(<= ~counter~0 16)} assume !(0 == ~cond); {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,937 INFO L290 TraceCheckUtils]: 142: Hoare triple {212377#(<= ~counter~0 16)} assume true; {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,937 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {212377#(<= ~counter~0 16)} {212377#(<= ~counter~0 16)} #98#return; {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,938 INFO L290 TraceCheckUtils]: 144: Hoare triple {212377#(<= ~counter~0 16)} assume !(~r~0 < 0); {212377#(<= ~counter~0 16)} is VALID [2022-04-08 06:13:37,941 INFO L290 TraceCheckUtils]: 145: Hoare triple {212377#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,941 INFO L290 TraceCheckUtils]: 146: Hoare triple {212402#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,942 INFO L272 TraceCheckUtils]: 147: Hoare triple {212402#(<= ~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)); {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,942 INFO L290 TraceCheckUtils]: 148: Hoare triple {212402#(<= ~counter~0 17)} ~cond := #in~cond; {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,942 INFO L290 TraceCheckUtils]: 149: Hoare triple {212402#(<= ~counter~0 17)} assume !(0 == ~cond); {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,943 INFO L290 TraceCheckUtils]: 150: Hoare triple {212402#(<= ~counter~0 17)} assume true; {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,943 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {212402#(<= ~counter~0 17)} {212402#(<= ~counter~0 17)} #94#return; {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,943 INFO L290 TraceCheckUtils]: 152: Hoare triple {212402#(<= ~counter~0 17)} assume !!(0 != ~r~0); {212402#(<= ~counter~0 17)} is VALID [2022-04-08 06:13:37,945 INFO L290 TraceCheckUtils]: 153: Hoare triple {212402#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,945 INFO L290 TraceCheckUtils]: 154: Hoare triple {212427#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,946 INFO L272 TraceCheckUtils]: 155: Hoare triple {212427#(<= ~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)); {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,946 INFO L290 TraceCheckUtils]: 156: Hoare triple {212427#(<= ~counter~0 18)} ~cond := #in~cond; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,946 INFO L290 TraceCheckUtils]: 157: Hoare triple {212427#(<= ~counter~0 18)} assume !(0 == ~cond); {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,947 INFO L290 TraceCheckUtils]: 158: Hoare triple {212427#(<= ~counter~0 18)} assume true; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,947 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {212427#(<= ~counter~0 18)} {212427#(<= ~counter~0 18)} #96#return; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,947 INFO L290 TraceCheckUtils]: 160: Hoare triple {212427#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212427#(<= ~counter~0 18)} is VALID [2022-04-08 06:13:37,949 INFO L290 TraceCheckUtils]: 161: Hoare triple {212427#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,949 INFO L290 TraceCheckUtils]: 162: Hoare triple {212452#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,950 INFO L272 TraceCheckUtils]: 163: Hoare triple {212452#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,950 INFO L290 TraceCheckUtils]: 164: Hoare triple {212452#(<= ~counter~0 19)} ~cond := #in~cond; {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,950 INFO L290 TraceCheckUtils]: 165: Hoare triple {212452#(<= ~counter~0 19)} assume !(0 == ~cond); {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,951 INFO L290 TraceCheckUtils]: 166: Hoare triple {212452#(<= ~counter~0 19)} assume true; {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,951 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {212452#(<= ~counter~0 19)} {212452#(<= ~counter~0 19)} #96#return; {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,951 INFO L290 TraceCheckUtils]: 168: Hoare triple {212452#(<= ~counter~0 19)} assume !(~r~0 > 0); {212452#(<= ~counter~0 19)} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 169: Hoare triple {212452#(<= ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212477#(<= |main_#t~post8| 19)} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 170: Hoare triple {212477#(<= |main_#t~post8| 19)} assume !(#t~post8 < 100);havoc #t~post8; {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 171: Hoare triple {211946#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 172: Hoare triple {211946#false} assume !(#t~post6 < 100);havoc #t~post6; {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L272 TraceCheckUtils]: 173: Hoare triple {211946#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 174: Hoare triple {211946#false} ~cond := #in~cond; {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 175: Hoare triple {211946#false} assume 0 == ~cond; {211946#false} is VALID [2022-04-08 06:13:37,952 INFO L290 TraceCheckUtils]: 176: Hoare triple {211946#false} assume !false; {211946#false} is VALID [2022-04-08 06:13:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 46 proven. 924 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:13:37,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:13:39,154 INFO L290 TraceCheckUtils]: 176: Hoare triple {211946#false} assume !false; {211946#false} is VALID [2022-04-08 06:13:39,154 INFO L290 TraceCheckUtils]: 175: Hoare triple {211946#false} assume 0 == ~cond; {211946#false} is VALID [2022-04-08 06:13:39,154 INFO L290 TraceCheckUtils]: 174: Hoare triple {211946#false} ~cond := #in~cond; {211946#false} is VALID [2022-04-08 06:13:39,154 INFO L272 TraceCheckUtils]: 173: Hoare triple {211946#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {211946#false} is VALID [2022-04-08 06:13:39,154 INFO L290 TraceCheckUtils]: 172: Hoare triple {211946#false} assume !(#t~post6 < 100);havoc #t~post6; {211946#false} is VALID [2022-04-08 06:13:39,155 INFO L290 TraceCheckUtils]: 171: Hoare triple {211946#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {211946#false} is VALID [2022-04-08 06:13:39,155 INFO L290 TraceCheckUtils]: 170: Hoare triple {212517#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {211946#false} is VALID [2022-04-08 06:13:39,155 INFO L290 TraceCheckUtils]: 169: Hoare triple {212521#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212517#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:13:39,155 INFO L290 TraceCheckUtils]: 168: Hoare triple {212521#(< ~counter~0 100)} assume !(~r~0 > 0); {212521#(< ~counter~0 100)} is VALID [2022-04-08 06:13:39,156 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {211945#true} {212521#(< ~counter~0 100)} #96#return; {212521#(< ~counter~0 100)} is VALID [2022-04-08 06:13:39,156 INFO L290 TraceCheckUtils]: 166: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,156 INFO L290 TraceCheckUtils]: 165: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,156 INFO L290 TraceCheckUtils]: 164: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,156 INFO L272 TraceCheckUtils]: 163: Hoare triple {212521#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,156 INFO L290 TraceCheckUtils]: 162: Hoare triple {212521#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {212521#(< ~counter~0 100)} is VALID [2022-04-08 06:13:39,162 INFO L290 TraceCheckUtils]: 161: Hoare triple {212546#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212521#(< ~counter~0 100)} is VALID [2022-04-08 06:13:39,162 INFO L290 TraceCheckUtils]: 160: Hoare triple {212546#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212546#(< ~counter~0 99)} is VALID [2022-04-08 06:13:39,163 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {211945#true} {212546#(< ~counter~0 99)} #96#return; {212546#(< ~counter~0 99)} is VALID [2022-04-08 06:13:39,163 INFO L290 TraceCheckUtils]: 158: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,163 INFO L290 TraceCheckUtils]: 157: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,163 INFO L290 TraceCheckUtils]: 156: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,163 INFO L272 TraceCheckUtils]: 155: Hoare triple {212546#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,163 INFO L290 TraceCheckUtils]: 154: Hoare triple {212546#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {212546#(< ~counter~0 99)} is VALID [2022-04-08 06:13:39,165 INFO L290 TraceCheckUtils]: 153: Hoare triple {212571#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212546#(< ~counter~0 99)} is VALID [2022-04-08 06:13:39,166 INFO L290 TraceCheckUtils]: 152: Hoare triple {212571#(< ~counter~0 98)} assume !!(0 != ~r~0); {212571#(< ~counter~0 98)} is VALID [2022-04-08 06:13:39,166 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {211945#true} {212571#(< ~counter~0 98)} #94#return; {212571#(< ~counter~0 98)} is VALID [2022-04-08 06:13:39,166 INFO L290 TraceCheckUtils]: 150: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,166 INFO L290 TraceCheckUtils]: 149: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,166 INFO L290 TraceCheckUtils]: 148: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,166 INFO L272 TraceCheckUtils]: 147: Hoare triple {212571#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,167 INFO L290 TraceCheckUtils]: 146: Hoare triple {212571#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {212571#(< ~counter~0 98)} is VALID [2022-04-08 06:13:39,168 INFO L290 TraceCheckUtils]: 145: Hoare triple {212596#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212571#(< ~counter~0 98)} is VALID [2022-04-08 06:13:39,169 INFO L290 TraceCheckUtils]: 144: Hoare triple {212596#(< ~counter~0 97)} assume !(~r~0 < 0); {212596#(< ~counter~0 97)} is VALID [2022-04-08 06:13:39,169 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {211945#true} {212596#(< ~counter~0 97)} #98#return; {212596#(< ~counter~0 97)} is VALID [2022-04-08 06:13:39,169 INFO L290 TraceCheckUtils]: 142: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,169 INFO L290 TraceCheckUtils]: 141: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,170 INFO L290 TraceCheckUtils]: 140: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,170 INFO L272 TraceCheckUtils]: 139: Hoare triple {212596#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,170 INFO L290 TraceCheckUtils]: 138: Hoare triple {212596#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {212596#(< ~counter~0 97)} is VALID [2022-04-08 06:13:39,172 INFO L290 TraceCheckUtils]: 137: Hoare triple {212621#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212596#(< ~counter~0 97)} is VALID [2022-04-08 06:13:39,173 INFO L290 TraceCheckUtils]: 136: Hoare triple {212621#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212621#(< ~counter~0 96)} is VALID [2022-04-08 06:13:39,173 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {211945#true} {212621#(< ~counter~0 96)} #98#return; {212621#(< ~counter~0 96)} is VALID [2022-04-08 06:13:39,173 INFO L290 TraceCheckUtils]: 134: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,173 INFO L290 TraceCheckUtils]: 133: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,173 INFO L290 TraceCheckUtils]: 132: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,173 INFO L272 TraceCheckUtils]: 131: Hoare triple {212621#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,174 INFO L290 TraceCheckUtils]: 130: Hoare triple {212621#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {212621#(< ~counter~0 96)} is VALID [2022-04-08 06:13:39,175 INFO L290 TraceCheckUtils]: 129: Hoare triple {212646#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212621#(< ~counter~0 96)} is VALID [2022-04-08 06:13:39,176 INFO L290 TraceCheckUtils]: 128: Hoare triple {212646#(< ~counter~0 95)} assume !(~r~0 > 0); {212646#(< ~counter~0 95)} is VALID [2022-04-08 06:13:39,176 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {211945#true} {212646#(< ~counter~0 95)} #96#return; {212646#(< ~counter~0 95)} is VALID [2022-04-08 06:13:39,176 INFO L290 TraceCheckUtils]: 126: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,176 INFO L290 TraceCheckUtils]: 125: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,177 INFO L290 TraceCheckUtils]: 124: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,177 INFO L272 TraceCheckUtils]: 123: Hoare triple {212646#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,177 INFO L290 TraceCheckUtils]: 122: Hoare triple {212646#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {212646#(< ~counter~0 95)} is VALID [2022-04-08 06:13:39,179 INFO L290 TraceCheckUtils]: 121: Hoare triple {212671#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212646#(< ~counter~0 95)} is VALID [2022-04-08 06:13:39,179 INFO L290 TraceCheckUtils]: 120: Hoare triple {212671#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212671#(< ~counter~0 94)} is VALID [2022-04-08 06:13:39,180 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {211945#true} {212671#(< ~counter~0 94)} #96#return; {212671#(< ~counter~0 94)} is VALID [2022-04-08 06:13:39,180 INFO L290 TraceCheckUtils]: 118: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,180 INFO L290 TraceCheckUtils]: 117: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,180 INFO L290 TraceCheckUtils]: 116: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,180 INFO L272 TraceCheckUtils]: 115: Hoare triple {212671#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,180 INFO L290 TraceCheckUtils]: 114: Hoare triple {212671#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {212671#(< ~counter~0 94)} is VALID [2022-04-08 06:13:39,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {212696#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212671#(< ~counter~0 94)} is VALID [2022-04-08 06:13:39,182 INFO L290 TraceCheckUtils]: 112: Hoare triple {212696#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212696#(< ~counter~0 93)} is VALID [2022-04-08 06:13:39,183 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {211945#true} {212696#(< ~counter~0 93)} #96#return; {212696#(< ~counter~0 93)} is VALID [2022-04-08 06:13:39,183 INFO L290 TraceCheckUtils]: 110: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,183 INFO L290 TraceCheckUtils]: 109: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,183 INFO L290 TraceCheckUtils]: 108: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,183 INFO L272 TraceCheckUtils]: 107: Hoare triple {212696#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,183 INFO L290 TraceCheckUtils]: 106: Hoare triple {212696#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {212696#(< ~counter~0 93)} is VALID [2022-04-08 06:13:39,185 INFO L290 TraceCheckUtils]: 105: Hoare triple {212721#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212696#(< ~counter~0 93)} is VALID [2022-04-08 06:13:39,185 INFO L290 TraceCheckUtils]: 104: Hoare triple {212721#(< ~counter~0 92)} assume !!(0 != ~r~0); {212721#(< ~counter~0 92)} is VALID [2022-04-08 06:13:39,186 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {211945#true} {212721#(< ~counter~0 92)} #94#return; {212721#(< ~counter~0 92)} is VALID [2022-04-08 06:13:39,186 INFO L290 TraceCheckUtils]: 102: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,186 INFO L290 TraceCheckUtils]: 101: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,186 INFO L290 TraceCheckUtils]: 100: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,186 INFO L272 TraceCheckUtils]: 99: Hoare triple {212721#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,186 INFO L290 TraceCheckUtils]: 98: Hoare triple {212721#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {212721#(< ~counter~0 92)} is VALID [2022-04-08 06:13:39,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {212746#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212721#(< ~counter~0 92)} is VALID [2022-04-08 06:13:39,188 INFO L290 TraceCheckUtils]: 96: Hoare triple {212746#(< ~counter~0 91)} assume !(~r~0 < 0); {212746#(< ~counter~0 91)} is VALID [2022-04-08 06:13:39,189 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {211945#true} {212746#(< ~counter~0 91)} #98#return; {212746#(< ~counter~0 91)} is VALID [2022-04-08 06:13:39,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,189 INFO L272 TraceCheckUtils]: 91: Hoare triple {212746#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {212746#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {212746#(< ~counter~0 91)} is VALID [2022-04-08 06:13:39,191 INFO L290 TraceCheckUtils]: 89: Hoare triple {212771#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212746#(< ~counter~0 91)} is VALID [2022-04-08 06:13:39,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {212771#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212771#(< ~counter~0 90)} is VALID [2022-04-08 06:13:39,192 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {211945#true} {212771#(< ~counter~0 90)} #98#return; {212771#(< ~counter~0 90)} is VALID [2022-04-08 06:13:39,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,192 INFO L272 TraceCheckUtils]: 83: Hoare triple {212771#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,192 INFO L290 TraceCheckUtils]: 82: Hoare triple {212771#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {212771#(< ~counter~0 90)} is VALID [2022-04-08 06:13:39,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {212796#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212771#(< ~counter~0 90)} is VALID [2022-04-08 06:13:39,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {212796#(< ~counter~0 89)} assume !(~r~0 > 0); {212796#(< ~counter~0 89)} is VALID [2022-04-08 06:13:39,194 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {211945#true} {212796#(< ~counter~0 89)} #96#return; {212796#(< ~counter~0 89)} is VALID [2022-04-08 06:13:39,195 INFO L290 TraceCheckUtils]: 78: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,195 INFO L290 TraceCheckUtils]: 77: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {212796#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {212796#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {212796#(< ~counter~0 89)} is VALID [2022-04-08 06:13:39,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {212821#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212796#(< ~counter~0 89)} is VALID [2022-04-08 06:13:39,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {212821#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212821#(< ~counter~0 88)} is VALID [2022-04-08 06:13:39,197 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {211945#true} {212821#(< ~counter~0 88)} #96#return; {212821#(< ~counter~0 88)} is VALID [2022-04-08 06:13:39,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,198 INFO L272 TraceCheckUtils]: 67: Hoare triple {212821#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {212821#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {212821#(< ~counter~0 88)} is VALID [2022-04-08 06:13:39,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {212846#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212821#(< ~counter~0 88)} is VALID [2022-04-08 06:13:39,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {212846#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {212846#(< ~counter~0 87)} is VALID [2022-04-08 06:13:39,200 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {211945#true} {212846#(< ~counter~0 87)} #96#return; {212846#(< ~counter~0 87)} is VALID [2022-04-08 06:13:39,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,201 INFO L272 TraceCheckUtils]: 59: Hoare triple {212846#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,201 INFO L290 TraceCheckUtils]: 58: Hoare triple {212846#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {212846#(< ~counter~0 87)} is VALID [2022-04-08 06:13:39,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {212871#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212846#(< ~counter~0 87)} is VALID [2022-04-08 06:13:39,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {212871#(< ~counter~0 86)} assume !!(0 != ~r~0); {212871#(< ~counter~0 86)} is VALID [2022-04-08 06:13:39,203 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {211945#true} {212871#(< ~counter~0 86)} #94#return; {212871#(< ~counter~0 86)} is VALID [2022-04-08 06:13:39,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,203 INFO L272 TraceCheckUtils]: 51: Hoare triple {212871#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {212871#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {212871#(< ~counter~0 86)} is VALID [2022-04-08 06:13:39,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {212896#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212871#(< ~counter~0 86)} is VALID [2022-04-08 06:13:39,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {212896#(< ~counter~0 85)} assume !(~r~0 < 0); {212896#(< ~counter~0 85)} is VALID [2022-04-08 06:13:39,206 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {211945#true} {212896#(< ~counter~0 85)} #98#return; {212896#(< ~counter~0 85)} is VALID [2022-04-08 06:13:39,206 INFO L290 TraceCheckUtils]: 46: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,206 INFO L272 TraceCheckUtils]: 43: Hoare triple {212896#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {212896#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {212896#(< ~counter~0 85)} is VALID [2022-04-08 06:13:39,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {212921#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212896#(< ~counter~0 85)} is VALID [2022-04-08 06:13:39,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {212921#(< ~counter~0 84)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {212921#(< ~counter~0 84)} is VALID [2022-04-08 06:13:39,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {211945#true} {212921#(< ~counter~0 84)} #98#return; {212921#(< ~counter~0 84)} is VALID [2022-04-08 06:13:39,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {212921#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {212921#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {212921#(< ~counter~0 84)} is VALID [2022-04-08 06:13:39,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {212946#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {212921#(< ~counter~0 84)} is VALID [2022-04-08 06:13:39,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {212946#(< ~counter~0 83)} assume !(~r~0 > 0); {212946#(< ~counter~0 83)} is VALID [2022-04-08 06:13:39,213 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {211945#true} {212946#(< ~counter~0 83)} #96#return; {212946#(< ~counter~0 83)} is VALID [2022-04-08 06:13:39,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,213 INFO L272 TraceCheckUtils]: 27: Hoare triple {212946#(< ~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)); {211945#true} is VALID [2022-04-08 06:13:39,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {212946#(< ~counter~0 83)} assume !!(#t~post7 < 100);havoc #t~post7; {212946#(< ~counter~0 83)} is VALID [2022-04-08 06:13:39,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {212971#(< ~counter~0 82)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {212946#(< ~counter~0 83)} is VALID [2022-04-08 06:13:39,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {212971#(< ~counter~0 82)} assume !!(0 != ~r~0); {212971#(< ~counter~0 82)} is VALID [2022-04-08 06:13:39,216 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {211945#true} {212971#(< ~counter~0 82)} #94#return; {212971#(< ~counter~0 82)} is VALID [2022-04-08 06:13:39,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,217 INFO L272 TraceCheckUtils]: 19: Hoare triple {212971#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {211945#true} is VALID [2022-04-08 06:13:39,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {212971#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {212971#(< ~counter~0 82)} is VALID [2022-04-08 06:13:39,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {212996#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {212971#(< ~counter~0 82)} is VALID [2022-04-08 06:13:39,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {212996#(< ~counter~0 81)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,220 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {211945#true} {212996#(< ~counter~0 81)} #92#return; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,220 INFO L272 TraceCheckUtils]: 11: Hoare triple {212996#(< ~counter~0 81)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {211945#true} is VALID [2022-04-08 06:13:39,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {211945#true} {212996#(< ~counter~0 81)} #90#return; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {211945#true} assume true; {211945#true} is VALID [2022-04-08 06:13:39,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {211945#true} assume !(0 == ~cond); {211945#true} is VALID [2022-04-08 06:13:39,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {211945#true} ~cond := #in~cond; {211945#true} is VALID [2022-04-08 06:13:39,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {212996#(< ~counter~0 81)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {211945#true} is VALID [2022-04-08 06:13:39,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {212996#(< ~counter~0 81)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {212996#(< ~counter~0 81)} call #t~ret9 := main(); {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212996#(< ~counter~0 81)} {211945#true} #102#return; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {212996#(< ~counter~0 81)} assume true; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {211945#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {212996#(< ~counter~0 81)} is VALID [2022-04-08 06:13:39,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {211945#true} call ULTIMATE.init(); {211945#true} is VALID [2022-04-08 06:13:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 46 proven. 240 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-08 06:13:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:13:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436472016] [2022-04-08 06:13:39,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:13:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114146263] [2022-04-08 06:13:39,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114146263] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:13:39,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:13:39,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-08 06:13:39,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:13:39,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536532144] [2022-04-08 06:13:39,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536532144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:13:39,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:13:39,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 06:13:39,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687701958] [2022-04-08 06:13:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:13:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 177 [2022-04-08 06:13:39,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:13:39,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:39,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:39,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 06:13:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:13:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 06:13:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 06:13:39,502 INFO L87 Difference]: Start difference. First operand 987 states and 1315 transitions. Second operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:47,620 INFO L93 Difference]: Finished difference Result 1191 states and 1617 transitions. [2022-04-08 06:13:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 06:13:47,620 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 177 [2022-04-08 06:13:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:13:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 416 transitions. [2022-04-08 06:13:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 416 transitions. [2022-04-08 06:13:47,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 416 transitions. [2022-04-08 06:13:48,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:13:48,272 INFO L225 Difference]: With dead ends: 1191 [2022-04-08 06:13:48,272 INFO L226 Difference]: Without dead ends: 1013 [2022-04-08 06:13:48,272 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1563, Invalid=2097, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 06:13:48,273 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 397 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:13:48,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 375 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 06:13:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-04-08 06:13:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1002. [2022-04-08 06:13:52,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:13:52,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1013 states. Second operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:52,903 INFO L74 IsIncluded]: Start isIncluded. First operand 1013 states. Second operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:52,904 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:52,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:52,936 INFO L93 Difference]: Finished difference Result 1013 states and 1344 transitions. [2022-04-08 06:13:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1344 transitions. [2022-04-08 06:13:52,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:52,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1013 states. [2022-04-08 06:13:52,939 INFO L87 Difference]: Start difference. First operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1013 states. [2022-04-08 06:13:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:13:52,972 INFO L93 Difference]: Finished difference Result 1013 states and 1344 transitions. [2022-04-08 06:13:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1344 transitions. [2022-04-08 06:13:52,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:13:52,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:13:52,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:13:52,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:13:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 750 states have (on average 1.172) internal successors, (879), 762 states have internal predecessors, (879), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 214 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:13:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1333 transitions. [2022-04-08 06:13:53,016 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1333 transitions. Word has length 177 [2022-04-08 06:13:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:13:53,016 INFO L478 AbstractCegarLoop]: Abstraction has 1002 states and 1333 transitions. [2022-04-08 06:13:53,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:13:53,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1002 states and 1333 transitions. [2022-04-08 06:14:02,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1333 edges. 1332 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1333 transitions. [2022-04-08 06:14:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-08 06:14:02,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:14:02,961 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 9, 9, 9, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:14:02,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-08 06:14:03,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:14:03,161 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:14:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:14:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2007520492, now seen corresponding path program 29 times [2022-04-08 06:14:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:03,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [283822277] [2022-04-08 06:14:03,162 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:14:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2007520492, now seen corresponding path program 30 times [2022-04-08 06:14:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:14:03,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915923584] [2022-04-08 06:14:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:14:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:14:03,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:14:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764612056] [2022-04-08 06:14:03,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:14:03,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:14:03,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:14:03,191 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:14:03,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 06:14:04,674 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 06:14:04,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:14:04,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 06:14:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:14:04,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:14:05,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {219496#true} call ULTIMATE.init(); {219496#true} is VALID [2022-04-08 06:14:05,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {219496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {219504#(<= ~counter~0 0)} assume true; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219504#(<= ~counter~0 0)} {219496#true} #102#return; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {219504#(<= ~counter~0 0)} call #t~ret9 := main(); {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {219504#(<= ~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; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,655 INFO L272 TraceCheckUtils]: 6: Hoare triple {219504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {219504#(<= ~counter~0 0)} ~cond := #in~cond; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {219504#(<= ~counter~0 0)} assume !(0 == ~cond); {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {219504#(<= ~counter~0 0)} assume true; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {219504#(<= ~counter~0 0)} {219504#(<= ~counter~0 0)} #90#return; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {219504#(<= ~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)); {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {219504#(<= ~counter~0 0)} ~cond := #in~cond; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {219504#(<= ~counter~0 0)} assume !(0 == ~cond); {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {219504#(<= ~counter~0 0)} assume true; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {219504#(<= ~counter~0 0)} {219504#(<= ~counter~0 0)} #92#return; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {219504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {219504#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:05,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {219504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {219553#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {219553#(<= ~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)); {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {219553#(<= ~counter~0 1)} ~cond := #in~cond; {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {219553#(<= ~counter~0 1)} assume !(0 == ~cond); {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {219553#(<= ~counter~0 1)} assume true; {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,684 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {219553#(<= ~counter~0 1)} {219553#(<= ~counter~0 1)} #94#return; {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {219553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {219553#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:05,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {219553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {219578#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,704 INFO L272 TraceCheckUtils]: 27: Hoare triple {219578#(<= ~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)); {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {219578#(<= ~counter~0 2)} ~cond := #in~cond; {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {219578#(<= ~counter~0 2)} assume !(0 == ~cond); {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {219578#(<= ~counter~0 2)} assume true; {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,705 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {219578#(<= ~counter~0 2)} {219578#(<= ~counter~0 2)} #96#return; {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {219578#(<= ~counter~0 2)} assume !(~r~0 > 0); {219578#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:05,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {219578#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {219603#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,709 INFO L272 TraceCheckUtils]: 35: Hoare triple {219603#(<= ~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)); {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {219603#(<= ~counter~0 3)} ~cond := #in~cond; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {219603#(<= ~counter~0 3)} assume !(0 == ~cond); {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {219603#(<= ~counter~0 3)} assume true; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,711 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {219603#(<= ~counter~0 3)} {219603#(<= ~counter~0 3)} #98#return; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {219603#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {219603#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:05,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {219603#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {219628#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,713 INFO L272 TraceCheckUtils]: 43: Hoare triple {219628#(<= ~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)); {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {219628#(<= ~counter~0 4)} ~cond := #in~cond; {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {219628#(<= ~counter~0 4)} assume !(0 == ~cond); {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {219628#(<= ~counter~0 4)} assume true; {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,715 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {219628#(<= ~counter~0 4)} {219628#(<= ~counter~0 4)} #98#return; {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {219628#(<= ~counter~0 4)} assume !(~r~0 < 0); {219628#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:05,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {219628#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {219653#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,717 INFO L272 TraceCheckUtils]: 51: Hoare triple {219653#(<= ~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)); {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {219653#(<= ~counter~0 5)} ~cond := #in~cond; {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {219653#(<= ~counter~0 5)} assume !(0 == ~cond); {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,718 INFO L290 TraceCheckUtils]: 54: Hoare triple {219653#(<= ~counter~0 5)} assume true; {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,719 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {219653#(<= ~counter~0 5)} {219653#(<= ~counter~0 5)} #94#return; {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {219653#(<= ~counter~0 5)} assume !!(0 != ~r~0); {219653#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:05,732 INFO L290 TraceCheckUtils]: 57: Hoare triple {219653#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {219678#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,748 INFO L272 TraceCheckUtils]: 59: Hoare triple {219678#(<= ~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)); {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {219678#(<= ~counter~0 6)} ~cond := #in~cond; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {219678#(<= ~counter~0 6)} assume !(0 == ~cond); {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {219678#(<= ~counter~0 6)} assume true; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,749 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {219678#(<= ~counter~0 6)} {219678#(<= ~counter~0 6)} #96#return; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {219678#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {219678#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:05,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {219678#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {219703#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,755 INFO L272 TraceCheckUtils]: 67: Hoare triple {219703#(<= ~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)); {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {219703#(<= ~counter~0 7)} ~cond := #in~cond; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {219703#(<= ~counter~0 7)} assume !(0 == ~cond); {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {219703#(<= ~counter~0 7)} assume true; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,756 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {219703#(<= ~counter~0 7)} {219703#(<= ~counter~0 7)} #96#return; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {219703#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {219703#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:05,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {219703#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,759 INFO L290 TraceCheckUtils]: 74: Hoare triple {219728#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,759 INFO L272 TraceCheckUtils]: 75: Hoare triple {219728#(<= ~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)); {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {219728#(<= ~counter~0 8)} ~cond := #in~cond; {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,760 INFO L290 TraceCheckUtils]: 77: Hoare triple {219728#(<= ~counter~0 8)} assume !(0 == ~cond); {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,760 INFO L290 TraceCheckUtils]: 78: Hoare triple {219728#(<= ~counter~0 8)} assume true; {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,760 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {219728#(<= ~counter~0 8)} {219728#(<= ~counter~0 8)} #96#return; {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,761 INFO L290 TraceCheckUtils]: 80: Hoare triple {219728#(<= ~counter~0 8)} assume !(~r~0 > 0); {219728#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:05,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {219728#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {219753#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,763 INFO L272 TraceCheckUtils]: 83: Hoare triple {219753#(<= ~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)); {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {219753#(<= ~counter~0 9)} ~cond := #in~cond; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,764 INFO L290 TraceCheckUtils]: 85: Hoare triple {219753#(<= ~counter~0 9)} assume !(0 == ~cond); {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,764 INFO L290 TraceCheckUtils]: 86: Hoare triple {219753#(<= ~counter~0 9)} assume true; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,765 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {219753#(<= ~counter~0 9)} {219753#(<= ~counter~0 9)} #98#return; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,765 INFO L290 TraceCheckUtils]: 88: Hoare triple {219753#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {219753#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:05,767 INFO L290 TraceCheckUtils]: 89: Hoare triple {219753#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,768 INFO L290 TraceCheckUtils]: 90: Hoare triple {219778#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,768 INFO L272 TraceCheckUtils]: 91: Hoare triple {219778#(<= ~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)); {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {219778#(<= ~counter~0 10)} ~cond := #in~cond; {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,769 INFO L290 TraceCheckUtils]: 93: Hoare triple {219778#(<= ~counter~0 10)} assume !(0 == ~cond); {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,769 INFO L290 TraceCheckUtils]: 94: Hoare triple {219778#(<= ~counter~0 10)} assume true; {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,769 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {219778#(<= ~counter~0 10)} {219778#(<= ~counter~0 10)} #98#return; {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,770 INFO L290 TraceCheckUtils]: 96: Hoare triple {219778#(<= ~counter~0 10)} assume !(~r~0 < 0); {219778#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:05,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {219778#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {219803#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,783 INFO L272 TraceCheckUtils]: 99: Hoare triple {219803#(<= ~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)); {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {219803#(<= ~counter~0 11)} ~cond := #in~cond; {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {219803#(<= ~counter~0 11)} assume !(0 == ~cond); {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {219803#(<= ~counter~0 11)} assume true; {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,785 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {219803#(<= ~counter~0 11)} {219803#(<= ~counter~0 11)} #94#return; {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,785 INFO L290 TraceCheckUtils]: 104: Hoare triple {219803#(<= ~counter~0 11)} assume !!(0 != ~r~0); {219803#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:05,790 INFO L290 TraceCheckUtils]: 105: Hoare triple {219803#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,790 INFO L290 TraceCheckUtils]: 106: Hoare triple {219828#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,791 INFO L272 TraceCheckUtils]: 107: Hoare triple {219828#(<= ~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)); {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,791 INFO L290 TraceCheckUtils]: 108: Hoare triple {219828#(<= ~counter~0 12)} ~cond := #in~cond; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,791 INFO L290 TraceCheckUtils]: 109: Hoare triple {219828#(<= ~counter~0 12)} assume !(0 == ~cond); {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,791 INFO L290 TraceCheckUtils]: 110: Hoare triple {219828#(<= ~counter~0 12)} assume true; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,792 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {219828#(<= ~counter~0 12)} {219828#(<= ~counter~0 12)} #96#return; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,792 INFO L290 TraceCheckUtils]: 112: Hoare triple {219828#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {219828#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:05,794 INFO L290 TraceCheckUtils]: 113: Hoare triple {219828#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,794 INFO L290 TraceCheckUtils]: 114: Hoare triple {219853#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,795 INFO L272 TraceCheckUtils]: 115: Hoare triple {219853#(<= ~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)); {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,795 INFO L290 TraceCheckUtils]: 116: Hoare triple {219853#(<= ~counter~0 13)} ~cond := #in~cond; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,795 INFO L290 TraceCheckUtils]: 117: Hoare triple {219853#(<= ~counter~0 13)} assume !(0 == ~cond); {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,795 INFO L290 TraceCheckUtils]: 118: Hoare triple {219853#(<= ~counter~0 13)} assume true; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,796 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {219853#(<= ~counter~0 13)} {219853#(<= ~counter~0 13)} #96#return; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,796 INFO L290 TraceCheckUtils]: 120: Hoare triple {219853#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {219853#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:05,798 INFO L290 TraceCheckUtils]: 121: Hoare triple {219853#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,798 INFO L290 TraceCheckUtils]: 122: Hoare triple {219878#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,799 INFO L272 TraceCheckUtils]: 123: Hoare triple {219878#(<= ~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)); {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,799 INFO L290 TraceCheckUtils]: 124: Hoare triple {219878#(<= ~counter~0 14)} ~cond := #in~cond; {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,800 INFO L290 TraceCheckUtils]: 125: Hoare triple {219878#(<= ~counter~0 14)} assume !(0 == ~cond); {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,800 INFO L290 TraceCheckUtils]: 126: Hoare triple {219878#(<= ~counter~0 14)} assume true; {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,800 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {219878#(<= ~counter~0 14)} {219878#(<= ~counter~0 14)} #96#return; {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,800 INFO L290 TraceCheckUtils]: 128: Hoare triple {219878#(<= ~counter~0 14)} assume !(~r~0 > 0); {219878#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:05,802 INFO L290 TraceCheckUtils]: 129: Hoare triple {219878#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,803 INFO L290 TraceCheckUtils]: 130: Hoare triple {219903#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,803 INFO L272 TraceCheckUtils]: 131: Hoare triple {219903#(<= ~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)); {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,803 INFO L290 TraceCheckUtils]: 132: Hoare triple {219903#(<= ~counter~0 15)} ~cond := #in~cond; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,804 INFO L290 TraceCheckUtils]: 133: Hoare triple {219903#(<= ~counter~0 15)} assume !(0 == ~cond); {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,804 INFO L290 TraceCheckUtils]: 134: Hoare triple {219903#(<= ~counter~0 15)} assume true; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,804 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {219903#(<= ~counter~0 15)} {219903#(<= ~counter~0 15)} #98#return; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,805 INFO L290 TraceCheckUtils]: 136: Hoare triple {219903#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {219903#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:05,806 INFO L290 TraceCheckUtils]: 137: Hoare triple {219903#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,807 INFO L290 TraceCheckUtils]: 138: Hoare triple {219928#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,807 INFO L272 TraceCheckUtils]: 139: Hoare triple {219928#(<= ~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)); {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,808 INFO L290 TraceCheckUtils]: 140: Hoare triple {219928#(<= ~counter~0 16)} ~cond := #in~cond; {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,808 INFO L290 TraceCheckUtils]: 141: Hoare triple {219928#(<= ~counter~0 16)} assume !(0 == ~cond); {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,808 INFO L290 TraceCheckUtils]: 142: Hoare triple {219928#(<= ~counter~0 16)} assume true; {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,808 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {219928#(<= ~counter~0 16)} {219928#(<= ~counter~0 16)} #98#return; {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,809 INFO L290 TraceCheckUtils]: 144: Hoare triple {219928#(<= ~counter~0 16)} assume !(~r~0 < 0); {219928#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:05,810 INFO L290 TraceCheckUtils]: 145: Hoare triple {219928#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,811 INFO L290 TraceCheckUtils]: 146: Hoare triple {219953#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,811 INFO L272 TraceCheckUtils]: 147: Hoare triple {219953#(<= ~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)); {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,811 INFO L290 TraceCheckUtils]: 148: Hoare triple {219953#(<= ~counter~0 17)} ~cond := #in~cond; {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,812 INFO L290 TraceCheckUtils]: 149: Hoare triple {219953#(<= ~counter~0 17)} assume !(0 == ~cond); {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,812 INFO L290 TraceCheckUtils]: 150: Hoare triple {219953#(<= ~counter~0 17)} assume true; {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,812 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {219953#(<= ~counter~0 17)} {219953#(<= ~counter~0 17)} #94#return; {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,813 INFO L290 TraceCheckUtils]: 152: Hoare triple {219953#(<= ~counter~0 17)} assume !!(0 != ~r~0); {219953#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:05,814 INFO L290 TraceCheckUtils]: 153: Hoare triple {219953#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,815 INFO L290 TraceCheckUtils]: 154: Hoare triple {219978#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,815 INFO L272 TraceCheckUtils]: 155: Hoare triple {219978#(<= ~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)); {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,816 INFO L290 TraceCheckUtils]: 156: Hoare triple {219978#(<= ~counter~0 18)} ~cond := #in~cond; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,816 INFO L290 TraceCheckUtils]: 157: Hoare triple {219978#(<= ~counter~0 18)} assume !(0 == ~cond); {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,816 INFO L290 TraceCheckUtils]: 158: Hoare triple {219978#(<= ~counter~0 18)} assume true; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,816 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {219978#(<= ~counter~0 18)} {219978#(<= ~counter~0 18)} #96#return; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,817 INFO L290 TraceCheckUtils]: 160: Hoare triple {219978#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {219978#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:05,819 INFO L290 TraceCheckUtils]: 161: Hoare triple {219978#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,819 INFO L290 TraceCheckUtils]: 162: Hoare triple {220003#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,819 INFO L272 TraceCheckUtils]: 163: Hoare triple {220003#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,820 INFO L290 TraceCheckUtils]: 164: Hoare triple {220003#(<= ~counter~0 19)} ~cond := #in~cond; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,820 INFO L290 TraceCheckUtils]: 165: Hoare triple {220003#(<= ~counter~0 19)} assume !(0 == ~cond); {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,820 INFO L290 TraceCheckUtils]: 166: Hoare triple {220003#(<= ~counter~0 19)} assume true; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,821 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {220003#(<= ~counter~0 19)} {220003#(<= ~counter~0 19)} #96#return; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,821 INFO L290 TraceCheckUtils]: 168: Hoare triple {220003#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220003#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:05,821 INFO L290 TraceCheckUtils]: 169: Hoare triple {220003#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220028#(<= |main_#t~post7| 19)} is VALID [2022-04-08 06:14:05,821 INFO L290 TraceCheckUtils]: 170: Hoare triple {220028#(<= |main_#t~post7| 19)} assume !(#t~post7 < 100);havoc #t~post7; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 171: Hoare triple {219497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 172: Hoare triple {219497#false} assume !(#t~post8 < 100);havoc #t~post8; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 173: Hoare triple {219497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 174: Hoare triple {219497#false} assume !(#t~post6 < 100);havoc #t~post6; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L272 TraceCheckUtils]: 175: Hoare triple {219497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 176: Hoare triple {219497#false} ~cond := #in~cond; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 177: Hoare triple {219497#false} assume 0 == ~cond; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L290 TraceCheckUtils]: 178: Hoare triple {219497#false} assume !false; {219497#false} is VALID [2022-04-08 06:14:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 58 proven. 930 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:14:05,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:14:07,008 INFO L290 TraceCheckUtils]: 178: Hoare triple {219497#false} assume !false; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 177: Hoare triple {219497#false} assume 0 == ~cond; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 176: Hoare triple {219497#false} ~cond := #in~cond; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L272 TraceCheckUtils]: 175: Hoare triple {219497#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 174: Hoare triple {219497#false} assume !(#t~post6 < 100);havoc #t~post6; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 173: Hoare triple {219497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 172: Hoare triple {219497#false} assume !(#t~post8 < 100);havoc #t~post8; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 171: Hoare triple {219497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {219497#false} is VALID [2022-04-08 06:14:07,009 INFO L290 TraceCheckUtils]: 170: Hoare triple {220080#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {219497#false} is VALID [2022-04-08 06:14:07,010 INFO L290 TraceCheckUtils]: 169: Hoare triple {220084#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220080#(< |main_#t~post7| 100)} is VALID [2022-04-08 06:14:07,010 INFO L290 TraceCheckUtils]: 168: Hoare triple {220084#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220084#(< ~counter~0 100)} is VALID [2022-04-08 06:14:07,010 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {219496#true} {220084#(< ~counter~0 100)} #96#return; {220084#(< ~counter~0 100)} is VALID [2022-04-08 06:14:07,010 INFO L290 TraceCheckUtils]: 166: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,010 INFO L290 TraceCheckUtils]: 165: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,010 INFO L290 TraceCheckUtils]: 164: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,011 INFO L272 TraceCheckUtils]: 163: Hoare triple {220084#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,011 INFO L290 TraceCheckUtils]: 162: Hoare triple {220084#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {220084#(< ~counter~0 100)} is VALID [2022-04-08 06:14:07,015 INFO L290 TraceCheckUtils]: 161: Hoare triple {220109#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220084#(< ~counter~0 100)} is VALID [2022-04-08 06:14:07,015 INFO L290 TraceCheckUtils]: 160: Hoare triple {220109#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220109#(< ~counter~0 99)} is VALID [2022-04-08 06:14:07,016 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {219496#true} {220109#(< ~counter~0 99)} #96#return; {220109#(< ~counter~0 99)} is VALID [2022-04-08 06:14:07,016 INFO L290 TraceCheckUtils]: 158: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,016 INFO L290 TraceCheckUtils]: 157: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,016 INFO L290 TraceCheckUtils]: 156: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,016 INFO L272 TraceCheckUtils]: 155: Hoare triple {220109#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,016 INFO L290 TraceCheckUtils]: 154: Hoare triple {220109#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {220109#(< ~counter~0 99)} is VALID [2022-04-08 06:14:07,018 INFO L290 TraceCheckUtils]: 153: Hoare triple {220134#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220109#(< ~counter~0 99)} is VALID [2022-04-08 06:14:07,018 INFO L290 TraceCheckUtils]: 152: Hoare triple {220134#(< ~counter~0 98)} assume !!(0 != ~r~0); {220134#(< ~counter~0 98)} is VALID [2022-04-08 06:14:07,019 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {219496#true} {220134#(< ~counter~0 98)} #94#return; {220134#(< ~counter~0 98)} is VALID [2022-04-08 06:14:07,019 INFO L290 TraceCheckUtils]: 150: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,019 INFO L290 TraceCheckUtils]: 149: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,019 INFO L290 TraceCheckUtils]: 148: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,019 INFO L272 TraceCheckUtils]: 147: Hoare triple {220134#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,019 INFO L290 TraceCheckUtils]: 146: Hoare triple {220134#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {220134#(< ~counter~0 98)} is VALID [2022-04-08 06:14:07,021 INFO L290 TraceCheckUtils]: 145: Hoare triple {220159#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {220134#(< ~counter~0 98)} is VALID [2022-04-08 06:14:07,021 INFO L290 TraceCheckUtils]: 144: Hoare triple {220159#(< ~counter~0 97)} assume !(~r~0 < 0); {220159#(< ~counter~0 97)} is VALID [2022-04-08 06:14:07,022 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {219496#true} {220159#(< ~counter~0 97)} #98#return; {220159#(< ~counter~0 97)} is VALID [2022-04-08 06:14:07,022 INFO L290 TraceCheckUtils]: 142: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,022 INFO L290 TraceCheckUtils]: 141: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,022 INFO L290 TraceCheckUtils]: 140: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,022 INFO L272 TraceCheckUtils]: 139: Hoare triple {220159#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,022 INFO L290 TraceCheckUtils]: 138: Hoare triple {220159#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {220159#(< ~counter~0 97)} is VALID [2022-04-08 06:14:07,024 INFO L290 TraceCheckUtils]: 137: Hoare triple {220184#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220159#(< ~counter~0 97)} is VALID [2022-04-08 06:14:07,024 INFO L290 TraceCheckUtils]: 136: Hoare triple {220184#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {220184#(< ~counter~0 96)} is VALID [2022-04-08 06:14:07,024 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {219496#true} {220184#(< ~counter~0 96)} #98#return; {220184#(< ~counter~0 96)} is VALID [2022-04-08 06:14:07,024 INFO L290 TraceCheckUtils]: 134: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,024 INFO L290 TraceCheckUtils]: 133: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,024 INFO L290 TraceCheckUtils]: 132: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,024 INFO L272 TraceCheckUtils]: 131: Hoare triple {220184#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,025 INFO L290 TraceCheckUtils]: 130: Hoare triple {220184#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {220184#(< ~counter~0 96)} is VALID [2022-04-08 06:14:07,026 INFO L290 TraceCheckUtils]: 129: Hoare triple {220209#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220184#(< ~counter~0 96)} is VALID [2022-04-08 06:14:07,027 INFO L290 TraceCheckUtils]: 128: Hoare triple {220209#(< ~counter~0 95)} assume !(~r~0 > 0); {220209#(< ~counter~0 95)} is VALID [2022-04-08 06:14:07,027 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {219496#true} {220209#(< ~counter~0 95)} #96#return; {220209#(< ~counter~0 95)} is VALID [2022-04-08 06:14:07,027 INFO L290 TraceCheckUtils]: 126: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,027 INFO L290 TraceCheckUtils]: 125: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,027 INFO L290 TraceCheckUtils]: 124: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,027 INFO L272 TraceCheckUtils]: 123: Hoare triple {220209#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,028 INFO L290 TraceCheckUtils]: 122: Hoare triple {220209#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {220209#(< ~counter~0 95)} is VALID [2022-04-08 06:14:07,029 INFO L290 TraceCheckUtils]: 121: Hoare triple {220234#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220209#(< ~counter~0 95)} is VALID [2022-04-08 06:14:07,029 INFO L290 TraceCheckUtils]: 120: Hoare triple {220234#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220234#(< ~counter~0 94)} is VALID [2022-04-08 06:14:07,030 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {219496#true} {220234#(< ~counter~0 94)} #96#return; {220234#(< ~counter~0 94)} is VALID [2022-04-08 06:14:07,030 INFO L290 TraceCheckUtils]: 118: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,030 INFO L290 TraceCheckUtils]: 117: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,030 INFO L290 TraceCheckUtils]: 116: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,030 INFO L272 TraceCheckUtils]: 115: Hoare triple {220234#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,030 INFO L290 TraceCheckUtils]: 114: Hoare triple {220234#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {220234#(< ~counter~0 94)} is VALID [2022-04-08 06:14:07,032 INFO L290 TraceCheckUtils]: 113: Hoare triple {220259#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220234#(< ~counter~0 94)} is VALID [2022-04-08 06:14:07,032 INFO L290 TraceCheckUtils]: 112: Hoare triple {220259#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220259#(< ~counter~0 93)} is VALID [2022-04-08 06:14:07,033 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {219496#true} {220259#(< ~counter~0 93)} #96#return; {220259#(< ~counter~0 93)} is VALID [2022-04-08 06:14:07,033 INFO L290 TraceCheckUtils]: 110: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,033 INFO L290 TraceCheckUtils]: 109: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,033 INFO L290 TraceCheckUtils]: 108: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,033 INFO L272 TraceCheckUtils]: 107: Hoare triple {220259#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,033 INFO L290 TraceCheckUtils]: 106: Hoare triple {220259#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {220259#(< ~counter~0 93)} is VALID [2022-04-08 06:14:07,035 INFO L290 TraceCheckUtils]: 105: Hoare triple {220284#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220259#(< ~counter~0 93)} is VALID [2022-04-08 06:14:07,035 INFO L290 TraceCheckUtils]: 104: Hoare triple {220284#(< ~counter~0 92)} assume !!(0 != ~r~0); {220284#(< ~counter~0 92)} is VALID [2022-04-08 06:14:07,035 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {219496#true} {220284#(< ~counter~0 92)} #94#return; {220284#(< ~counter~0 92)} is VALID [2022-04-08 06:14:07,035 INFO L290 TraceCheckUtils]: 102: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,035 INFO L290 TraceCheckUtils]: 101: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,036 INFO L272 TraceCheckUtils]: 99: Hoare triple {220284#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,036 INFO L290 TraceCheckUtils]: 98: Hoare triple {220284#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {220284#(< ~counter~0 92)} is VALID [2022-04-08 06:14:07,037 INFO L290 TraceCheckUtils]: 97: Hoare triple {220309#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {220284#(< ~counter~0 92)} is VALID [2022-04-08 06:14:07,038 INFO L290 TraceCheckUtils]: 96: Hoare triple {220309#(< ~counter~0 91)} assume !(~r~0 < 0); {220309#(< ~counter~0 91)} is VALID [2022-04-08 06:14:07,038 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {219496#true} {220309#(< ~counter~0 91)} #98#return; {220309#(< ~counter~0 91)} is VALID [2022-04-08 06:14:07,038 INFO L290 TraceCheckUtils]: 94: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,038 INFO L290 TraceCheckUtils]: 93: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,038 INFO L290 TraceCheckUtils]: 92: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,038 INFO L272 TraceCheckUtils]: 91: Hoare triple {220309#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {220309#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {220309#(< ~counter~0 91)} is VALID [2022-04-08 06:14:07,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {220334#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220309#(< ~counter~0 91)} is VALID [2022-04-08 06:14:07,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {220334#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {220334#(< ~counter~0 90)} is VALID [2022-04-08 06:14:07,041 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {219496#true} {220334#(< ~counter~0 90)} #98#return; {220334#(< ~counter~0 90)} is VALID [2022-04-08 06:14:07,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,041 INFO L272 TraceCheckUtils]: 83: Hoare triple {220334#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {220334#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {220334#(< ~counter~0 90)} is VALID [2022-04-08 06:14:07,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {220359#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220334#(< ~counter~0 90)} is VALID [2022-04-08 06:14:07,043 INFO L290 TraceCheckUtils]: 80: Hoare triple {220359#(< ~counter~0 89)} assume !(~r~0 > 0); {220359#(< ~counter~0 89)} is VALID [2022-04-08 06:14:07,044 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {219496#true} {220359#(< ~counter~0 89)} #96#return; {220359#(< ~counter~0 89)} is VALID [2022-04-08 06:14:07,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,044 INFO L272 TraceCheckUtils]: 75: Hoare triple {220359#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {220359#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {220359#(< ~counter~0 89)} is VALID [2022-04-08 06:14:07,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {220384#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220359#(< ~counter~0 89)} is VALID [2022-04-08 06:14:07,046 INFO L290 TraceCheckUtils]: 72: Hoare triple {220384#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220384#(< ~counter~0 88)} is VALID [2022-04-08 06:14:07,046 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {219496#true} {220384#(< ~counter~0 88)} #96#return; {220384#(< ~counter~0 88)} is VALID [2022-04-08 06:14:07,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,047 INFO L290 TraceCheckUtils]: 69: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,047 INFO L272 TraceCheckUtils]: 67: Hoare triple {220384#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,047 INFO L290 TraceCheckUtils]: 66: Hoare triple {220384#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {220384#(< ~counter~0 88)} is VALID [2022-04-08 06:14:07,049 INFO L290 TraceCheckUtils]: 65: Hoare triple {220409#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220384#(< ~counter~0 88)} is VALID [2022-04-08 06:14:07,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {220409#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {220409#(< ~counter~0 87)} is VALID [2022-04-08 06:14:07,049 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {219496#true} {220409#(< ~counter~0 87)} #96#return; {220409#(< ~counter~0 87)} is VALID [2022-04-08 06:14:07,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,049 INFO L290 TraceCheckUtils]: 61: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,049 INFO L290 TraceCheckUtils]: 60: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,049 INFO L272 TraceCheckUtils]: 59: Hoare triple {220409#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {220409#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {220409#(< ~counter~0 87)} is VALID [2022-04-08 06:14:07,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {220434#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220409#(< ~counter~0 87)} is VALID [2022-04-08 06:14:07,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {220434#(< ~counter~0 86)} assume !!(0 != ~r~0); {220434#(< ~counter~0 86)} is VALID [2022-04-08 06:14:07,052 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {219496#true} {220434#(< ~counter~0 86)} #94#return; {220434#(< ~counter~0 86)} is VALID [2022-04-08 06:14:07,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,052 INFO L272 TraceCheckUtils]: 51: Hoare triple {220434#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {220434#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {220434#(< ~counter~0 86)} is VALID [2022-04-08 06:14:07,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {220459#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {220434#(< ~counter~0 86)} is VALID [2022-04-08 06:14:07,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {220459#(< ~counter~0 85)} assume !(~r~0 < 0); {220459#(< ~counter~0 85)} is VALID [2022-04-08 06:14:07,055 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {219496#true} {220459#(< ~counter~0 85)} #98#return; {220459#(< ~counter~0 85)} is VALID [2022-04-08 06:14:07,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,055 INFO L272 TraceCheckUtils]: 43: Hoare triple {220459#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {220459#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {220459#(< ~counter~0 85)} is VALID [2022-04-08 06:14:07,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {220484#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220459#(< ~counter~0 85)} is VALID [2022-04-08 06:14:07,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {220484#(< ~counter~0 84)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {220484#(< ~counter~0 84)} is VALID [2022-04-08 06:14:07,058 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {219496#true} {220484#(< ~counter~0 84)} #98#return; {220484#(< ~counter~0 84)} is VALID [2022-04-08 06:14:07,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {220484#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {220484#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {220484#(< ~counter~0 84)} is VALID [2022-04-08 06:14:07,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {220509#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {220484#(< ~counter~0 84)} is VALID [2022-04-08 06:14:07,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {220509#(< ~counter~0 83)} assume !(~r~0 > 0); {220509#(< ~counter~0 83)} is VALID [2022-04-08 06:14:07,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {219496#true} {220509#(< ~counter~0 83)} #96#return; {220509#(< ~counter~0 83)} is VALID [2022-04-08 06:14:07,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {220509#(< ~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)); {219496#true} is VALID [2022-04-08 06:14:07,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {220509#(< ~counter~0 83)} assume !!(#t~post7 < 100);havoc #t~post7; {220509#(< ~counter~0 83)} is VALID [2022-04-08 06:14:07,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {220534#(< ~counter~0 82)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {220509#(< ~counter~0 83)} is VALID [2022-04-08 06:14:07,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {220534#(< ~counter~0 82)} assume !!(0 != ~r~0); {220534#(< ~counter~0 82)} is VALID [2022-04-08 06:14:07,063 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {219496#true} {220534#(< ~counter~0 82)} #94#return; {220534#(< ~counter~0 82)} is VALID [2022-04-08 06:14:07,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {220534#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {219496#true} is VALID [2022-04-08 06:14:07,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {220534#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {220534#(< ~counter~0 82)} is VALID [2022-04-08 06:14:07,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {220559#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {220534#(< ~counter~0 82)} is VALID [2022-04-08 06:14:07,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {220559#(< ~counter~0 81)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,066 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {219496#true} {220559#(< ~counter~0 81)} #92#return; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,066 INFO L272 TraceCheckUtils]: 11: Hoare triple {220559#(< ~counter~0 81)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {219496#true} is VALID [2022-04-08 06:14:07,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {219496#true} {220559#(< ~counter~0 81)} #90#return; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {219496#true} assume true; {219496#true} is VALID [2022-04-08 06:14:07,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {219496#true} assume !(0 == ~cond); {219496#true} is VALID [2022-04-08 06:14:07,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {219496#true} ~cond := #in~cond; {219496#true} is VALID [2022-04-08 06:14:07,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {220559#(< ~counter~0 81)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {219496#true} is VALID [2022-04-08 06:14:07,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {220559#(< ~counter~0 81)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {220559#(< ~counter~0 81)} call #t~ret9 := main(); {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220559#(< ~counter~0 81)} {219496#true} #102#return; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {220559#(< ~counter~0 81)} assume true; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {219496#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {220559#(< ~counter~0 81)} is VALID [2022-04-08 06:14:07,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {219496#true} call ULTIMATE.init(); {219496#true} is VALID [2022-04-08 06:14:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 58 proven. 246 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-08 06:14:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:14:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915923584] [2022-04-08 06:14:07,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:14:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764612056] [2022-04-08 06:14:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764612056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:14:07,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:14:07,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-08 06:14:07,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:14:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [283822277] [2022-04-08 06:14:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [283822277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:14:07,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:14:07,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 06:14:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173651931] [2022-04-08 06:14:07,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:14:07,070 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 179 [2022-04-08 06:14:07,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:14:07,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:14:07,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:07,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 06:14:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 06:14:07,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 06:14:07,331 INFO L87 Difference]: Start difference. First operand 1002 states and 1333 transitions. Second operand has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:14:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:14,713 INFO L93 Difference]: Finished difference Result 1189 states and 1611 transitions. [2022-04-08 06:14:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 06:14:14,713 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 179 [2022-04-08 06:14:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:14:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:14:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 416 transitions. [2022-04-08 06:14:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:14:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 416 transitions. [2022-04-08 06:14:14,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 416 transitions. [2022-04-08 06:14:15,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:15,482 INFO L225 Difference]: With dead ends: 1189 [2022-04-08 06:14:15,482 INFO L226 Difference]: Without dead ends: 1019 [2022-04-08 06:14:15,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1622, Invalid=2160, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 06:14:15,483 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 366 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:14:15,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 399 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 06:14:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2022-04-08 06:14:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2022-04-08 06:14:20,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:14:20,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1019 states. Second operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:14:20,326 INFO L74 IsIncluded]: Start isIncluded. First operand 1019 states. Second operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:14:20,327 INFO L87 Difference]: Start difference. First operand 1019 states. Second operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:14:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:20,360 INFO L93 Difference]: Finished difference Result 1019 states and 1350 transitions. [2022-04-08 06:14:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1350 transitions. [2022-04-08 06:14:20,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:20,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:20,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1019 states. [2022-04-08 06:14:20,363 INFO L87 Difference]: Start difference. First operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1019 states. [2022-04-08 06:14:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:20,395 INFO L93 Difference]: Finished difference Result 1019 states and 1350 transitions. [2022-04-08 06:14:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1350 transitions. [2022-04-08 06:14:20,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:20,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:20,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:14:20,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:14:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 767 states have (on average 1.1681877444589308) internal successors, (896), 774 states have internal predecessors, (896), 228 states have call successors, (228), 25 states have call predecessors, (228), 23 states have return successors, (226), 219 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-08 06:14:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1350 transitions. [2022-04-08 06:14:20,440 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1350 transitions. Word has length 179 [2022-04-08 06:14:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:14:20,441 INFO L478 AbstractCegarLoop]: Abstraction has 1019 states and 1350 transitions. [2022-04-08 06:14:20,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 22 states have internal predecessors, (130), 22 states have call successors, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-08 06:14:20,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1019 states and 1350 transitions. [2022-04-08 06:14:32,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1350 edges. 1348 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1350 transitions. [2022-04-08 06:14:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-04-08 06:14:32,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:14:32,227 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 11, 11, 11, 8, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:14:32,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-08 06:14:32,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-08 06:14:32,427 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:14:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:14:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1274488939, now seen corresponding path program 23 times [2022-04-08 06:14:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:32,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186201226] [2022-04-08 06:14:32,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:14:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1274488939, now seen corresponding path program 24 times [2022-04-08 06:14:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:14:32,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587615213] [2022-04-08 06:14:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:14:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:14:32,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:14:32,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717692930] [2022-04-08 06:14:32,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:14:32,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:14:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:14:32,468 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:14:32,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 06:14:33,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-08 06:14:33,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:14:33,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 06:14:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:14:33,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:14:34,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {227103#true} call ULTIMATE.init(); {227103#true} is VALID [2022-04-08 06:14:34,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {227103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {227111#(<= ~counter~0 0)} assume true; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227111#(<= ~counter~0 0)} {227103#true} #102#return; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {227111#(<= ~counter~0 0)} call #t~ret9 := main(); {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {227111#(<= ~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; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {227111#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {227111#(<= ~counter~0 0)} ~cond := #in~cond; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {227111#(<= ~counter~0 0)} assume !(0 == ~cond); {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {227111#(<= ~counter~0 0)} assume true; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {227111#(<= ~counter~0 0)} {227111#(<= ~counter~0 0)} #90#return; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {227111#(<= ~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)); {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {227111#(<= ~counter~0 0)} ~cond := #in~cond; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {227111#(<= ~counter~0 0)} assume !(0 == ~cond); {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {227111#(<= ~counter~0 0)} assume true; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {227111#(<= ~counter~0 0)} {227111#(<= ~counter~0 0)} #92#return; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {227111#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {227111#(<= ~counter~0 0)} is VALID [2022-04-08 06:14:34,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {227111#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {227160#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,918 INFO L272 TraceCheckUtils]: 19: Hoare triple {227160#(<= ~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)); {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {227160#(<= ~counter~0 1)} ~cond := #in~cond; {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {227160#(<= ~counter~0 1)} assume !(0 == ~cond); {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {227160#(<= ~counter~0 1)} assume true; {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,919 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {227160#(<= ~counter~0 1)} {227160#(<= ~counter~0 1)} #94#return; {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {227160#(<= ~counter~0 1)} assume !!(0 != ~r~0); {227160#(<= ~counter~0 1)} is VALID [2022-04-08 06:14:34,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {227160#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {227185#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,922 INFO L272 TraceCheckUtils]: 27: Hoare triple {227185#(<= ~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)); {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {227185#(<= ~counter~0 2)} ~cond := #in~cond; {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {227185#(<= ~counter~0 2)} assume !(0 == ~cond); {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {227185#(<= ~counter~0 2)} assume true; {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,924 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {227185#(<= ~counter~0 2)} {227185#(<= ~counter~0 2)} #96#return; {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {227185#(<= ~counter~0 2)} assume !(~r~0 > 0); {227185#(<= ~counter~0 2)} is VALID [2022-04-08 06:14:34,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {227185#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {227210#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,926 INFO L272 TraceCheckUtils]: 35: Hoare triple {227210#(<= ~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)); {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {227210#(<= ~counter~0 3)} ~cond := #in~cond; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {227210#(<= ~counter~0 3)} assume !(0 == ~cond); {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {227210#(<= ~counter~0 3)} assume true; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,928 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {227210#(<= ~counter~0 3)} {227210#(<= ~counter~0 3)} #98#return; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {227210#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {227210#(<= ~counter~0 3)} is VALID [2022-04-08 06:14:34,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {227210#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {227235#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,930 INFO L272 TraceCheckUtils]: 43: Hoare triple {227235#(<= ~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)); {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,931 INFO L290 TraceCheckUtils]: 44: Hoare triple {227235#(<= ~counter~0 4)} ~cond := #in~cond; {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,931 INFO L290 TraceCheckUtils]: 45: Hoare triple {227235#(<= ~counter~0 4)} assume !(0 == ~cond); {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,931 INFO L290 TraceCheckUtils]: 46: Hoare triple {227235#(<= ~counter~0 4)} assume true; {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,932 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {227235#(<= ~counter~0 4)} {227235#(<= ~counter~0 4)} #98#return; {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {227235#(<= ~counter~0 4)} assume !(~r~0 < 0); {227235#(<= ~counter~0 4)} is VALID [2022-04-08 06:14:34,934 INFO L290 TraceCheckUtils]: 49: Hoare triple {227235#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {227260#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,934 INFO L272 TraceCheckUtils]: 51: Hoare triple {227260#(<= ~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)); {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {227260#(<= ~counter~0 5)} ~cond := #in~cond; {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {227260#(<= ~counter~0 5)} assume !(0 == ~cond); {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {227260#(<= ~counter~0 5)} assume true; {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,936 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {227260#(<= ~counter~0 5)} {227260#(<= ~counter~0 5)} #94#return; {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {227260#(<= ~counter~0 5)} assume !!(0 != ~r~0); {227260#(<= ~counter~0 5)} is VALID [2022-04-08 06:14:34,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {227260#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {227285#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,938 INFO L272 TraceCheckUtils]: 59: Hoare triple {227285#(<= ~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)); {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {227285#(<= ~counter~0 6)} ~cond := #in~cond; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,939 INFO L290 TraceCheckUtils]: 61: Hoare triple {227285#(<= ~counter~0 6)} assume !(0 == ~cond); {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,939 INFO L290 TraceCheckUtils]: 62: Hoare triple {227285#(<= ~counter~0 6)} assume true; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,940 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {227285#(<= ~counter~0 6)} {227285#(<= ~counter~0 6)} #96#return; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {227285#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227285#(<= ~counter~0 6)} is VALID [2022-04-08 06:14:34,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {227285#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {227310#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,943 INFO L272 TraceCheckUtils]: 67: Hoare triple {227310#(<= ~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)); {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {227310#(<= ~counter~0 7)} ~cond := #in~cond; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {227310#(<= ~counter~0 7)} assume !(0 == ~cond); {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {227310#(<= ~counter~0 7)} assume true; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,944 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {227310#(<= ~counter~0 7)} {227310#(<= ~counter~0 7)} #96#return; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,945 INFO L290 TraceCheckUtils]: 72: Hoare triple {227310#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227310#(<= ~counter~0 7)} is VALID [2022-04-08 06:14:34,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {227310#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,947 INFO L290 TraceCheckUtils]: 74: Hoare triple {227335#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,947 INFO L272 TraceCheckUtils]: 75: Hoare triple {227335#(<= ~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)); {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,947 INFO L290 TraceCheckUtils]: 76: Hoare triple {227335#(<= ~counter~0 8)} ~cond := #in~cond; {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {227335#(<= ~counter~0 8)} assume !(0 == ~cond); {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {227335#(<= ~counter~0 8)} assume true; {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,948 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {227335#(<= ~counter~0 8)} {227335#(<= ~counter~0 8)} #96#return; {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,949 INFO L290 TraceCheckUtils]: 80: Hoare triple {227335#(<= ~counter~0 8)} assume !(~r~0 > 0); {227335#(<= ~counter~0 8)} is VALID [2022-04-08 06:14:34,950 INFO L290 TraceCheckUtils]: 81: Hoare triple {227335#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,951 INFO L290 TraceCheckUtils]: 82: Hoare triple {227360#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,951 INFO L272 TraceCheckUtils]: 83: Hoare triple {227360#(<= ~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)); {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,951 INFO L290 TraceCheckUtils]: 84: Hoare triple {227360#(<= ~counter~0 9)} ~cond := #in~cond; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,952 INFO L290 TraceCheckUtils]: 85: Hoare triple {227360#(<= ~counter~0 9)} assume !(0 == ~cond); {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {227360#(<= ~counter~0 9)} assume true; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,952 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {227360#(<= ~counter~0 9)} {227360#(<= ~counter~0 9)} #98#return; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,953 INFO L290 TraceCheckUtils]: 88: Hoare triple {227360#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {227360#(<= ~counter~0 9)} is VALID [2022-04-08 06:14:34,954 INFO L290 TraceCheckUtils]: 89: Hoare triple {227360#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {227385#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,955 INFO L272 TraceCheckUtils]: 91: Hoare triple {227385#(<= ~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)); {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {227385#(<= ~counter~0 10)} ~cond := #in~cond; {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,956 INFO L290 TraceCheckUtils]: 93: Hoare triple {227385#(<= ~counter~0 10)} assume !(0 == ~cond); {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,956 INFO L290 TraceCheckUtils]: 94: Hoare triple {227385#(<= ~counter~0 10)} assume true; {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,956 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {227385#(<= ~counter~0 10)} {227385#(<= ~counter~0 10)} #98#return; {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,957 INFO L290 TraceCheckUtils]: 96: Hoare triple {227385#(<= ~counter~0 10)} assume !(~r~0 < 0); {227385#(<= ~counter~0 10)} is VALID [2022-04-08 06:14:34,958 INFO L290 TraceCheckUtils]: 97: Hoare triple {227385#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {227410#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,959 INFO L272 TraceCheckUtils]: 99: Hoare triple {227410#(<= ~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)); {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,959 INFO L290 TraceCheckUtils]: 100: Hoare triple {227410#(<= ~counter~0 11)} ~cond := #in~cond; {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,960 INFO L290 TraceCheckUtils]: 101: Hoare triple {227410#(<= ~counter~0 11)} assume !(0 == ~cond); {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,960 INFO L290 TraceCheckUtils]: 102: Hoare triple {227410#(<= ~counter~0 11)} assume true; {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,960 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {227410#(<= ~counter~0 11)} {227410#(<= ~counter~0 11)} #94#return; {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,961 INFO L290 TraceCheckUtils]: 104: Hoare triple {227410#(<= ~counter~0 11)} assume !!(0 != ~r~0); {227410#(<= ~counter~0 11)} is VALID [2022-04-08 06:14:34,962 INFO L290 TraceCheckUtils]: 105: Hoare triple {227410#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,963 INFO L290 TraceCheckUtils]: 106: Hoare triple {227435#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,963 INFO L272 TraceCheckUtils]: 107: Hoare triple {227435#(<= ~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)); {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,963 INFO L290 TraceCheckUtils]: 108: Hoare triple {227435#(<= ~counter~0 12)} ~cond := #in~cond; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,964 INFO L290 TraceCheckUtils]: 109: Hoare triple {227435#(<= ~counter~0 12)} assume !(0 == ~cond); {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,964 INFO L290 TraceCheckUtils]: 110: Hoare triple {227435#(<= ~counter~0 12)} assume true; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,964 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {227435#(<= ~counter~0 12)} {227435#(<= ~counter~0 12)} #96#return; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,965 INFO L290 TraceCheckUtils]: 112: Hoare triple {227435#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227435#(<= ~counter~0 12)} is VALID [2022-04-08 06:14:34,966 INFO L290 TraceCheckUtils]: 113: Hoare triple {227435#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {227460#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,967 INFO L272 TraceCheckUtils]: 115: Hoare triple {227460#(<= ~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)); {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,967 INFO L290 TraceCheckUtils]: 116: Hoare triple {227460#(<= ~counter~0 13)} ~cond := #in~cond; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {227460#(<= ~counter~0 13)} assume !(0 == ~cond); {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,968 INFO L290 TraceCheckUtils]: 118: Hoare triple {227460#(<= ~counter~0 13)} assume true; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,968 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {227460#(<= ~counter~0 13)} {227460#(<= ~counter~0 13)} #96#return; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,969 INFO L290 TraceCheckUtils]: 120: Hoare triple {227460#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227460#(<= ~counter~0 13)} is VALID [2022-04-08 06:14:34,970 INFO L290 TraceCheckUtils]: 121: Hoare triple {227460#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,971 INFO L290 TraceCheckUtils]: 122: Hoare triple {227485#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,971 INFO L272 TraceCheckUtils]: 123: Hoare triple {227485#(<= ~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)); {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,971 INFO L290 TraceCheckUtils]: 124: Hoare triple {227485#(<= ~counter~0 14)} ~cond := #in~cond; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,972 INFO L290 TraceCheckUtils]: 125: Hoare triple {227485#(<= ~counter~0 14)} assume !(0 == ~cond); {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,972 INFO L290 TraceCheckUtils]: 126: Hoare triple {227485#(<= ~counter~0 14)} assume true; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,972 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {227485#(<= ~counter~0 14)} {227485#(<= ~counter~0 14)} #96#return; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,973 INFO L290 TraceCheckUtils]: 128: Hoare triple {227485#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227485#(<= ~counter~0 14)} is VALID [2022-04-08 06:14:34,974 INFO L290 TraceCheckUtils]: 129: Hoare triple {227485#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {227510#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,975 INFO L272 TraceCheckUtils]: 131: Hoare triple {227510#(<= ~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)); {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,975 INFO L290 TraceCheckUtils]: 132: Hoare triple {227510#(<= ~counter~0 15)} ~cond := #in~cond; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,976 INFO L290 TraceCheckUtils]: 133: Hoare triple {227510#(<= ~counter~0 15)} assume !(0 == ~cond); {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,976 INFO L290 TraceCheckUtils]: 134: Hoare triple {227510#(<= ~counter~0 15)} assume true; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,976 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {227510#(<= ~counter~0 15)} {227510#(<= ~counter~0 15)} #96#return; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,977 INFO L290 TraceCheckUtils]: 136: Hoare triple {227510#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227510#(<= ~counter~0 15)} is VALID [2022-04-08 06:14:34,978 INFO L290 TraceCheckUtils]: 137: Hoare triple {227510#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,979 INFO L290 TraceCheckUtils]: 138: Hoare triple {227535#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,979 INFO L272 TraceCheckUtils]: 139: Hoare triple {227535#(<= ~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)); {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,979 INFO L290 TraceCheckUtils]: 140: Hoare triple {227535#(<= ~counter~0 16)} ~cond := #in~cond; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,980 INFO L290 TraceCheckUtils]: 141: Hoare triple {227535#(<= ~counter~0 16)} assume !(0 == ~cond); {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,980 INFO L290 TraceCheckUtils]: 142: Hoare triple {227535#(<= ~counter~0 16)} assume true; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,980 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {227535#(<= ~counter~0 16)} {227535#(<= ~counter~0 16)} #96#return; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,981 INFO L290 TraceCheckUtils]: 144: Hoare triple {227535#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227535#(<= ~counter~0 16)} is VALID [2022-04-08 06:14:34,982 INFO L290 TraceCheckUtils]: 145: Hoare triple {227535#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,983 INFO L290 TraceCheckUtils]: 146: Hoare triple {227560#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,983 INFO L272 TraceCheckUtils]: 147: Hoare triple {227560#(<= ~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)); {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,984 INFO L290 TraceCheckUtils]: 148: Hoare triple {227560#(<= ~counter~0 17)} ~cond := #in~cond; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,984 INFO L290 TraceCheckUtils]: 149: Hoare triple {227560#(<= ~counter~0 17)} assume !(0 == ~cond); {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,984 INFO L290 TraceCheckUtils]: 150: Hoare triple {227560#(<= ~counter~0 17)} assume true; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,985 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {227560#(<= ~counter~0 17)} {227560#(<= ~counter~0 17)} #96#return; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,985 INFO L290 TraceCheckUtils]: 152: Hoare triple {227560#(<= ~counter~0 17)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227560#(<= ~counter~0 17)} is VALID [2022-04-08 06:14:34,986 INFO L290 TraceCheckUtils]: 153: Hoare triple {227560#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,987 INFO L290 TraceCheckUtils]: 154: Hoare triple {227585#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,987 INFO L272 TraceCheckUtils]: 155: Hoare triple {227585#(<= ~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)); {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,988 INFO L290 TraceCheckUtils]: 156: Hoare triple {227585#(<= ~counter~0 18)} ~cond := #in~cond; {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,988 INFO L290 TraceCheckUtils]: 157: Hoare triple {227585#(<= ~counter~0 18)} assume !(0 == ~cond); {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,988 INFO L290 TraceCheckUtils]: 158: Hoare triple {227585#(<= ~counter~0 18)} assume true; {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,989 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {227585#(<= ~counter~0 18)} {227585#(<= ~counter~0 18)} #96#return; {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,989 INFO L290 TraceCheckUtils]: 160: Hoare triple {227585#(<= ~counter~0 18)} assume !(~r~0 > 0); {227585#(<= ~counter~0 18)} is VALID [2022-04-08 06:14:34,991 INFO L290 TraceCheckUtils]: 161: Hoare triple {227585#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,991 INFO L290 TraceCheckUtils]: 162: Hoare triple {227610#(<= ~counter~0 19)} assume !!(#t~post8 < 100);havoc #t~post8; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,992 INFO L272 TraceCheckUtils]: 163: Hoare triple {227610#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,992 INFO L290 TraceCheckUtils]: 164: Hoare triple {227610#(<= ~counter~0 19)} ~cond := #in~cond; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,992 INFO L290 TraceCheckUtils]: 165: Hoare triple {227610#(<= ~counter~0 19)} assume !(0 == ~cond); {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,992 INFO L290 TraceCheckUtils]: 166: Hoare triple {227610#(<= ~counter~0 19)} assume true; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,993 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {227610#(<= ~counter~0 19)} {227610#(<= ~counter~0 19)} #98#return; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,993 INFO L290 TraceCheckUtils]: 168: Hoare triple {227610#(<= ~counter~0 19)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {227610#(<= ~counter~0 19)} is VALID [2022-04-08 06:14:34,995 INFO L290 TraceCheckUtils]: 169: Hoare triple {227610#(<= ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,995 INFO L290 TraceCheckUtils]: 170: Hoare triple {227635#(<= ~counter~0 20)} assume !!(#t~post8 < 100);havoc #t~post8; {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,996 INFO L272 TraceCheckUtils]: 171: Hoare triple {227635#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,996 INFO L290 TraceCheckUtils]: 172: Hoare triple {227635#(<= ~counter~0 20)} ~cond := #in~cond; {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,996 INFO L290 TraceCheckUtils]: 173: Hoare triple {227635#(<= ~counter~0 20)} assume !(0 == ~cond); {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,996 INFO L290 TraceCheckUtils]: 174: Hoare triple {227635#(<= ~counter~0 20)} assume true; {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,997 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {227635#(<= ~counter~0 20)} {227635#(<= ~counter~0 20)} #98#return; {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,997 INFO L290 TraceCheckUtils]: 176: Hoare triple {227635#(<= ~counter~0 20)} assume !(~r~0 < 0); {227635#(<= ~counter~0 20)} is VALID [2022-04-08 06:14:34,997 INFO L290 TraceCheckUtils]: 177: Hoare triple {227635#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227660#(<= |main_#t~post6| 20)} is VALID [2022-04-08 06:14:34,998 INFO L290 TraceCheckUtils]: 178: Hoare triple {227660#(<= |main_#t~post6| 20)} assume !(#t~post6 < 100);havoc #t~post6; {227104#false} is VALID [2022-04-08 06:14:34,998 INFO L272 TraceCheckUtils]: 179: Hoare triple {227104#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227104#false} is VALID [2022-04-08 06:14:34,998 INFO L290 TraceCheckUtils]: 180: Hoare triple {227104#false} ~cond := #in~cond; {227104#false} is VALID [2022-04-08 06:14:34,998 INFO L290 TraceCheckUtils]: 181: Hoare triple {227104#false} assume 0 == ~cond; {227104#false} is VALID [2022-04-08 06:14:34,998 INFO L290 TraceCheckUtils]: 182: Hoare triple {227104#false} assume !false; {227104#false} is VALID [2022-04-08 06:14:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 40 proven. 1058 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:14:34,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:14:36,245 INFO L290 TraceCheckUtils]: 182: Hoare triple {227104#false} assume !false; {227104#false} is VALID [2022-04-08 06:14:36,246 INFO L290 TraceCheckUtils]: 181: Hoare triple {227104#false} assume 0 == ~cond; {227104#false} is VALID [2022-04-08 06:14:36,246 INFO L290 TraceCheckUtils]: 180: Hoare triple {227104#false} ~cond := #in~cond; {227104#false} is VALID [2022-04-08 06:14:36,246 INFO L272 TraceCheckUtils]: 179: Hoare triple {227104#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227104#false} is VALID [2022-04-08 06:14:36,246 INFO L290 TraceCheckUtils]: 178: Hoare triple {227688#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {227104#false} is VALID [2022-04-08 06:14:36,246 INFO L290 TraceCheckUtils]: 177: Hoare triple {227692#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227688#(< |main_#t~post6| 100)} is VALID [2022-04-08 06:14:36,247 INFO L290 TraceCheckUtils]: 176: Hoare triple {227692#(< ~counter~0 100)} assume !(~r~0 < 0); {227692#(< ~counter~0 100)} is VALID [2022-04-08 06:14:36,247 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {227103#true} {227692#(< ~counter~0 100)} #98#return; {227692#(< ~counter~0 100)} is VALID [2022-04-08 06:14:36,247 INFO L290 TraceCheckUtils]: 174: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,247 INFO L290 TraceCheckUtils]: 173: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,247 INFO L290 TraceCheckUtils]: 172: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,247 INFO L272 TraceCheckUtils]: 171: Hoare triple {227692#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,248 INFO L290 TraceCheckUtils]: 170: Hoare triple {227692#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {227692#(< ~counter~0 100)} is VALID [2022-04-08 06:14:36,252 INFO L290 TraceCheckUtils]: 169: Hoare triple {227717#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227692#(< ~counter~0 100)} is VALID [2022-04-08 06:14:36,253 INFO L290 TraceCheckUtils]: 168: Hoare triple {227717#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {227717#(< ~counter~0 99)} is VALID [2022-04-08 06:14:36,253 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {227103#true} {227717#(< ~counter~0 99)} #98#return; {227717#(< ~counter~0 99)} is VALID [2022-04-08 06:14:36,253 INFO L290 TraceCheckUtils]: 166: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,253 INFO L290 TraceCheckUtils]: 165: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,253 INFO L290 TraceCheckUtils]: 164: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,253 INFO L272 TraceCheckUtils]: 163: Hoare triple {227717#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,253 INFO L290 TraceCheckUtils]: 162: Hoare triple {227717#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {227717#(< ~counter~0 99)} is VALID [2022-04-08 06:14:36,255 INFO L290 TraceCheckUtils]: 161: Hoare triple {227742#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227717#(< ~counter~0 99)} is VALID [2022-04-08 06:14:36,255 INFO L290 TraceCheckUtils]: 160: Hoare triple {227742#(< ~counter~0 98)} assume !(~r~0 > 0); {227742#(< ~counter~0 98)} is VALID [2022-04-08 06:14:36,256 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {227103#true} {227742#(< ~counter~0 98)} #96#return; {227742#(< ~counter~0 98)} is VALID [2022-04-08 06:14:36,256 INFO L290 TraceCheckUtils]: 158: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,256 INFO L290 TraceCheckUtils]: 157: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,256 INFO L290 TraceCheckUtils]: 156: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,256 INFO L272 TraceCheckUtils]: 155: Hoare triple {227742#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,256 INFO L290 TraceCheckUtils]: 154: Hoare triple {227742#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {227742#(< ~counter~0 98)} is VALID [2022-04-08 06:14:36,258 INFO L290 TraceCheckUtils]: 153: Hoare triple {227767#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227742#(< ~counter~0 98)} is VALID [2022-04-08 06:14:36,258 INFO L290 TraceCheckUtils]: 152: Hoare triple {227767#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227767#(< ~counter~0 97)} is VALID [2022-04-08 06:14:36,259 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {227103#true} {227767#(< ~counter~0 97)} #96#return; {227767#(< ~counter~0 97)} is VALID [2022-04-08 06:14:36,259 INFO L290 TraceCheckUtils]: 150: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,259 INFO L290 TraceCheckUtils]: 149: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,259 INFO L290 TraceCheckUtils]: 148: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,259 INFO L272 TraceCheckUtils]: 147: Hoare triple {227767#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,259 INFO L290 TraceCheckUtils]: 146: Hoare triple {227767#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {227767#(< ~counter~0 97)} is VALID [2022-04-08 06:14:36,261 INFO L290 TraceCheckUtils]: 145: Hoare triple {227792#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227767#(< ~counter~0 97)} is VALID [2022-04-08 06:14:36,261 INFO L290 TraceCheckUtils]: 144: Hoare triple {227792#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227792#(< ~counter~0 96)} is VALID [2022-04-08 06:14:36,262 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {227103#true} {227792#(< ~counter~0 96)} #96#return; {227792#(< ~counter~0 96)} is VALID [2022-04-08 06:14:36,262 INFO L290 TraceCheckUtils]: 142: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,262 INFO L290 TraceCheckUtils]: 141: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,262 INFO L290 TraceCheckUtils]: 140: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,262 INFO L272 TraceCheckUtils]: 139: Hoare triple {227792#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,262 INFO L290 TraceCheckUtils]: 138: Hoare triple {227792#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {227792#(< ~counter~0 96)} is VALID [2022-04-08 06:14:36,264 INFO L290 TraceCheckUtils]: 137: Hoare triple {227817#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227792#(< ~counter~0 96)} is VALID [2022-04-08 06:14:36,264 INFO L290 TraceCheckUtils]: 136: Hoare triple {227817#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227817#(< ~counter~0 95)} is VALID [2022-04-08 06:14:36,264 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {227103#true} {227817#(< ~counter~0 95)} #96#return; {227817#(< ~counter~0 95)} is VALID [2022-04-08 06:14:36,264 INFO L290 TraceCheckUtils]: 134: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,264 INFO L290 TraceCheckUtils]: 133: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,265 INFO L290 TraceCheckUtils]: 132: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,265 INFO L272 TraceCheckUtils]: 131: Hoare triple {227817#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,265 INFO L290 TraceCheckUtils]: 130: Hoare triple {227817#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {227817#(< ~counter~0 95)} is VALID [2022-04-08 06:14:36,266 INFO L290 TraceCheckUtils]: 129: Hoare triple {227842#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227817#(< ~counter~0 95)} is VALID [2022-04-08 06:14:36,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {227842#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227842#(< ~counter~0 94)} is VALID [2022-04-08 06:14:36,267 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {227103#true} {227842#(< ~counter~0 94)} #96#return; {227842#(< ~counter~0 94)} is VALID [2022-04-08 06:14:36,267 INFO L290 TraceCheckUtils]: 126: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,267 INFO L290 TraceCheckUtils]: 125: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,267 INFO L290 TraceCheckUtils]: 124: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,267 INFO L272 TraceCheckUtils]: 123: Hoare triple {227842#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,268 INFO L290 TraceCheckUtils]: 122: Hoare triple {227842#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {227842#(< ~counter~0 94)} is VALID [2022-04-08 06:14:36,269 INFO L290 TraceCheckUtils]: 121: Hoare triple {227867#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227842#(< ~counter~0 94)} is VALID [2022-04-08 06:14:36,270 INFO L290 TraceCheckUtils]: 120: Hoare triple {227867#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227867#(< ~counter~0 93)} is VALID [2022-04-08 06:14:36,270 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {227103#true} {227867#(< ~counter~0 93)} #96#return; {227867#(< ~counter~0 93)} is VALID [2022-04-08 06:14:36,270 INFO L290 TraceCheckUtils]: 118: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,270 INFO L290 TraceCheckUtils]: 117: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,270 INFO L290 TraceCheckUtils]: 116: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,270 INFO L272 TraceCheckUtils]: 115: Hoare triple {227867#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,270 INFO L290 TraceCheckUtils]: 114: Hoare triple {227867#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {227867#(< ~counter~0 93)} is VALID [2022-04-08 06:14:36,272 INFO L290 TraceCheckUtils]: 113: Hoare triple {227892#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227867#(< ~counter~0 93)} is VALID [2022-04-08 06:14:36,272 INFO L290 TraceCheckUtils]: 112: Hoare triple {227892#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {227892#(< ~counter~0 92)} is VALID [2022-04-08 06:14:36,273 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {227103#true} {227892#(< ~counter~0 92)} #96#return; {227892#(< ~counter~0 92)} is VALID [2022-04-08 06:14:36,273 INFO L290 TraceCheckUtils]: 110: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,273 INFO L290 TraceCheckUtils]: 108: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,273 INFO L272 TraceCheckUtils]: 107: Hoare triple {227892#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,273 INFO L290 TraceCheckUtils]: 106: Hoare triple {227892#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {227892#(< ~counter~0 92)} is VALID [2022-04-08 06:14:36,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {227917#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227892#(< ~counter~0 92)} is VALID [2022-04-08 06:14:36,275 INFO L290 TraceCheckUtils]: 104: Hoare triple {227917#(< ~counter~0 91)} assume !!(0 != ~r~0); {227917#(< ~counter~0 91)} is VALID [2022-04-08 06:14:36,276 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {227103#true} {227917#(< ~counter~0 91)} #94#return; {227917#(< ~counter~0 91)} is VALID [2022-04-08 06:14:36,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,276 INFO L290 TraceCheckUtils]: 101: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,276 INFO L272 TraceCheckUtils]: 99: Hoare triple {227917#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,276 INFO L290 TraceCheckUtils]: 98: Hoare triple {227917#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {227917#(< ~counter~0 91)} is VALID [2022-04-08 06:14:36,278 INFO L290 TraceCheckUtils]: 97: Hoare triple {227942#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {227917#(< ~counter~0 91)} is VALID [2022-04-08 06:14:36,278 INFO L290 TraceCheckUtils]: 96: Hoare triple {227942#(< ~counter~0 90)} assume !(~r~0 < 0); {227942#(< ~counter~0 90)} is VALID [2022-04-08 06:14:36,279 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {227103#true} {227942#(< ~counter~0 90)} #98#return; {227942#(< ~counter~0 90)} is VALID [2022-04-08 06:14:36,279 INFO L290 TraceCheckUtils]: 94: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,279 INFO L290 TraceCheckUtils]: 93: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,279 INFO L290 TraceCheckUtils]: 92: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,279 INFO L272 TraceCheckUtils]: 91: Hoare triple {227942#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,279 INFO L290 TraceCheckUtils]: 90: Hoare triple {227942#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {227942#(< ~counter~0 90)} is VALID [2022-04-08 06:14:36,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {227967#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227942#(< ~counter~0 90)} is VALID [2022-04-08 06:14:36,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {227967#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {227967#(< ~counter~0 89)} is VALID [2022-04-08 06:14:36,281 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {227103#true} {227967#(< ~counter~0 89)} #98#return; {227967#(< ~counter~0 89)} is VALID [2022-04-08 06:14:36,281 INFO L290 TraceCheckUtils]: 86: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,282 INFO L290 TraceCheckUtils]: 85: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,282 INFO L290 TraceCheckUtils]: 84: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,282 INFO L272 TraceCheckUtils]: 83: Hoare triple {227967#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {227967#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {227967#(< ~counter~0 89)} is VALID [2022-04-08 06:14:36,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {227992#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {227967#(< ~counter~0 89)} is VALID [2022-04-08 06:14:36,284 INFO L290 TraceCheckUtils]: 80: Hoare triple {227992#(< ~counter~0 88)} assume !(~r~0 > 0); {227992#(< ~counter~0 88)} is VALID [2022-04-08 06:14:36,284 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {227103#true} {227992#(< ~counter~0 88)} #96#return; {227992#(< ~counter~0 88)} is VALID [2022-04-08 06:14:36,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,284 INFO L272 TraceCheckUtils]: 75: Hoare triple {227992#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,285 INFO L290 TraceCheckUtils]: 74: Hoare triple {227992#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {227992#(< ~counter~0 88)} is VALID [2022-04-08 06:14:36,286 INFO L290 TraceCheckUtils]: 73: Hoare triple {228017#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227992#(< ~counter~0 88)} is VALID [2022-04-08 06:14:36,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {228017#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {228017#(< ~counter~0 87)} is VALID [2022-04-08 06:14:36,287 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {227103#true} {228017#(< ~counter~0 87)} #96#return; {228017#(< ~counter~0 87)} is VALID [2022-04-08 06:14:36,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,287 INFO L272 TraceCheckUtils]: 67: Hoare triple {228017#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,288 INFO L290 TraceCheckUtils]: 66: Hoare triple {228017#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {228017#(< ~counter~0 87)} is VALID [2022-04-08 06:14:36,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {228042#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {228017#(< ~counter~0 87)} is VALID [2022-04-08 06:14:36,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {228042#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {228042#(< ~counter~0 86)} is VALID [2022-04-08 06:14:36,290 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {227103#true} {228042#(< ~counter~0 86)} #96#return; {228042#(< ~counter~0 86)} is VALID [2022-04-08 06:14:36,290 INFO L290 TraceCheckUtils]: 62: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,290 INFO L272 TraceCheckUtils]: 59: Hoare triple {228042#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {228042#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {228042#(< ~counter~0 86)} is VALID [2022-04-08 06:14:36,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {228067#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {228042#(< ~counter~0 86)} is VALID [2022-04-08 06:14:36,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {228067#(< ~counter~0 85)} assume !!(0 != ~r~0); {228067#(< ~counter~0 85)} is VALID [2022-04-08 06:14:36,293 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {227103#true} {228067#(< ~counter~0 85)} #94#return; {228067#(< ~counter~0 85)} is VALID [2022-04-08 06:14:36,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,293 INFO L272 TraceCheckUtils]: 51: Hoare triple {228067#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {228067#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {228067#(< ~counter~0 85)} is VALID [2022-04-08 06:14:36,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {228092#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {228067#(< ~counter~0 85)} is VALID [2022-04-08 06:14:36,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {228092#(< ~counter~0 84)} assume !(~r~0 < 0); {228092#(< ~counter~0 84)} is VALID [2022-04-08 06:14:36,296 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {227103#true} {228092#(< ~counter~0 84)} #98#return; {228092#(< ~counter~0 84)} is VALID [2022-04-08 06:14:36,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,296 INFO L272 TraceCheckUtils]: 43: Hoare triple {228092#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {228092#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {228092#(< ~counter~0 84)} is VALID [2022-04-08 06:14:36,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {228117#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {228092#(< ~counter~0 84)} is VALID [2022-04-08 06:14:36,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {228117#(< ~counter~0 83)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {228117#(< ~counter~0 83)} is VALID [2022-04-08 06:14:36,298 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {227103#true} {228117#(< ~counter~0 83)} #98#return; {228117#(< ~counter~0 83)} is VALID [2022-04-08 06:14:36,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {228117#(< ~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)); {227103#true} is VALID [2022-04-08 06:14:36,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {228117#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {228117#(< ~counter~0 83)} is VALID [2022-04-08 06:14:36,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {228142#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {228117#(< ~counter~0 83)} is VALID [2022-04-08 06:14:36,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {228142#(< ~counter~0 82)} assume !(~r~0 > 0); {228142#(< ~counter~0 82)} is VALID [2022-04-08 06:14:36,301 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {227103#true} {228142#(< ~counter~0 82)} #96#return; {228142#(< ~counter~0 82)} is VALID [2022-04-08 06:14:36,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,302 INFO L272 TraceCheckUtils]: 27: Hoare triple {228142#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227103#true} is VALID [2022-04-08 06:14:36,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {228142#(< ~counter~0 82)} assume !!(#t~post7 < 100);havoc #t~post7; {228142#(< ~counter~0 82)} is VALID [2022-04-08 06:14:36,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {228167#(< ~counter~0 81)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {228142#(< ~counter~0 82)} is VALID [2022-04-08 06:14:36,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {228167#(< ~counter~0 81)} assume !!(0 != ~r~0); {228167#(< ~counter~0 81)} is VALID [2022-04-08 06:14:36,304 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {227103#true} {228167#(< ~counter~0 81)} #94#return; {228167#(< ~counter~0 81)} is VALID [2022-04-08 06:14:36,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,304 INFO L272 TraceCheckUtils]: 19: Hoare triple {228167#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {227103#true} is VALID [2022-04-08 06:14:36,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {228167#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {228167#(< ~counter~0 81)} is VALID [2022-04-08 06:14:36,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {228192#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {228167#(< ~counter~0 81)} is VALID [2022-04-08 06:14:36,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {228192#(< ~counter~0 80)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {227103#true} {228192#(< ~counter~0 80)} #92#return; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {228192#(< ~counter~0 80)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {227103#true} is VALID [2022-04-08 06:14:36,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {227103#true} {228192#(< ~counter~0 80)} #90#return; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {227103#true} assume true; {227103#true} is VALID [2022-04-08 06:14:36,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {227103#true} assume !(0 == ~cond); {227103#true} is VALID [2022-04-08 06:14:36,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {227103#true} ~cond := #in~cond; {227103#true} is VALID [2022-04-08 06:14:36,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {228192#(< ~counter~0 80)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {227103#true} is VALID [2022-04-08 06:14:36,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {228192#(< ~counter~0 80)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {228192#(< ~counter~0 80)} call #t~ret9 := main(); {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228192#(< ~counter~0 80)} {227103#true} #102#return; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {228192#(< ~counter~0 80)} assume true; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {227103#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {228192#(< ~counter~0 80)} is VALID [2022-04-08 06:14:36,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {227103#true} call ULTIMATE.init(); {227103#true} is VALID [2022-04-08 06:14:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 40 proven. 298 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-08 06:14:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:14:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587615213] [2022-04-08 06:14:36,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:14:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717692930] [2022-04-08 06:14:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717692930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:14:36,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:14:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-08 06:14:36,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:14:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186201226] [2022-04-08 06:14:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186201226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:14:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:14:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 06:14:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156908141] [2022-04-08 06:14:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:14:36,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) Word has length 183 [2022-04-08 06:14:36,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:14:36,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:14:36,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:36,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 06:14:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:14:36,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 06:14:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 06:14:36,579 INFO L87 Difference]: Start difference. First operand 1019 states and 1350 transitions. Second operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:14:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:47,246 INFO L93 Difference]: Finished difference Result 1070 states and 1420 transitions. [2022-04-08 06:14:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 06:14:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) Word has length 183 [2022-04-08 06:14:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:14:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:14:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 414 transitions. [2022-04-08 06:14:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:14:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 414 transitions. [2022-04-08 06:14:47,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 414 transitions. [2022-04-08 06:14:48,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:14:48,333 INFO L225 Difference]: With dead ends: 1070 [2022-04-08 06:14:48,333 INFO L226 Difference]: Without dead ends: 1065 [2022-04-08 06:14:48,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1668, Invalid=2238, Unknown=0, NotChecked=0, Total=3906 [2022-04-08 06:14:48,342 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 345 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:14:48,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 443 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 06:14:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-04-08 06:14:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1043. [2022-04-08 06:14:53,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:14:53,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1065 states. Second operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:14:53,278 INFO L74 IsIncluded]: Start isIncluded. First operand 1065 states. Second operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:14:53,279 INFO L87 Difference]: Start difference. First operand 1065 states. Second operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:14:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:53,314 INFO L93 Difference]: Finished difference Result 1065 states and 1414 transitions. [2022-04-08 06:14:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1414 transitions. [2022-04-08 06:14:53,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:53,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:53,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) Second operand 1065 states. [2022-04-08 06:14:53,316 INFO L87 Difference]: Start difference. First operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) Second operand 1065 states. [2022-04-08 06:14:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:14:53,352 INFO L93 Difference]: Finished difference Result 1065 states and 1414 transitions. [2022-04-08 06:14:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1414 transitions. [2022-04-08 06:14:53,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:14:53,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:14:53,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:14:53,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:14:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 777 states have (on average 1.1685971685971686) internal successors, (908), 794 states have internal predecessors, (908), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:14:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1388 transitions. [2022-04-08 06:14:53,416 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1388 transitions. Word has length 183 [2022-04-08 06:14:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:14:53,416 INFO L478 AbstractCegarLoop]: Abstraction has 1043 states and 1388 transitions. [2022-04-08 06:14:53,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.5) internal successors, (132), 23 states have internal predecessors, (132), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:14:53,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1043 states and 1388 transitions. [2022-04-08 06:15:04,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1388 edges. 1387 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1388 transitions. [2022-04-08 06:15:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-08 06:15:04,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:04,658 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 9, 9, 9, 9, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:04,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-08 06:15:04,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:04,859 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1136152360, now seen corresponding path program 35 times [2022-04-08 06:15:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:04,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876195609] [2022-04-08 06:15:04,859 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:15:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1136152360, now seen corresponding path program 36 times [2022-04-08 06:15:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:04,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256056427] [2022-04-08 06:15:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:04,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:04,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587672220] [2022-04-08 06:15:04,881 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:15:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:04,882 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:04,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 06:15:06,113 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 06:15:06,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:06,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 06:15:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:06,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:07,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {234636#true} call ULTIMATE.init(); {234636#true} is VALID [2022-04-08 06:15:07,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {234636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {234644#(<= ~counter~0 0)} assume true; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234644#(<= ~counter~0 0)} {234636#true} #102#return; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {234644#(<= ~counter~0 0)} call #t~ret9 := main(); {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {234644#(<= ~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; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {234644#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {234644#(<= ~counter~0 0)} ~cond := #in~cond; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {234644#(<= ~counter~0 0)} assume !(0 == ~cond); {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {234644#(<= ~counter~0 0)} assume true; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {234644#(<= ~counter~0 0)} {234644#(<= ~counter~0 0)} #90#return; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,201 INFO L272 TraceCheckUtils]: 11: Hoare triple {234644#(<= ~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)); {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {234644#(<= ~counter~0 0)} ~cond := #in~cond; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {234644#(<= ~counter~0 0)} assume !(0 == ~cond); {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {234644#(<= ~counter~0 0)} assume true; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,202 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {234644#(<= ~counter~0 0)} {234644#(<= ~counter~0 0)} #92#return; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {234644#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {234644#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:07,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {234644#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {234693#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,209 INFO L272 TraceCheckUtils]: 19: Hoare triple {234693#(<= ~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)); {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {234693#(<= ~counter~0 1)} ~cond := #in~cond; {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {234693#(<= ~counter~0 1)} assume !(0 == ~cond); {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {234693#(<= ~counter~0 1)} assume true; {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,210 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {234693#(<= ~counter~0 1)} {234693#(<= ~counter~0 1)} #94#return; {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {234693#(<= ~counter~0 1)} assume !!(0 != ~r~0); {234693#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:07,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {234693#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {234718#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {234718#(<= ~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)); {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {234718#(<= ~counter~0 2)} ~cond := #in~cond; {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {234718#(<= ~counter~0 2)} assume !(0 == ~cond); {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {234718#(<= ~counter~0 2)} assume true; {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,215 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {234718#(<= ~counter~0 2)} {234718#(<= ~counter~0 2)} #96#return; {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {234718#(<= ~counter~0 2)} assume !(~r~0 > 0); {234718#(<= ~counter~0 2)} is VALID [2022-04-08 06:15:07,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {234718#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {234743#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,218 INFO L272 TraceCheckUtils]: 35: Hoare triple {234743#(<= ~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)); {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {234743#(<= ~counter~0 3)} ~cond := #in~cond; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {234743#(<= ~counter~0 3)} assume !(0 == ~cond); {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {234743#(<= ~counter~0 3)} assume true; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,219 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {234743#(<= ~counter~0 3)} {234743#(<= ~counter~0 3)} #98#return; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {234743#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {234743#(<= ~counter~0 3)} is VALID [2022-04-08 06:15:07,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {234743#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {234768#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,222 INFO L272 TraceCheckUtils]: 43: Hoare triple {234768#(<= ~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)); {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {234768#(<= ~counter~0 4)} ~cond := #in~cond; {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {234768#(<= ~counter~0 4)} assume !(0 == ~cond); {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {234768#(<= ~counter~0 4)} assume true; {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,223 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {234768#(<= ~counter~0 4)} {234768#(<= ~counter~0 4)} #98#return; {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {234768#(<= ~counter~0 4)} assume !(~r~0 < 0); {234768#(<= ~counter~0 4)} is VALID [2022-04-08 06:15:07,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {234768#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {234793#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,226 INFO L272 TraceCheckUtils]: 51: Hoare triple {234793#(<= ~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)); {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {234793#(<= ~counter~0 5)} ~cond := #in~cond; {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {234793#(<= ~counter~0 5)} assume !(0 == ~cond); {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {234793#(<= ~counter~0 5)} assume true; {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,227 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {234793#(<= ~counter~0 5)} {234793#(<= ~counter~0 5)} #94#return; {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,227 INFO L290 TraceCheckUtils]: 56: Hoare triple {234793#(<= ~counter~0 5)} assume !!(0 != ~r~0); {234793#(<= ~counter~0 5)} is VALID [2022-04-08 06:15:07,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {234793#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {234818#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,230 INFO L272 TraceCheckUtils]: 59: Hoare triple {234818#(<= ~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)); {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {234818#(<= ~counter~0 6)} ~cond := #in~cond; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,230 INFO L290 TraceCheckUtils]: 61: Hoare triple {234818#(<= ~counter~0 6)} assume !(0 == ~cond); {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,231 INFO L290 TraceCheckUtils]: 62: Hoare triple {234818#(<= ~counter~0 6)} assume true; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,231 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {234818#(<= ~counter~0 6)} {234818#(<= ~counter~0 6)} #96#return; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,231 INFO L290 TraceCheckUtils]: 64: Hoare triple {234818#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {234818#(<= ~counter~0 6)} is VALID [2022-04-08 06:15:07,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {234818#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {234843#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,234 INFO L272 TraceCheckUtils]: 67: Hoare triple {234843#(<= ~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)); {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {234843#(<= ~counter~0 7)} ~cond := #in~cond; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {234843#(<= ~counter~0 7)} assume !(0 == ~cond); {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {234843#(<= ~counter~0 7)} assume true; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,235 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {234843#(<= ~counter~0 7)} {234843#(<= ~counter~0 7)} #96#return; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {234843#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {234843#(<= ~counter~0 7)} is VALID [2022-04-08 06:15:07,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {234843#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {234868#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,238 INFO L272 TraceCheckUtils]: 75: Hoare triple {234868#(<= ~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)); {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {234868#(<= ~counter~0 8)} ~cond := #in~cond; {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {234868#(<= ~counter~0 8)} assume !(0 == ~cond); {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,239 INFO L290 TraceCheckUtils]: 78: Hoare triple {234868#(<= ~counter~0 8)} assume true; {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,239 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {234868#(<= ~counter~0 8)} {234868#(<= ~counter~0 8)} #96#return; {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {234868#(<= ~counter~0 8)} assume !(~r~0 > 0); {234868#(<= ~counter~0 8)} is VALID [2022-04-08 06:15:07,241 INFO L290 TraceCheckUtils]: 81: Hoare triple {234868#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {234893#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,242 INFO L272 TraceCheckUtils]: 83: Hoare triple {234893#(<= ~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)); {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {234893#(<= ~counter~0 9)} ~cond := #in~cond; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {234893#(<= ~counter~0 9)} assume !(0 == ~cond); {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,243 INFO L290 TraceCheckUtils]: 86: Hoare triple {234893#(<= ~counter~0 9)} assume true; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,243 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {234893#(<= ~counter~0 9)} {234893#(<= ~counter~0 9)} #98#return; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,244 INFO L290 TraceCheckUtils]: 88: Hoare triple {234893#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {234893#(<= ~counter~0 9)} is VALID [2022-04-08 06:15:07,245 INFO L290 TraceCheckUtils]: 89: Hoare triple {234893#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,246 INFO L290 TraceCheckUtils]: 90: Hoare triple {234918#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,246 INFO L272 TraceCheckUtils]: 91: Hoare triple {234918#(<= ~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)); {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,246 INFO L290 TraceCheckUtils]: 92: Hoare triple {234918#(<= ~counter~0 10)} ~cond := #in~cond; {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {234918#(<= ~counter~0 10)} assume !(0 == ~cond); {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {234918#(<= ~counter~0 10)} assume true; {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,247 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {234918#(<= ~counter~0 10)} {234918#(<= ~counter~0 10)} #98#return; {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,248 INFO L290 TraceCheckUtils]: 96: Hoare triple {234918#(<= ~counter~0 10)} assume !(~r~0 < 0); {234918#(<= ~counter~0 10)} is VALID [2022-04-08 06:15:07,250 INFO L290 TraceCheckUtils]: 97: Hoare triple {234918#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {234943#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,250 INFO L272 TraceCheckUtils]: 99: Hoare triple {234943#(<= ~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)); {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,251 INFO L290 TraceCheckUtils]: 100: Hoare triple {234943#(<= ~counter~0 11)} ~cond := #in~cond; {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,251 INFO L290 TraceCheckUtils]: 101: Hoare triple {234943#(<= ~counter~0 11)} assume !(0 == ~cond); {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,251 INFO L290 TraceCheckUtils]: 102: Hoare triple {234943#(<= ~counter~0 11)} assume true; {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,252 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {234943#(<= ~counter~0 11)} {234943#(<= ~counter~0 11)} #94#return; {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,252 INFO L290 TraceCheckUtils]: 104: Hoare triple {234943#(<= ~counter~0 11)} assume !!(0 != ~r~0); {234943#(<= ~counter~0 11)} is VALID [2022-04-08 06:15:07,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {234943#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {234968#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,254 INFO L272 TraceCheckUtils]: 107: Hoare triple {234968#(<= ~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)); {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,255 INFO L290 TraceCheckUtils]: 108: Hoare triple {234968#(<= ~counter~0 12)} ~cond := #in~cond; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,255 INFO L290 TraceCheckUtils]: 109: Hoare triple {234968#(<= ~counter~0 12)} assume !(0 == ~cond); {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {234968#(<= ~counter~0 12)} assume true; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,255 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {234968#(<= ~counter~0 12)} {234968#(<= ~counter~0 12)} #96#return; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,256 INFO L290 TraceCheckUtils]: 112: Hoare triple {234968#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {234968#(<= ~counter~0 12)} is VALID [2022-04-08 06:15:07,258 INFO L290 TraceCheckUtils]: 113: Hoare triple {234968#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,258 INFO L290 TraceCheckUtils]: 114: Hoare triple {234993#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,258 INFO L272 TraceCheckUtils]: 115: Hoare triple {234993#(<= ~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)); {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,259 INFO L290 TraceCheckUtils]: 116: Hoare triple {234993#(<= ~counter~0 13)} ~cond := #in~cond; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,259 INFO L290 TraceCheckUtils]: 117: Hoare triple {234993#(<= ~counter~0 13)} assume !(0 == ~cond); {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,259 INFO L290 TraceCheckUtils]: 118: Hoare triple {234993#(<= ~counter~0 13)} assume true; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,260 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {234993#(<= ~counter~0 13)} {234993#(<= ~counter~0 13)} #96#return; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,260 INFO L290 TraceCheckUtils]: 120: Hoare triple {234993#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {234993#(<= ~counter~0 13)} is VALID [2022-04-08 06:15:07,262 INFO L290 TraceCheckUtils]: 121: Hoare triple {234993#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,262 INFO L290 TraceCheckUtils]: 122: Hoare triple {235018#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,263 INFO L272 TraceCheckUtils]: 123: Hoare triple {235018#(<= ~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)); {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,263 INFO L290 TraceCheckUtils]: 124: Hoare triple {235018#(<= ~counter~0 14)} ~cond := #in~cond; {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,263 INFO L290 TraceCheckUtils]: 125: Hoare triple {235018#(<= ~counter~0 14)} assume !(0 == ~cond); {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,263 INFO L290 TraceCheckUtils]: 126: Hoare triple {235018#(<= ~counter~0 14)} assume true; {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,264 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {235018#(<= ~counter~0 14)} {235018#(<= ~counter~0 14)} #96#return; {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,264 INFO L290 TraceCheckUtils]: 128: Hoare triple {235018#(<= ~counter~0 14)} assume !(~r~0 > 0); {235018#(<= ~counter~0 14)} is VALID [2022-04-08 06:15:07,266 INFO L290 TraceCheckUtils]: 129: Hoare triple {235018#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,266 INFO L290 TraceCheckUtils]: 130: Hoare triple {235043#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,267 INFO L272 TraceCheckUtils]: 131: Hoare triple {235043#(<= ~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)); {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,267 INFO L290 TraceCheckUtils]: 132: Hoare triple {235043#(<= ~counter~0 15)} ~cond := #in~cond; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,267 INFO L290 TraceCheckUtils]: 133: Hoare triple {235043#(<= ~counter~0 15)} assume !(0 == ~cond); {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,268 INFO L290 TraceCheckUtils]: 134: Hoare triple {235043#(<= ~counter~0 15)} assume true; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,268 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {235043#(<= ~counter~0 15)} {235043#(<= ~counter~0 15)} #98#return; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,283 INFO L290 TraceCheckUtils]: 136: Hoare triple {235043#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235043#(<= ~counter~0 15)} is VALID [2022-04-08 06:15:07,287 INFO L290 TraceCheckUtils]: 137: Hoare triple {235043#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,288 INFO L290 TraceCheckUtils]: 138: Hoare triple {235068#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,288 INFO L272 TraceCheckUtils]: 139: Hoare triple {235068#(<= ~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)); {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,288 INFO L290 TraceCheckUtils]: 140: Hoare triple {235068#(<= ~counter~0 16)} ~cond := #in~cond; {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,289 INFO L290 TraceCheckUtils]: 141: Hoare triple {235068#(<= ~counter~0 16)} assume !(0 == ~cond); {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,289 INFO L290 TraceCheckUtils]: 142: Hoare triple {235068#(<= ~counter~0 16)} assume true; {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,289 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {235068#(<= ~counter~0 16)} {235068#(<= ~counter~0 16)} #98#return; {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,290 INFO L290 TraceCheckUtils]: 144: Hoare triple {235068#(<= ~counter~0 16)} assume !(~r~0 < 0); {235068#(<= ~counter~0 16)} is VALID [2022-04-08 06:15:07,292 INFO L290 TraceCheckUtils]: 145: Hoare triple {235068#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,292 INFO L290 TraceCheckUtils]: 146: Hoare triple {235093#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,293 INFO L272 TraceCheckUtils]: 147: Hoare triple {235093#(<= ~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)); {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,293 INFO L290 TraceCheckUtils]: 148: Hoare triple {235093#(<= ~counter~0 17)} ~cond := #in~cond; {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,293 INFO L290 TraceCheckUtils]: 149: Hoare triple {235093#(<= ~counter~0 17)} assume !(0 == ~cond); {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,294 INFO L290 TraceCheckUtils]: 150: Hoare triple {235093#(<= ~counter~0 17)} assume true; {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,294 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {235093#(<= ~counter~0 17)} {235093#(<= ~counter~0 17)} #94#return; {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,295 INFO L290 TraceCheckUtils]: 152: Hoare triple {235093#(<= ~counter~0 17)} assume !!(0 != ~r~0); {235093#(<= ~counter~0 17)} is VALID [2022-04-08 06:15:07,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {235093#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,299 INFO L290 TraceCheckUtils]: 154: Hoare triple {235118#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,299 INFO L272 TraceCheckUtils]: 155: Hoare triple {235118#(<= ~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)); {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,300 INFO L290 TraceCheckUtils]: 156: Hoare triple {235118#(<= ~counter~0 18)} ~cond := #in~cond; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,300 INFO L290 TraceCheckUtils]: 157: Hoare triple {235118#(<= ~counter~0 18)} assume !(0 == ~cond); {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,300 INFO L290 TraceCheckUtils]: 158: Hoare triple {235118#(<= ~counter~0 18)} assume true; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,301 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {235118#(<= ~counter~0 18)} {235118#(<= ~counter~0 18)} #96#return; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,301 INFO L290 TraceCheckUtils]: 160: Hoare triple {235118#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235118#(<= ~counter~0 18)} is VALID [2022-04-08 06:15:07,304 INFO L290 TraceCheckUtils]: 161: Hoare triple {235118#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,304 INFO L290 TraceCheckUtils]: 162: Hoare triple {235143#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,305 INFO L272 TraceCheckUtils]: 163: Hoare triple {235143#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,305 INFO L290 TraceCheckUtils]: 164: Hoare triple {235143#(<= ~counter~0 19)} ~cond := #in~cond; {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,306 INFO L290 TraceCheckUtils]: 165: Hoare triple {235143#(<= ~counter~0 19)} assume !(0 == ~cond); {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,306 INFO L290 TraceCheckUtils]: 166: Hoare triple {235143#(<= ~counter~0 19)} assume true; {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,306 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {235143#(<= ~counter~0 19)} {235143#(<= ~counter~0 19)} #96#return; {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,307 INFO L290 TraceCheckUtils]: 168: Hoare triple {235143#(<= ~counter~0 19)} assume !(~r~0 > 0); {235143#(<= ~counter~0 19)} is VALID [2022-04-08 06:15:07,309 INFO L290 TraceCheckUtils]: 169: Hoare triple {235143#(<= ~counter~0 19)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,309 INFO L290 TraceCheckUtils]: 170: Hoare triple {235168#(<= ~counter~0 20)} assume !!(#t~post8 < 100);havoc #t~post8; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,310 INFO L272 TraceCheckUtils]: 171: Hoare triple {235168#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,310 INFO L290 TraceCheckUtils]: 172: Hoare triple {235168#(<= ~counter~0 20)} ~cond := #in~cond; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,310 INFO L290 TraceCheckUtils]: 173: Hoare triple {235168#(<= ~counter~0 20)} assume !(0 == ~cond); {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,311 INFO L290 TraceCheckUtils]: 174: Hoare triple {235168#(<= ~counter~0 20)} assume true; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,311 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {235168#(<= ~counter~0 20)} {235168#(<= ~counter~0 20)} #98#return; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,312 INFO L290 TraceCheckUtils]: 176: Hoare triple {235168#(<= ~counter~0 20)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235168#(<= ~counter~0 20)} is VALID [2022-04-08 06:15:07,312 INFO L290 TraceCheckUtils]: 177: Hoare triple {235168#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235193#(<= |main_#t~post8| 20)} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 178: Hoare triple {235193#(<= |main_#t~post8| 20)} assume !(#t~post8 < 100);havoc #t~post8; {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 179: Hoare triple {234637#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 180: Hoare triple {234637#false} assume !(#t~post6 < 100);havoc #t~post6; {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L272 TraceCheckUtils]: 181: Hoare triple {234637#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 182: Hoare triple {234637#false} ~cond := #in~cond; {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 183: Hoare triple {234637#false} assume 0 == ~cond; {234637#false} is VALID [2022-04-08 06:15:07,313 INFO L290 TraceCheckUtils]: 184: Hoare triple {234637#false} assume !false; {234637#false} is VALID [2022-04-08 06:15:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 48 proven. 1026 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:15:07,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 184: Hoare triple {234637#false} assume !false; {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 183: Hoare triple {234637#false} assume 0 == ~cond; {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 182: Hoare triple {234637#false} ~cond := #in~cond; {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L272 TraceCheckUtils]: 181: Hoare triple {234637#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 180: Hoare triple {234637#false} assume !(#t~post6 < 100);havoc #t~post6; {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 179: Hoare triple {234637#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {234637#false} is VALID [2022-04-08 06:15:08,359 INFO L290 TraceCheckUtils]: 178: Hoare triple {235233#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {234637#false} is VALID [2022-04-08 06:15:08,360 INFO L290 TraceCheckUtils]: 177: Hoare triple {235237#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235233#(< |main_#t~post8| 100)} is VALID [2022-04-08 06:15:08,360 INFO L290 TraceCheckUtils]: 176: Hoare triple {235237#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235237#(< ~counter~0 100)} is VALID [2022-04-08 06:15:08,360 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {234636#true} {235237#(< ~counter~0 100)} #98#return; {235237#(< ~counter~0 100)} is VALID [2022-04-08 06:15:08,360 INFO L290 TraceCheckUtils]: 174: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,360 INFO L290 TraceCheckUtils]: 173: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,360 INFO L290 TraceCheckUtils]: 172: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,360 INFO L272 TraceCheckUtils]: 171: Hoare triple {235237#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,361 INFO L290 TraceCheckUtils]: 170: Hoare triple {235237#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {235237#(< ~counter~0 100)} is VALID [2022-04-08 06:15:08,365 INFO L290 TraceCheckUtils]: 169: Hoare triple {235262#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235237#(< ~counter~0 100)} is VALID [2022-04-08 06:15:08,365 INFO L290 TraceCheckUtils]: 168: Hoare triple {235262#(< ~counter~0 99)} assume !(~r~0 > 0); {235262#(< ~counter~0 99)} is VALID [2022-04-08 06:15:08,366 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {234636#true} {235262#(< ~counter~0 99)} #96#return; {235262#(< ~counter~0 99)} is VALID [2022-04-08 06:15:08,366 INFO L290 TraceCheckUtils]: 166: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,366 INFO L290 TraceCheckUtils]: 165: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,366 INFO L290 TraceCheckUtils]: 164: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,366 INFO L272 TraceCheckUtils]: 163: Hoare triple {235262#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,366 INFO L290 TraceCheckUtils]: 162: Hoare triple {235262#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {235262#(< ~counter~0 99)} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 161: Hoare triple {235287#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235262#(< ~counter~0 99)} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 160: Hoare triple {235287#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235287#(< ~counter~0 98)} is VALID [2022-04-08 06:15:08,368 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {234636#true} {235287#(< ~counter~0 98)} #96#return; {235287#(< ~counter~0 98)} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 158: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 157: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 156: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,368 INFO L272 TraceCheckUtils]: 155: Hoare triple {235287#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,368 INFO L290 TraceCheckUtils]: 154: Hoare triple {235287#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {235287#(< ~counter~0 98)} is VALID [2022-04-08 06:15:08,370 INFO L290 TraceCheckUtils]: 153: Hoare triple {235312#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235287#(< ~counter~0 98)} is VALID [2022-04-08 06:15:08,370 INFO L290 TraceCheckUtils]: 152: Hoare triple {235312#(< ~counter~0 97)} assume !!(0 != ~r~0); {235312#(< ~counter~0 97)} is VALID [2022-04-08 06:15:08,370 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {234636#true} {235312#(< ~counter~0 97)} #94#return; {235312#(< ~counter~0 97)} is VALID [2022-04-08 06:15:08,370 INFO L290 TraceCheckUtils]: 150: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,371 INFO L290 TraceCheckUtils]: 149: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,371 INFO L290 TraceCheckUtils]: 148: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,371 INFO L272 TraceCheckUtils]: 147: Hoare triple {235312#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,371 INFO L290 TraceCheckUtils]: 146: Hoare triple {235312#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {235312#(< ~counter~0 97)} is VALID [2022-04-08 06:15:08,372 INFO L290 TraceCheckUtils]: 145: Hoare triple {235337#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {235312#(< ~counter~0 97)} is VALID [2022-04-08 06:15:08,373 INFO L290 TraceCheckUtils]: 144: Hoare triple {235337#(< ~counter~0 96)} assume !(~r~0 < 0); {235337#(< ~counter~0 96)} is VALID [2022-04-08 06:15:08,373 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {234636#true} {235337#(< ~counter~0 96)} #98#return; {235337#(< ~counter~0 96)} is VALID [2022-04-08 06:15:08,373 INFO L290 TraceCheckUtils]: 142: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,373 INFO L290 TraceCheckUtils]: 141: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,373 INFO L290 TraceCheckUtils]: 140: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,373 INFO L272 TraceCheckUtils]: 139: Hoare triple {235337#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,373 INFO L290 TraceCheckUtils]: 138: Hoare triple {235337#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {235337#(< ~counter~0 96)} is VALID [2022-04-08 06:15:08,375 INFO L290 TraceCheckUtils]: 137: Hoare triple {235362#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235337#(< ~counter~0 96)} is VALID [2022-04-08 06:15:08,375 INFO L290 TraceCheckUtils]: 136: Hoare triple {235362#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235362#(< ~counter~0 95)} is VALID [2022-04-08 06:15:08,375 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {234636#true} {235362#(< ~counter~0 95)} #98#return; {235362#(< ~counter~0 95)} is VALID [2022-04-08 06:15:08,375 INFO L290 TraceCheckUtils]: 134: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,375 INFO L290 TraceCheckUtils]: 133: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,375 INFO L290 TraceCheckUtils]: 132: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,375 INFO L272 TraceCheckUtils]: 131: Hoare triple {235362#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,376 INFO L290 TraceCheckUtils]: 130: Hoare triple {235362#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {235362#(< ~counter~0 95)} is VALID [2022-04-08 06:15:08,377 INFO L290 TraceCheckUtils]: 129: Hoare triple {235387#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235362#(< ~counter~0 95)} is VALID [2022-04-08 06:15:08,377 INFO L290 TraceCheckUtils]: 128: Hoare triple {235387#(< ~counter~0 94)} assume !(~r~0 > 0); {235387#(< ~counter~0 94)} is VALID [2022-04-08 06:15:08,378 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {234636#true} {235387#(< ~counter~0 94)} #96#return; {235387#(< ~counter~0 94)} is VALID [2022-04-08 06:15:08,378 INFO L290 TraceCheckUtils]: 126: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,378 INFO L290 TraceCheckUtils]: 125: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,378 INFO L290 TraceCheckUtils]: 124: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,378 INFO L272 TraceCheckUtils]: 123: Hoare triple {235387#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,378 INFO L290 TraceCheckUtils]: 122: Hoare triple {235387#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {235387#(< ~counter~0 94)} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 121: Hoare triple {235412#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235387#(< ~counter~0 94)} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 120: Hoare triple {235412#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235412#(< ~counter~0 93)} is VALID [2022-04-08 06:15:08,380 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {234636#true} {235412#(< ~counter~0 93)} #96#return; {235412#(< ~counter~0 93)} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 118: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,380 INFO L272 TraceCheckUtils]: 115: Hoare triple {235412#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {235412#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {235412#(< ~counter~0 93)} is VALID [2022-04-08 06:15:08,382 INFO L290 TraceCheckUtils]: 113: Hoare triple {235437#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235412#(< ~counter~0 93)} is VALID [2022-04-08 06:15:08,382 INFO L290 TraceCheckUtils]: 112: Hoare triple {235437#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235437#(< ~counter~0 92)} is VALID [2022-04-08 06:15:08,382 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {234636#true} {235437#(< ~counter~0 92)} #96#return; {235437#(< ~counter~0 92)} is VALID [2022-04-08 06:15:08,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,383 INFO L272 TraceCheckUtils]: 107: Hoare triple {235437#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {235437#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {235437#(< ~counter~0 92)} is VALID [2022-04-08 06:15:08,384 INFO L290 TraceCheckUtils]: 105: Hoare triple {235462#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235437#(< ~counter~0 92)} is VALID [2022-04-08 06:15:08,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {235462#(< ~counter~0 91)} assume !!(0 != ~r~0); {235462#(< ~counter~0 91)} is VALID [2022-04-08 06:15:08,385 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {234636#true} {235462#(< ~counter~0 91)} #94#return; {235462#(< ~counter~0 91)} is VALID [2022-04-08 06:15:08,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,385 INFO L290 TraceCheckUtils]: 101: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,385 INFO L272 TraceCheckUtils]: 99: Hoare triple {235462#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {235462#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {235462#(< ~counter~0 91)} is VALID [2022-04-08 06:15:08,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {235487#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {235462#(< ~counter~0 91)} is VALID [2022-04-08 06:15:08,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {235487#(< ~counter~0 90)} assume !(~r~0 < 0); {235487#(< ~counter~0 90)} is VALID [2022-04-08 06:15:08,387 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {234636#true} {235487#(< ~counter~0 90)} #98#return; {235487#(< ~counter~0 90)} is VALID [2022-04-08 06:15:08,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,387 INFO L290 TraceCheckUtils]: 93: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,387 INFO L290 TraceCheckUtils]: 92: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,388 INFO L272 TraceCheckUtils]: 91: Hoare triple {235487#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {235487#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {235487#(< ~counter~0 90)} is VALID [2022-04-08 06:15:08,389 INFO L290 TraceCheckUtils]: 89: Hoare triple {235512#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235487#(< ~counter~0 90)} is VALID [2022-04-08 06:15:08,390 INFO L290 TraceCheckUtils]: 88: Hoare triple {235512#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235512#(< ~counter~0 89)} is VALID [2022-04-08 06:15:08,390 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {234636#true} {235512#(< ~counter~0 89)} #98#return; {235512#(< ~counter~0 89)} is VALID [2022-04-08 06:15:08,390 INFO L290 TraceCheckUtils]: 86: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,390 INFO L290 TraceCheckUtils]: 85: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,390 INFO L272 TraceCheckUtils]: 83: Hoare triple {235512#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {235512#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {235512#(< ~counter~0 89)} is VALID [2022-04-08 06:15:08,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {235537#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235512#(< ~counter~0 89)} is VALID [2022-04-08 06:15:08,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {235537#(< ~counter~0 88)} assume !(~r~0 > 0); {235537#(< ~counter~0 88)} is VALID [2022-04-08 06:15:08,392 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {234636#true} {235537#(< ~counter~0 88)} #96#return; {235537#(< ~counter~0 88)} is VALID [2022-04-08 06:15:08,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,392 INFO L272 TraceCheckUtils]: 75: Hoare triple {235537#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,393 INFO L290 TraceCheckUtils]: 74: Hoare triple {235537#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {235537#(< ~counter~0 88)} is VALID [2022-04-08 06:15:08,394 INFO L290 TraceCheckUtils]: 73: Hoare triple {235562#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235537#(< ~counter~0 88)} is VALID [2022-04-08 06:15:08,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {235562#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235562#(< ~counter~0 87)} is VALID [2022-04-08 06:15:08,395 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {234636#true} {235562#(< ~counter~0 87)} #96#return; {235562#(< ~counter~0 87)} is VALID [2022-04-08 06:15:08,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,395 INFO L290 TraceCheckUtils]: 69: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,395 INFO L290 TraceCheckUtils]: 68: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,395 INFO L272 TraceCheckUtils]: 67: Hoare triple {235562#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,395 INFO L290 TraceCheckUtils]: 66: Hoare triple {235562#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {235562#(< ~counter~0 87)} is VALID [2022-04-08 06:15:08,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {235587#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235562#(< ~counter~0 87)} is VALID [2022-04-08 06:15:08,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {235587#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {235587#(< ~counter~0 86)} is VALID [2022-04-08 06:15:08,397 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {234636#true} {235587#(< ~counter~0 86)} #96#return; {235587#(< ~counter~0 86)} is VALID [2022-04-08 06:15:08,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,397 INFO L272 TraceCheckUtils]: 59: Hoare triple {235587#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {235587#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {235587#(< ~counter~0 86)} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {235612#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235587#(< ~counter~0 86)} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {235612#(< ~counter~0 85)} assume !!(0 != ~r~0); {235612#(< ~counter~0 85)} is VALID [2022-04-08 06:15:08,400 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {234636#true} {235612#(< ~counter~0 85)} #94#return; {235612#(< ~counter~0 85)} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,400 INFO L272 TraceCheckUtils]: 51: Hoare triple {235612#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {235612#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {235612#(< ~counter~0 85)} is VALID [2022-04-08 06:15:08,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {235637#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {235612#(< ~counter~0 85)} is VALID [2022-04-08 06:15:08,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {235637#(< ~counter~0 84)} assume !(~r~0 < 0); {235637#(< ~counter~0 84)} is VALID [2022-04-08 06:15:08,403 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {234636#true} {235637#(< ~counter~0 84)} #98#return; {235637#(< ~counter~0 84)} is VALID [2022-04-08 06:15:08,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,404 INFO L272 TraceCheckUtils]: 43: Hoare triple {235637#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {235637#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {235637#(< ~counter~0 84)} is VALID [2022-04-08 06:15:08,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {235662#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235637#(< ~counter~0 84)} is VALID [2022-04-08 06:15:08,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {235662#(< ~counter~0 83)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {235662#(< ~counter~0 83)} is VALID [2022-04-08 06:15:08,406 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {234636#true} {235662#(< ~counter~0 83)} #98#return; {235662#(< ~counter~0 83)} is VALID [2022-04-08 06:15:08,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,406 INFO L272 TraceCheckUtils]: 35: Hoare triple {235662#(< ~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)); {234636#true} is VALID [2022-04-08 06:15:08,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {235662#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {235662#(< ~counter~0 83)} is VALID [2022-04-08 06:15:08,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {235687#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {235662#(< ~counter~0 83)} is VALID [2022-04-08 06:15:08,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {235687#(< ~counter~0 82)} assume !(~r~0 > 0); {235687#(< ~counter~0 82)} is VALID [2022-04-08 06:15:08,409 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {234636#true} {235687#(< ~counter~0 82)} #96#return; {235687#(< ~counter~0 82)} is VALID [2022-04-08 06:15:08,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {235687#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {234636#true} is VALID [2022-04-08 06:15:08,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {235687#(< ~counter~0 82)} assume !!(#t~post7 < 100);havoc #t~post7; {235687#(< ~counter~0 82)} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {235712#(< ~counter~0 81)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {235687#(< ~counter~0 82)} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {235712#(< ~counter~0 81)} assume !!(0 != ~r~0); {235712#(< ~counter~0 81)} is VALID [2022-04-08 06:15:08,412 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {234636#true} {235712#(< ~counter~0 81)} #94#return; {235712#(< ~counter~0 81)} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,412 INFO L272 TraceCheckUtils]: 19: Hoare triple {235712#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {234636#true} is VALID [2022-04-08 06:15:08,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {235712#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {235712#(< ~counter~0 81)} is VALID [2022-04-08 06:15:08,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {235737#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {235712#(< ~counter~0 81)} is VALID [2022-04-08 06:15:08,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {235737#(< ~counter~0 80)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,415 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {234636#true} {235737#(< ~counter~0 80)} #92#return; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {235737#(< ~counter~0 80)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {234636#true} {235737#(< ~counter~0 80)} #90#return; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {234636#true} assume true; {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {234636#true} assume !(0 == ~cond); {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {234636#true} ~cond := #in~cond; {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L272 TraceCheckUtils]: 6: Hoare triple {235737#(< ~counter~0 80)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {234636#true} is VALID [2022-04-08 06:15:08,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {235737#(< ~counter~0 80)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {235737#(< ~counter~0 80)} call #t~ret9 := main(); {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235737#(< ~counter~0 80)} {234636#true} #102#return; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {235737#(< ~counter~0 80)} assume true; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {234636#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {235737#(< ~counter~0 80)} is VALID [2022-04-08 06:15:08,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {234636#true} call ULTIMATE.init(); {234636#true} is VALID [2022-04-08 06:15:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 48 proven. 266 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-08 06:15:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256056427] [2022-04-08 06:15:08,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587672220] [2022-04-08 06:15:08,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587672220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:15:08,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:15:08,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-08 06:15:08,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876195609] [2022-04-08 06:15:08,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876195609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:08,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:08,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 06:15:08,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699148473] [2022-04-08 06:15:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) Word has length 185 [2022-04-08 06:15:08,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:08,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:15:08,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:08,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 06:15:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 06:15:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 06:15:08,676 INFO L87 Difference]: Start difference. First operand 1043 states and 1388 transitions. Second operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:15:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:16,709 INFO L93 Difference]: Finished difference Result 1247 states and 1690 transitions. [2022-04-08 06:15:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 06:15:16,709 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) Word has length 185 [2022-04-08 06:15:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:15:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 436 transitions. [2022-04-08 06:15:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:15:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 436 transitions. [2022-04-08 06:15:16,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 436 transitions. [2022-04-08 06:15:17,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:17,585 INFO L225 Difference]: With dead ends: 1247 [2022-04-08 06:15:17,585 INFO L226 Difference]: Without dead ends: 1069 [2022-04-08 06:15:17,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1725, Invalid=2307, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 06:15:17,586 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 338 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:15:17,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 432 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 06:15:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2022-04-08 06:15:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1058. [2022-04-08 06:15:20,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:20,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1069 states. Second operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:15:20,884 INFO L74 IsIncluded]: Start isIncluded. First operand 1069 states. Second operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:15:20,885 INFO L87 Difference]: Start difference. First operand 1069 states. Second operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:15:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:20,919 INFO L93 Difference]: Finished difference Result 1069 states and 1417 transitions. [2022-04-08 06:15:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1417 transitions. [2022-04-08 06:15:20,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:20,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:20,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) Second operand 1069 states. [2022-04-08 06:15:20,921 INFO L87 Difference]: Start difference. First operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) Second operand 1069 states. [2022-04-08 06:15:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:20,956 INFO L93 Difference]: Finished difference Result 1069 states and 1417 transitions. [2022-04-08 06:15:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1417 transitions. [2022-04-08 06:15:20,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:20,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:20,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:20,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 792 states have (on average 1.1691919191919191) internal successors, (926), 804 states have internal predecessors, (926), 241 states have call successors, (241), 26 states have call predecessors, (241), 24 states have return successors, (239), 227 states have call predecessors, (239), 239 states have call successors, (239) [2022-04-08 06:15:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1406 transitions. [2022-04-08 06:15:21,014 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1406 transitions. Word has length 185 [2022-04-08 06:15:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:21,014 INFO L478 AbstractCegarLoop]: Abstraction has 1058 states and 1406 transitions. [2022-04-08 06:15:21,014 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 23 states have call successors, (25), 23 states have call predecessors, (25), 21 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2022-04-08 06:15:21,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1058 states and 1406 transitions. [2022-04-08 06:15:34,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1406 edges. 1406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1406 transitions. [2022-04-08 06:15:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-08 06:15:34,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:34,335 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:34,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-08 06:15:34,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-08 06:15:34,536 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 31 times [2022-04-08 06:15:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205723871] [2022-04-08 06:15:34,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:15:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 32 times [2022-04-08 06:15:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550032711] [2022-04-08 06:15:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:34,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:34,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769886920] [2022-04-08 06:15:34,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:34,554 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:34,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 06:15:34,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:15:34,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:34,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 06:15:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:34,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:35,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {242575#true} call ULTIMATE.init(); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {242575#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242575#true} {242575#true} #102#return; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {242575#true} call #t~ret9 := main(); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {242575#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; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {242575#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {242575#true} {242575#true} #90#return; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L272 TraceCheckUtils]: 11: Hoare triple {242575#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)); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,431 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {242575#true} {242575#true} #92#return; {242575#true} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {242575#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {242628#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,432 INFO L272 TraceCheckUtils]: 19: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,433 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #94#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {242628#(<= main_~v~0 1)} assume !!(0 != ~r~0); {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {242628#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,434 INFO L272 TraceCheckUtils]: 27: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,434 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #96#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {242628#(<= main_~v~0 1)} assume !(~r~0 > 0); {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {242628#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,435 INFO L272 TraceCheckUtils]: 35: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,436 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #98#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {242628#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {242628#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,436 INFO L272 TraceCheckUtils]: 43: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,437 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #98#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {242628#(<= main_~v~0 1)} assume !(~r~0 < 0); {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {242628#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,438 INFO L272 TraceCheckUtils]: 51: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,438 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #94#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {242628#(<= main_~v~0 1)} assume !!(0 != ~r~0); {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {242628#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {242628#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,439 INFO L272 TraceCheckUtils]: 59: Hoare triple {242628#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 60: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,440 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {242575#true} {242628#(<= main_~v~0 1)} #96#return; {242628#(<= main_~v~0 1)} is VALID [2022-04-08 06:15:35,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {242628#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242773#(<= main_~v~0 3)} is VALID [2022-04-08 06:15:35,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {242773#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242773#(<= main_~v~0 3)} is VALID [2022-04-08 06:15:35,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {242773#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {242773#(<= main_~v~0 3)} is VALID [2022-04-08 06:15:35,441 INFO L272 TraceCheckUtils]: 67: Hoare triple {242773#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:35,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,442 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {242575#true} {242773#(<= main_~v~0 3)} #96#return; {242773#(<= main_~v~0 3)} is VALID [2022-04-08 06:15:35,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {242773#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {242798#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {242798#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,444 INFO L272 TraceCheckUtils]: 75: Hoare triple {242798#(< 0 (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:35,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,445 INFO L290 TraceCheckUtils]: 78: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,445 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {242575#true} {242798#(< 0 (+ main_~r~0 3))} #96#return; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,445 INFO L290 TraceCheckUtils]: 80: Hoare triple {242798#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {242798#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {242798#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,446 INFO L272 TraceCheckUtils]: 83: Hoare triple {242798#(< 0 (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:35,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,446 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {242575#true} {242798#(< 0 (+ main_~r~0 3))} #98#return; {242798#(< 0 (+ main_~r~0 3))} is VALID [2022-04-08 06:15:35,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {242798#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,454 INFO L272 TraceCheckUtils]: 91: Hoare triple {242847#(< main_~u~0 (+ 5 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)); {242575#true} is VALID [2022-04-08 06:15:35,454 INFO L290 TraceCheckUtils]: 92: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,454 INFO L290 TraceCheckUtils]: 93: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,454 INFO L290 TraceCheckUtils]: 94: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,454 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {242575#true} {242847#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,455 INFO L290 TraceCheckUtils]: 97: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,455 INFO L290 TraceCheckUtils]: 98: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,455 INFO L272 TraceCheckUtils]: 99: Hoare triple {242847#(< main_~u~0 (+ 5 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)); {242575#true} is VALID [2022-04-08 06:15:35,455 INFO L290 TraceCheckUtils]: 100: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,455 INFO L290 TraceCheckUtils]: 101: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,455 INFO L290 TraceCheckUtils]: 102: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,456 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {242575#true} {242847#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 104: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 105: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 106: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,456 INFO L272 TraceCheckUtils]: 107: Hoare triple {242847#(< main_~u~0 (+ 5 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)); {242575#true} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 108: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 109: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,456 INFO L290 TraceCheckUtils]: 110: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,457 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {242575#true} {242847#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {242847#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-08 06:15:35,460 INFO L290 TraceCheckUtils]: 112: Hoare triple {242847#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-08 06:15:35,460 INFO L290 TraceCheckUtils]: 113: Hoare triple {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-08 06:15:35,461 INFO L290 TraceCheckUtils]: 114: Hoare triple {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-08 06:15:35,461 INFO L272 TraceCheckUtils]: 115: Hoare triple {242920#(< main_~u~0 (+ main_~v~0 main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:35,461 INFO L290 TraceCheckUtils]: 116: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,461 INFO L290 TraceCheckUtils]: 117: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,461 INFO L290 TraceCheckUtils]: 118: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,461 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {242575#true} {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #96#return; {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-08 06:15:35,462 INFO L290 TraceCheckUtils]: 120: Hoare triple {242920#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,462 INFO L290 TraceCheckUtils]: 121: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,463 INFO L290 TraceCheckUtils]: 122: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,463 INFO L272 TraceCheckUtils]: 123: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) 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)); {242575#true} is VALID [2022-04-08 06:15:35,463 INFO L290 TraceCheckUtils]: 124: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,463 INFO L290 TraceCheckUtils]: 125: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,463 INFO L290 TraceCheckUtils]: 126: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,463 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {242575#true} {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} #96#return; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 128: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 > 0); {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 129: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 130: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,464 INFO L272 TraceCheckUtils]: 131: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) 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)); {242575#true} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 132: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 133: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,464 INFO L290 TraceCheckUtils]: 134: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,465 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {242575#true} {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} #98#return; {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-08 06:15:35,468 INFO L290 TraceCheckUtils]: 136: Hoare triple {242945#(< (+ main_~u~0 1) (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,469 INFO L290 TraceCheckUtils]: 137: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,469 INFO L290 TraceCheckUtils]: 138: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,469 INFO L272 TraceCheckUtils]: 139: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:35,469 INFO L290 TraceCheckUtils]: 140: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,469 INFO L290 TraceCheckUtils]: 141: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,469 INFO L290 TraceCheckUtils]: 142: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,469 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {242575#true} {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #98#return; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,470 INFO L290 TraceCheckUtils]: 144: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !(~r~0 < 0); {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,470 INFO L290 TraceCheckUtils]: 145: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,470 INFO L290 TraceCheckUtils]: 146: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !!(#t~post6 < 100);havoc #t~post6; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,470 INFO L272 TraceCheckUtils]: 147: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:35,470 INFO L290 TraceCheckUtils]: 148: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,471 INFO L290 TraceCheckUtils]: 149: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,471 INFO L290 TraceCheckUtils]: 150: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,471 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {242575#true} {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #94#return; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,471 INFO L290 TraceCheckUtils]: 152: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !!(0 != ~r~0); {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,472 INFO L290 TraceCheckUtils]: 153: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,472 INFO L290 TraceCheckUtils]: 154: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !!(#t~post7 < 100);havoc #t~post7; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,472 INFO L272 TraceCheckUtils]: 155: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:35,472 INFO L290 TraceCheckUtils]: 156: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,472 INFO L290 TraceCheckUtils]: 157: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,472 INFO L290 TraceCheckUtils]: 158: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,473 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {242575#true} {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} #96#return; {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} is VALID [2022-04-08 06:15:35,477 INFO L290 TraceCheckUtils]: 160: Hoare triple {242994#(< (+ main_~r~0 3) (* main_~v~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243067#(< (+ 5 main_~r~0) main_~v~0)} is VALID [2022-04-08 06:15:35,478 INFO L290 TraceCheckUtils]: 161: Hoare triple {243067#(< (+ 5 main_~r~0) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243067#(< (+ 5 main_~r~0) main_~v~0)} is VALID [2022-04-08 06:15:35,478 INFO L290 TraceCheckUtils]: 162: Hoare triple {243067#(< (+ 5 main_~r~0) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {243067#(< (+ 5 main_~r~0) main_~v~0)} is VALID [2022-04-08 06:15:35,478 INFO L272 TraceCheckUtils]: 163: Hoare triple {243067#(< (+ 5 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)); {242575#true} is VALID [2022-04-08 06:15:35,478 INFO L290 TraceCheckUtils]: 164: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,478 INFO L290 TraceCheckUtils]: 165: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,478 INFO L290 TraceCheckUtils]: 166: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,479 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {242575#true} {243067#(< (+ 5 main_~r~0) main_~v~0)} #96#return; {243067#(< (+ 5 main_~r~0) main_~v~0)} is VALID [2022-04-08 06:15:35,481 INFO L290 TraceCheckUtils]: 168: Hoare triple {243067#(< (+ 5 main_~r~0) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243092#(< (+ 5 main_~r~0) 0)} is VALID [2022-04-08 06:15:35,481 INFO L290 TraceCheckUtils]: 169: Hoare triple {243092#(< (+ 5 main_~r~0) 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243092#(< (+ 5 main_~r~0) 0)} is VALID [2022-04-08 06:15:35,482 INFO L290 TraceCheckUtils]: 170: Hoare triple {243092#(< (+ 5 main_~r~0) 0)} assume !!(#t~post7 < 100);havoc #t~post7; {243092#(< (+ 5 main_~r~0) 0)} is VALID [2022-04-08 06:15:35,482 INFO L272 TraceCheckUtils]: 171: Hoare triple {243092#(< (+ 5 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)); {242575#true} is VALID [2022-04-08 06:15:35,482 INFO L290 TraceCheckUtils]: 172: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:35,482 INFO L290 TraceCheckUtils]: 173: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:35,482 INFO L290 TraceCheckUtils]: 174: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:35,482 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {242575#true} {243092#(< (+ 5 main_~r~0) 0)} #96#return; {243092#(< (+ 5 main_~r~0) 0)} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 176: Hoare triple {243092#(< (+ 5 main_~r~0) 0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 177: Hoare triple {242576#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 178: Hoare triple {242576#false} assume !(#t~post7 < 100);havoc #t~post7; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 179: Hoare triple {242576#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 180: Hoare triple {242576#false} assume !(#t~post8 < 100);havoc #t~post8; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 181: Hoare triple {242576#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L290 TraceCheckUtils]: 182: Hoare triple {242576#false} assume !(#t~post6 < 100);havoc #t~post6; {242576#false} is VALID [2022-04-08 06:15:35,484 INFO L272 TraceCheckUtils]: 183: Hoare triple {242576#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {242576#false} is VALID [2022-04-08 06:15:35,485 INFO L290 TraceCheckUtils]: 184: Hoare triple {242576#false} ~cond := #in~cond; {242576#false} is VALID [2022-04-08 06:15:35,485 INFO L290 TraceCheckUtils]: 185: Hoare triple {242576#false} assume 0 == ~cond; {242576#false} is VALID [2022-04-08 06:15:35,485 INFO L290 TraceCheckUtils]: 186: Hoare triple {242576#false} assume !false; {242576#false} is VALID [2022-04-08 06:15:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 80 proven. 252 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-08 06:15:35,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:15:36,411 INFO L290 TraceCheckUtils]: 186: Hoare triple {242576#false} assume !false; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 185: Hoare triple {242576#false} assume 0 == ~cond; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 184: Hoare triple {242576#false} ~cond := #in~cond; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L272 TraceCheckUtils]: 183: Hoare triple {242576#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 182: Hoare triple {242576#false} assume !(#t~post6 < 100);havoc #t~post6; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 181: Hoare triple {242576#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 180: Hoare triple {242576#false} assume !(#t~post8 < 100);havoc #t~post8; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 179: Hoare triple {242576#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 178: Hoare triple {242576#false} assume !(#t~post7 < 100);havoc #t~post7; {242576#false} is VALID [2022-04-08 06:15:36,412 INFO L290 TraceCheckUtils]: 177: Hoare triple {242576#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {242576#false} is VALID [2022-04-08 06:15:36,413 INFO L290 TraceCheckUtils]: 176: Hoare triple {243177#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {242576#false} is VALID [2022-04-08 06:15:36,413 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {242575#true} {243177#(not (< 0 main_~r~0))} #96#return; {243177#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:15:36,413 INFO L290 TraceCheckUtils]: 174: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,413 INFO L290 TraceCheckUtils]: 173: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,414 INFO L290 TraceCheckUtils]: 172: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,414 INFO L272 TraceCheckUtils]: 171: Hoare triple {243177#(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)); {242575#true} is VALID [2022-04-08 06:15:36,414 INFO L290 TraceCheckUtils]: 170: Hoare triple {243177#(not (< 0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {243177#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:15:36,414 INFO L290 TraceCheckUtils]: 169: Hoare triple {243177#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243177#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:15:36,416 INFO L290 TraceCheckUtils]: 168: Hoare triple {243202#(<= main_~r~0 main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243177#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:15:36,416 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {242575#true} {243202#(<= main_~r~0 main_~v~0)} #96#return; {243202#(<= main_~r~0 main_~v~0)} is VALID [2022-04-08 06:15:36,417 INFO L290 TraceCheckUtils]: 166: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,417 INFO L290 TraceCheckUtils]: 165: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,417 INFO L290 TraceCheckUtils]: 164: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,417 INFO L272 TraceCheckUtils]: 163: Hoare triple {243202#(<= 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)); {242575#true} is VALID [2022-04-08 06:15:36,417 INFO L290 TraceCheckUtils]: 162: Hoare triple {243202#(<= main_~r~0 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {243202#(<= main_~r~0 main_~v~0)} is VALID [2022-04-08 06:15:36,417 INFO L290 TraceCheckUtils]: 161: Hoare triple {243202#(<= main_~r~0 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243202#(<= main_~r~0 main_~v~0)} is VALID [2022-04-08 06:15:36,420 INFO L290 TraceCheckUtils]: 160: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243202#(<= main_~r~0 main_~v~0)} is VALID [2022-04-08 06:15:36,420 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {242575#true} {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #96#return; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,420 INFO L290 TraceCheckUtils]: 158: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,420 INFO L290 TraceCheckUtils]: 157: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,420 INFO L290 TraceCheckUtils]: 156: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,420 INFO L272 TraceCheckUtils]: 155: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {242575#true} is VALID [2022-04-08 06:15:36,420 INFO L290 TraceCheckUtils]: 154: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,421 INFO L290 TraceCheckUtils]: 153: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,421 INFO L290 TraceCheckUtils]: 152: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(0 != ~r~0); {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,421 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {242575#true} {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #94#return; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,421 INFO L290 TraceCheckUtils]: 150: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,421 INFO L290 TraceCheckUtils]: 149: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,421 INFO L290 TraceCheckUtils]: 148: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,421 INFO L272 TraceCheckUtils]: 147: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {242575#true} is VALID [2022-04-08 06:15:36,422 INFO L290 TraceCheckUtils]: 146: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post6 < 100);havoc #t~post6; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,422 INFO L290 TraceCheckUtils]: 145: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,422 INFO L290 TraceCheckUtils]: 144: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !(~r~0 < 0); {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,422 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {242575#true} {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #98#return; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,422 INFO L290 TraceCheckUtils]: 142: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,422 INFO L290 TraceCheckUtils]: 141: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,423 INFO L290 TraceCheckUtils]: 140: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,423 INFO L272 TraceCheckUtils]: 139: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {242575#true} is VALID [2022-04-08 06:15:36,423 INFO L290 TraceCheckUtils]: 138: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,423 INFO L290 TraceCheckUtils]: 137: Hoare triple {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,428 INFO L290 TraceCheckUtils]: 136: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {243227#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-08 06:15:36,429 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {242575#true} {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #98#return; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,429 INFO L290 TraceCheckUtils]: 134: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,429 INFO L290 TraceCheckUtils]: 133: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,429 INFO L290 TraceCheckUtils]: 132: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,429 INFO L272 TraceCheckUtils]: 131: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (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)); {242575#true} is VALID [2022-04-08 06:15:36,429 INFO L290 TraceCheckUtils]: 130: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post8 < 100);havoc #t~post8; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,430 INFO L290 TraceCheckUtils]: 129: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,430 INFO L290 TraceCheckUtils]: 128: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,430 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {242575#true} {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #96#return; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,430 INFO L290 TraceCheckUtils]: 126: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,430 INFO L290 TraceCheckUtils]: 125: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,430 INFO L290 TraceCheckUtils]: 124: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,430 INFO L272 TraceCheckUtils]: 123: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (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)); {242575#true} is VALID [2022-04-08 06:15:36,431 INFO L290 TraceCheckUtils]: 122: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,431 INFO L290 TraceCheckUtils]: 121: Hoare triple {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,432 INFO L290 TraceCheckUtils]: 120: Hoare triple {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243300#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:15:36,432 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {242575#true} {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} #96#return; {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} is VALID [2022-04-08 06:15:36,432 INFO L290 TraceCheckUtils]: 118: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,432 INFO L290 TraceCheckUtils]: 117: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,432 INFO L290 TraceCheckUtils]: 116: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,432 INFO L272 TraceCheckUtils]: 115: Hoare triple {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= 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)); {242575#true} is VALID [2022-04-08 06:15:36,432 INFO L290 TraceCheckUtils]: 114: Hoare triple {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} is VALID [2022-04-08 06:15:36,433 INFO L290 TraceCheckUtils]: 113: Hoare triple {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} is VALID [2022-04-08 06:15:36,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243349#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~v~0 2)) (<= main_~v~0 main_~r~0))} is VALID [2022-04-08 06:15:36,436 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {242575#true} {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #96#return; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,436 INFO L290 TraceCheckUtils]: 110: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,436 INFO L290 TraceCheckUtils]: 109: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,436 INFO L290 TraceCheckUtils]: 108: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,436 INFO L272 TraceCheckUtils]: 107: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:36,436 INFO L290 TraceCheckUtils]: 106: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !!(#t~post7 < 100);havoc #t~post7; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,436 INFO L290 TraceCheckUtils]: 105: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,437 INFO L290 TraceCheckUtils]: 104: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !!(0 != ~r~0); {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,437 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {242575#true} {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #94#return; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,437 INFO L290 TraceCheckUtils]: 100: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,437 INFO L272 TraceCheckUtils]: 99: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:36,437 INFO L290 TraceCheckUtils]: 98: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !!(#t~post6 < 100);havoc #t~post6; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,438 INFO L290 TraceCheckUtils]: 97: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,438 INFO L290 TraceCheckUtils]: 96: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !(~r~0 < 0); {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,438 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {242575#true} {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #98#return; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,438 INFO L290 TraceCheckUtils]: 94: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,438 INFO L290 TraceCheckUtils]: 93: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,438 INFO L290 TraceCheckUtils]: 92: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,439 INFO L272 TraceCheckUtils]: 91: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:36,439 INFO L290 TraceCheckUtils]: 90: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} assume !!(#t~post8 < 100);havoc #t~post8; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,439 INFO L290 TraceCheckUtils]: 89: Hoare triple {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {243374#(<= (* (div (+ (* (- 1) main_~u~0) 3) (- 2)) 2) (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,442 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {242575#true} {243447#(<= 0 (+ main_~r~0 8))} #98#return; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,442 INFO L272 TraceCheckUtils]: 83: Hoare triple {243447#(<= 0 (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} assume !!(#t~post8 < 100);havoc #t~post8; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,442 INFO L290 TraceCheckUtils]: 80: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} assume !(~r~0 > 0); {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,443 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {242575#true} {243447#(<= 0 (+ main_~r~0 8))} #96#return; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,443 INFO L290 TraceCheckUtils]: 77: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,443 INFO L290 TraceCheckUtils]: 76: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,443 INFO L272 TraceCheckUtils]: 75: Hoare triple {243447#(<= 0 (+ main_~r~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)); {242575#true} is VALID [2022-04-08 06:15:36,444 INFO L290 TraceCheckUtils]: 74: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} assume !!(#t~post7 < 100);havoc #t~post7; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,444 INFO L290 TraceCheckUtils]: 73: Hoare triple {243447#(<= 0 (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,445 INFO L290 TraceCheckUtils]: 72: Hoare triple {243496#(<= main_~v~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243447#(<= 0 (+ main_~r~0 8))} is VALID [2022-04-08 06:15:36,446 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {242575#true} {243496#(<= main_~v~0 9)} #96#return; {243496#(<= main_~v~0 9)} is VALID [2022-04-08 06:15:36,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,446 INFO L272 TraceCheckUtils]: 67: Hoare triple {243496#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {243496#(<= main_~v~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {243496#(<= main_~v~0 9)} is VALID [2022-04-08 06:15:36,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {243496#(<= main_~v~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243496#(<= main_~v~0 9)} is VALID [2022-04-08 06:15:36,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {243521#(<= main_~v~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {243496#(<= main_~v~0 9)} is VALID [2022-04-08 06:15:36,448 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #96#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,449 INFO L272 TraceCheckUtils]: 59: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {243521#(<= main_~v~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,449 INFO L290 TraceCheckUtils]: 56: Hoare triple {243521#(<= main_~v~0 7)} assume !!(0 != ~r~0); {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,449 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #94#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,450 INFO L272 TraceCheckUtils]: 51: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {243521#(<= main_~v~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {243521#(<= main_~v~0 7)} assume !(~r~0 < 0); {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,451 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #98#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,451 INFO L272 TraceCheckUtils]: 43: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {243521#(<= main_~v~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {243521#(<= main_~v~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,452 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #98#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,452 INFO L272 TraceCheckUtils]: 35: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {243521#(<= main_~v~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {243521#(<= main_~v~0 7)} assume !(~r~0 > 0); {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,453 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #96#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {243521#(<= main_~v~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {243521#(<= main_~v~0 7)} assume !!(0 != ~r~0); {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {242575#true} {243521#(<= main_~v~0 7)} #94#return; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {243521#(<= main_~v~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)); {242575#true} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {243521#(<= main_~v~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {243521#(<= main_~v~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {242575#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {243521#(<= main_~v~0 7)} is VALID [2022-04-08 06:15:36,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {242575#true} {242575#true} #92#return; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {242575#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)); {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {242575#true} {242575#true} #90#return; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {242575#true} assume !(0 == ~cond); {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {242575#true} ~cond := #in~cond; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {242575#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {242575#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; {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {242575#true} call #t~ret9 := main(); {242575#true} is VALID [2022-04-08 06:15:36,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242575#true} {242575#true} #102#return; {242575#true} is VALID [2022-04-08 06:15:36,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {242575#true} assume true; {242575#true} is VALID [2022-04-08 06:15:36,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {242575#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {242575#true} is VALID [2022-04-08 06:15:36,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {242575#true} call ULTIMATE.init(); {242575#true} is VALID [2022-04-08 06:15:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 80 proven. 252 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-08 06:15:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:36,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550032711] [2022-04-08 06:15:36,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:36,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769886920] [2022-04-08 06:15:36,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769886920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:15:36,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:15:36,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 06:15:36,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:36,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205723871] [2022-04-08 06:15:36,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205723871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:36,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:36,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:15:36,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875445089] [2022-04-08 06:15:36,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 187 [2022-04-08 06:15:36,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:36,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-04-08 06:15:36,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:36,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:15:36,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:36,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:15:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:15:36,661 INFO L87 Difference]: Start difference. First operand 1058 states and 1406 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-04-08 06:15:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:51,931 INFO L93 Difference]: Finished difference Result 1935 states and 2627 transitions. [2022-04-08 06:15:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:15:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 187 [2022-04-08 06:15:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-04-08 06:15:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 365 transitions. [2022-04-08 06:15:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 11 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2022-04-08 06:15:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 365 transitions. [2022-04-08 06:15:51,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 365 transitions. [2022-04-08 06:15:52,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:52,792 INFO L225 Difference]: With dead ends: 1935 [2022-04-08 06:15:52,792 INFO L226 Difference]: Without dead ends: 1765 [2022-04-08 06:15:52,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-04-08 06:15:52,796 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 94 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:15:52,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 1206 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 06:15:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states.