/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:11:42,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:11:42,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:11:42,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:11:42,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:11:42,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:11:42,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:11:42,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:11:42,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:11:42,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:11:42,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:11:42,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:11:42,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:11:42,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:11:42,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:11:42,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:11:42,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:11:42,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:11:42,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:11:42,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:11:42,870 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:11:42,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:11:42,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:11:42,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:11:42,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:11:42,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:11:42,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:11:42,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:11:42,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:11:42,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:11:42,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:11:42,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:11:42,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:11:42,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:11:42,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:11:42,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:11:42,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:11:42,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:11:42,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:11:42,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:11:42,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:11:42,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:11:42,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:11:42,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:11:42,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:11:42,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:11:42,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:11:42,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:11:42,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:11:42,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:11:42,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:11:42,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:11:42,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:11:42,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:11:42,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:11:42,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:11:42,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:11:42,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:11:42,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:42,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:11:42,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:11:42,897 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:11:42,897 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:11:42,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:11:42,897 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:11:42,897 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-15 15:11:43,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:11:43,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:11:43,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:11:43,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:11:43,141 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:11:43,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-15 15:11:43,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36219972/1ebab410798d42bdac446e8952a94b44/FLAG15f502629 [2022-04-15 15:11:43,514 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:11:43,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-15 15:11:43,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36219972/1ebab410798d42bdac446e8952a94b44/FLAG15f502629 [2022-04-15 15:11:43,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36219972/1ebab410798d42bdac446e8952a94b44 [2022-04-15 15:11:43,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:11:43,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:11:43,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:43,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:11:43,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:11:43,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:43" (1/1) ... [2022-04-15 15:11:43,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0c5075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:43, skipping insertion in model container [2022-04-15 15:11:43,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:43" (1/1) ... [2022-04-15 15:11:43,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:11:43,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:11:44,136 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_unwindbound50.c[535,548] [2022-04-15 15:11:44,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:44,197 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:11:44,213 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_unwindbound50.c[535,548] [2022-04-15 15:11:44,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:44,240 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:11:44,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44 WrapperNode [2022-04-15 15:11:44,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:44,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:11:44,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:11:44,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:11:44,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:11:44,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:11:44,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:11:44,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:11:44,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (1/1) ... [2022-04-15 15:11:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:44,323 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-15 15:11:44,330 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-15 15:11:44,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:11:44,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:11:44,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:11:44,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:11:44,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:11:44,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:11:44,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:11:44,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:11:44,405 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:11:44,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:11:44,566 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:11:44,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:11:44,572 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:11:44,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:44 BoogieIcfgContainer [2022-04-15 15:11:44,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:11:44,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:11:44,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:11:44,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:11:44,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:11:43" (1/3) ... [2022-04-15 15:11:44,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6d2f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:44, skipping insertion in model container [2022-04-15 15:11:44,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:44" (2/3) ... [2022-04-15 15:11:44,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6d2f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:44, skipping insertion in model container [2022-04-15 15:11:44,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:44" (3/3) ... [2022-04-15 15:11:44,580 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-15 15:11:44,584 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:11:44,585 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:11:44,636 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:11:44,642 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-15 15:11:44,642 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:11:44,671 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-15 15:11:44,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 15:11:44,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:44,678 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-15 15:11:44,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:44,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 15:11:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:44,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1292955673] [2022-04-15 15:11:44,723 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 15:11:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:44,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235208639] [2022-04-15 15:11:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:44,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185916953] [2022-04-15 15:11:44,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:44,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:44,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:44,816 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-15 15:11:44,817 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-15 15:11:44,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:44,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:44,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 15:11:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:44,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:44,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 15:11:44,977 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-15 15:11:44,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:44,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 15:11:44,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 15:11:44,979 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-15 15:11:44,979 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-15 15:11:44,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:44,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 15:11:44,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:44,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 15:11:44,980 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-15 15:11:44,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:44,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:11:44,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:11:44,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 15:11:44,982 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-15 15:11:44,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:11:44,983 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-15 15:11:44,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 15:11:44,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 15:11:44,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 15:11:44,985 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-15 15:11:44,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235208639] [2022-04-15 15:11:44,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185916953] [2022-04-15 15:11:44,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185916953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:44,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:44,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:44,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:44,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1292955673] [2022-04-15 15:11:44,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1292955673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:44,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036246341] [2022-04-15 15:11:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:44,996 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-15 15:11:44,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:45,000 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-15 15:11:45,022 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-15 15:11:45,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 15:11:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 15:11:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:11:45,044 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-15 15:11:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,108 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 15:11:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 15:11:45,108 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-15 15:11:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:45,110 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-15 15:11:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:45,119 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-15 15:11:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:45,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 15:11:45,230 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-15 15:11:45,241 INFO L225 Difference]: With dead ends: 67 [2022-04-15 15:11:45,241 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 15:11:45,244 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-15 15:11:45,247 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-15 15:11:45,248 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-15 15:11:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 15:11:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 15:11:45,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:45,272 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-15 15:11:45,273 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-15 15:11:45,273 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-15 15:11:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,278 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:45,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,280 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-15 15:11:45,280 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-15 15:11:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,284 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:45,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:45,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:45,286 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-15 15:11:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 15:11:45,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 15:11:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:45,291 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 15:11:45,291 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-15 15:11:45,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 15:11:45,328 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-15 15:11:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:45,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:45,330 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-15 15:11:45,358 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-15 15:11:45,553 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-15 15:11:45,554 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:45,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 15:11:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594357467] [2022-04-15 15:11:45,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 15:11:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:45,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160300844] [2022-04-15 15:11:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:45,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:45,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452714310] [2022-04-15 15:11:45,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:45,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:45,585 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-15 15:11:45,587 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-15 15:11:45,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:45,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:45,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:11:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:45,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:45,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 15:11:45,841 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-15 15:11:45,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,843 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-15 15:11:45,844 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-15 15:11:45,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,846 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-15 15:11:45,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,883 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,884 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-15 15:11:45,884 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-15 15:11:45,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {370#false} is VALID [2022-04-15 15:11:45,885 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-15 15:11:45,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 15:11:45,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 15:11:45,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 15:11:45,888 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-15 15:11:45,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160300844] [2022-04-15 15:11:45,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:45,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452714310] [2022-04-15 15:11:45,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452714310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:45,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:45,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:45,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:45,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594357467] [2022-04-15 15:11:45,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594357467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:45,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:45,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349930956] [2022-04-15 15:11:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:45,909 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-15 15:11:45,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:45,910 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-15 15:11:45,927 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-15 15:11:45,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:45,929 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-15 15:11:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,009 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 15:11:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:46,009 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-15 15:11:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:46,010 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-15 15:11:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:46,012 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-15 15:11:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:46,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 15:11:46,054 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-15 15:11:46,056 INFO L225 Difference]: With dead ends: 41 [2022-04-15 15:11:46,056 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 15:11:46,056 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-15 15:11:46,058 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-15 15:11:46,058 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-15 15:11:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 15:11:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 15:11:46,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:46,071 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-15 15:11:46,071 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-15 15:11:46,072 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-15 15:11:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,074 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:46,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:46,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:46,075 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-15 15:11:46,076 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-15 15:11:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:46,078 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:46,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:46,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:46,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:46,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:46,080 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-15 15:11:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 15:11:46,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 15:11:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:46,082 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 15:11:46,083 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-15 15:11:46,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 15:11:46,118 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-15 15:11:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:46,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:46,119 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-15 15:11:46,145 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-15 15:11:46,334 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-15 15:11:46,334 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 15:11:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:46,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945781183] [2022-04-15 15:11:46,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 15:11:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:46,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451773030] [2022-04-15 15:11:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:46,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:46,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674363772] [2022-04-15 15:11:46,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:46,356 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-15 15:11:46,375 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-15 15:11:46,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:46,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:46,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:46,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:46,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 15:11:46,771 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-15 15:11:46,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:46,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 15:11:46,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 15:11:46,772 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-15 15:11:46,772 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-15 15:11:46,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:46,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:46,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:46,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 15:11:46,773 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-15 15:11:46,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:46,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:46,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:46,774 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 15:11:48,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 15:11:48,361 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-15 15:11:48,362 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 < 50);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-15 15:11:49,191 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-15 15:11:49,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:49,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 15:11:49,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 15:11:49,193 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-15 15:11:49,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451773030] [2022-04-15 15:11:49,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:49,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674363772] [2022-04-15 15:11:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674363772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:49,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:49,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:49,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:49,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945781183] [2022-04-15 15:11:49,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945781183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:49,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662818058] [2022-04-15 15:11:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:49,195 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-15 15:11:49,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:49,196 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-15 15:11:52,016 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-15 15:11:52,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:52,017 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-15 15:11:59,108 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-15 15:12:01,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:12:04,044 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-15 15:12:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:04,078 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 15:12:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:12:04,078 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-15 15:12:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:04,079 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-15 15:12:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:12:04,082 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-15 15:12:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:12:04,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 15:12:10,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 65 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:10,160 INFO L225 Difference]: With dead ends: 53 [2022-04-15 15:12:10,160 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 15:12:10,160 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-15 15:12:10,161 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:10,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2022-04-15 15:12:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 15:12:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 15:12:10,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:10,183 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-15 15:12:10,184 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-15 15:12:10,184 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-15 15:12:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:10,187 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:12:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:12:10,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:10,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:10,189 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-15 15:12:10,189 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-15 15:12:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:10,192 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:12:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:12:10,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:10,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:10,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:10,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:10,194 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-15 15:12:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 15:12:10,196 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 15:12:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:10,197 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 15:12:10,197 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-15 15:12:10,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 15:12:16,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 64 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 15:12:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:12:16,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:16,272 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-15 15:12:16,289 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-15 15:12:16,479 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-15 15:12:16,480 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 15:12:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128348008] [2022-04-15 15:12:16,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 15:12:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:16,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885738678] [2022-04-15 15:12:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:16,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938887784] [2022-04-15 15:12:16,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:16,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:16,504 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-15 15:12:16,508 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-15 15:12:16,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:16,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:16,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:12:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:16,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:16,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:12:16,742 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-15 15:12:16,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:16,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:12:16,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:12:16,743 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-15 15:12:16,743 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-15 15:12:16,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:12:16,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:12:16,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:16,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:12:16,744 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-15 15:12:16,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:12:16,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:12:16,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:16,745 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:12:16,746 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-15 15:12:16,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:12:16,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:12:16,747 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-15 15:12:16,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:12:16,748 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-15 15:12:16,750 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-15 15:12:16,751 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-15 15:12:16,752 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-15 15:12:16,753 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-15 15:12:16,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:12:16,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:12:16,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:12:16,772 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-15 15:12:16,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:17,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:12:17,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:12:17,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:12:17,199 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-15 15:12:17,200 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-15 15:12:17,201 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-15 15:12:17,204 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-15 15:12:17,209 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-15 15:12:17,209 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-15 15:12:17,209 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-15 15:12:17,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:12:17,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:12:17,210 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-15 15:12:17,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:12:17,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:17,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:12:17,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:12:17,210 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-15 15:12:17,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:12:17,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:17,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:12:17,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:12:17,211 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-15 15:12:17,211 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-15 15:12:17,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:12:17,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:12:17,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:12:17,212 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-15 15:12:17,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:12:17,212 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-15 15:12:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885738678] [2022-04-15 15:12:17,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938887784] [2022-04-15 15:12:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938887784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:17,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:17,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 15:12:17,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128348008] [2022-04-15 15:12:17,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128348008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:17,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:17,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521360799] [2022-04-15 15:12:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:17,215 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-15 15:12:17,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:17,215 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-15 15:12:17,235 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-15 15:12:17,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:12:17,237 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-15 15:12:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,631 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 15:12:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:12:17,631 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-15 15:12:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:17,632 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-15 15:12:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:12:17,634 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-15 15:12:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:12:17,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 15:12:17,681 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-15 15:12:17,683 INFO L225 Difference]: With dead ends: 57 [2022-04-15 15:12:17,683 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 15:12:17,684 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-15 15:12:17,684 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-15 15:12:17,685 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-15 15:12:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 15:12:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 15:12:17,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:17,715 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-15 15:12:17,716 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-15 15:12:17,718 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-15 15:12:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,725 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:12:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:12:17,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:17,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:17,728 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-15 15:12:17,728 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-15 15:12:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:17,732 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:12:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:12:17,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:17,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:17,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:17,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:17,734 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-15 15:12:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 15:12:17,736 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-15 15:12:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:17,737 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 15:12:17,737 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-15 15:12:17,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 15:12:19,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:12:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 15:12:19,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:19,624 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-15 15:12:19,640 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-15 15:12:19,827 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-15 15:12:19,827 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 15:12:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:19,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036479757] [2022-04-15 15:12:19,828 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 15:12:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:19,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303773637] [2022-04-15 15:12:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:19,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:19,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594660665] [2022-04-15 15:12:19,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:19,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:19,849 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-15 15:12:19,857 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-15 15:12:20,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:20,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:12:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:20,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:20,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-15 15:12:20,245 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-15 15:12:20,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,258 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-15 15:12:20,258 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-15 15:12:20,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,260 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-15 15:12:20,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:20,262 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-15 15:12:20,262 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-15 15:12:20,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,263 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-15 15:12:20,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,265 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:20,266 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-15 15:12:20,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1554#false} is VALID [2022-04-15 15:12:20,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-15 15:12:20,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 50);havoc #t~post8; {1554#false} is VALID [2022-04-15 15:12:20,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-15 15:12:20,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 50);havoc #t~post6; {1554#false} is VALID [2022-04-15 15:12:20,267 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-15 15:12:20,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-15 15:12:20,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-15 15:12:20,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-15 15:12:20,267 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-15 15:12:20,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:12:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303773637] [2022-04-15 15:12:20,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594660665] [2022-04-15 15:12:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594660665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:20,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:20,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:12:20,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036479757] [2022-04-15 15:12:20,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036479757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:20,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:20,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:12:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908650642] [2022-04-15 15:12:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:20,270 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-15 15:12:20,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:20,270 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-15 15:12:20,293 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-15 15:12:20,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:12:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:12:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:12:20,294 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-15 15:12:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:20,427 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 15:12:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:12:20,428 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-15 15:12:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:20,429 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-15 15:12:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:12:20,433 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-15 15:12:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:12:20,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 15:12:20,492 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-15 15:12:20,494 INFO L225 Difference]: With dead ends: 97 [2022-04-15 15:12:20,494 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 15:12:20,494 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-15 15:12:20,495 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-15 15:12:20,495 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-15 15:12:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 15:12:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 15:12:20,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:20,523 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-15 15:12:20,524 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-15 15:12:20,524 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-15 15:12:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:20,526 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:12:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:12:20,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:20,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:20,527 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-15 15:12:20,527 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-15 15:12:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:20,530 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:12:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:12:20,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:20,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:20,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:20,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:20,531 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-15 15:12:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 15:12:20,533 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-15 15:12:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:20,533 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-15 15:12:20,533 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-15 15:12:20,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 15:12:20,921 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-15 15:12:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:12:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 15:12:20,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:20,922 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-15 15:12:20,935 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-15 15:12:21,123 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-15 15:12:21,123 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 15:12:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397562371] [2022-04-15 15:12:21,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 15:12:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775337810] [2022-04-15 15:12:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:21,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:21,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342072018] [2022-04-15 15:12:21,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:21,153 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-15 15:12:21,174 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-15 15:12:21,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:21,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:21,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:12:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:21,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:21,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:12:21,451 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-15 15:12:21,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,453 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-15 15:12:21,453 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-15 15:12:21,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,455 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-15 15:12:21,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,458 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-15 15:12:21,459 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-15 15:12:21,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,460 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-15 15:12:21,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,463 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-15 15:12:21,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,471 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-15 15:12:21,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,474 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-15 15:12:21,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:12:21,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:12:21,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:12:21,479 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-15 15:12:21,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:12:21,479 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:12:21,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:12:21,479 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-15 15:12:21,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:21,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:12:21,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:12:21,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:12:21,704 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-15 15:12:21,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:12:21,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:12:21,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:12:21,705 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:12:21,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 50)} assume !(~r~0 > 0); {2247#(< ~counter~0 50)} is VALID [2022-04-15 15:12:21,706 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 50)} #96#return; {2247#(< ~counter~0 50)} is VALID [2022-04-15 15:12:21,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:12:21,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:12:21,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:12:21,707 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:21,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-15 15:12:21,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-15 15:12:21,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 49)} assume !!(0 != ~r~0); {2272#(< ~counter~0 49)} is VALID [2022-04-15 15:12:21,709 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 49)} #94#return; {2272#(< ~counter~0 49)} is VALID [2022-04-15 15:12:21,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:12:21,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:12:21,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:12:21,710 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:21,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-15 15:12:21,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-15 15:12:21,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #92#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:12:21,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:12:21,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:12:21,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~counter~0 48)} call assume_abort_if_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-15 15:12:21,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #90#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:12:21,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:12:21,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:12:21,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:12:21,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~counter~0 48)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 48)} is VALID [2022-04-15 15:12:21,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 48)} call #t~ret9 := main(); {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 48)} {2096#true} #102#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 48)} assume true; {2297#(< ~counter~0 48)} is VALID [2022-04-15 15:12:21,716 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 48)} is VALID [2022-04-15 15:12:21,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:12:21,716 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-15 15:12:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775337810] [2022-04-15 15:12:21,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342072018] [2022-04-15 15:12:21,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342072018] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:12:21,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:12:21,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 15:12:21,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397562371] [2022-04-15 15:12:21,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397562371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:21,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:21,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:12:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092698634] [2022-04-15 15:12:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:21,718 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-15 15:12:21,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:21,719 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-15 15:12:21,747 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-15 15:12:21,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:12:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:21,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:12:21,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:12:21,748 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-15 15:12:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:21,940 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-15 15:12:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:12:21,941 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-15 15:12:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:21,942 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-15 15:12:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:12:21,945 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-15 15:12:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:12:21,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 15:12:22,024 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-15 15:12:22,025 INFO L225 Difference]: With dead ends: 106 [2022-04-15 15:12:22,026 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 15:12:22,026 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-15 15:12:22,027 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-15 15:12:22,027 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-15 15:12:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 15:12:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 15:12:22,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:22,074 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-15 15:12:22,074 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-15 15:12:22,074 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-15 15:12:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:22,077 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:12:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:12:22,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:22,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:22,077 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-15 15:12:22,078 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-15 15:12:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:22,080 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:12:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:12:22,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:22,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:22,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:22,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:22,081 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-15 15:12:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 15:12:22,083 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-15 15:12:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:22,084 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 15:12:22,084 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-15 15:12:22,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-15 15:12:24,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 15:12:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 15:12:24,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:24,192 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-15 15:12:24,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:24,392 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-15 15:12:24,392 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 15:12:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876429547] [2022-04-15 15:12:24,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 15:12:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646834944] [2022-04-15 15:12:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:24,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:24,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547487325] [2022-04-15 15:12:24,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:24,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:24,419 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-15 15:12:24,420 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-15 15:12:24,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:24,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:12:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:24,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:24,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:12:24,676 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-15 15:12:24,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,678 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-15 15:12:24,682 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-15 15:12:24,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,694 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-15 15:12:24,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,699 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:24,700 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-15 15:12:24,700 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-15 15:12:24,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,701 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-15 15:12:24,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,703 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:24,704 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-15 15:12:24,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:24,705 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-15 15:12:24,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:24,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:24,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:24,707 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:24,707 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-15 15:12:24,707 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-15 15:12:24,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:12:24,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:12:24,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:12:24,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:12:24,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:12:24,708 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-15 15:12:24,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:12:24,709 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:12:24,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:12:24,709 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-15 15:12:24,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:24,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:12:24,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:12:24,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:12:24,952 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-15 15:12:24,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:12:24,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:12:24,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:12:24,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:12:24,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:12:24,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:12:24,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 50)} is VALID [2022-04-15 15:12:24,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 50)} #96#return; {3000#(< ~counter~0 50)} is VALID [2022-04-15 15:12:24,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:12:24,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:12:24,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:12:24,955 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:24,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-15 15:12:24,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-15 15:12:24,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 49)} assume !!(0 != ~r~0); {3025#(< ~counter~0 49)} is VALID [2022-04-15 15:12:24,957 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 49)} #94#return; {3025#(< ~counter~0 49)} is VALID [2022-04-15 15:12:24,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:12:24,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:12:24,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:12:24,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:24,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-15 15:12:24,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-15 15:12:24,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,960 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #92#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:12:24,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:12:24,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:12:24,960 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~counter~0 48)} call assume_abort_if_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-15 15:12:24,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #90#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:12:24,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:12:24,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:12:24,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:12:24,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~counter~0 48)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 48)} is VALID [2022-04-15 15:12:24,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 48)} call #t~ret9 := main(); {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 48)} {2837#true} #102#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 48)} assume true; {3050#(< ~counter~0 48)} is VALID [2022-04-15 15:12:24,964 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 48)} is VALID [2022-04-15 15:12:24,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:12:24,964 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-15 15:12:24,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646834944] [2022-04-15 15:12:24,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547487325] [2022-04-15 15:12:24,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547487325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:24,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:24,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:12:24,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876429547] [2022-04-15 15:12:24,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876429547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:24,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:24,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:12:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367421156] [2022-04-15 15:12:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:24,966 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-15 15:12:24,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:24,967 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-15 15:12:25,002 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-15 15:12:25,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:12:25,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:12:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:12:25,004 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-15 15:12:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:25,196 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-15 15:12:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:12:25,197 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-15 15:12:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:25,197 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-15 15:12:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:12:25,199 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-15 15:12:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:12:25,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 15:12:25,268 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-15 15:12:25,269 INFO L225 Difference]: With dead ends: 91 [2022-04-15 15:12:25,270 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 15:12:25,270 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-15 15:12:25,271 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-15 15:12:25,271 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-15 15:12:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 15:12:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 15:12:25,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:25,329 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-15 15:12:25,330 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-15 15:12:25,330 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-15 15:12:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:25,332 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:12:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:12:25,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:25,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:25,334 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-15 15:12:25,334 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-15 15:12:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:25,338 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:12:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:12:25,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:25,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:25,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:25,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:25,338 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-15 15:12:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-15 15:12:25,341 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-15 15:12:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:25,341 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-15 15:12:25,341 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-15 15:12:25,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-15 15:12:27,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:12:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:12:27,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:27,439 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-15 15:12:27,457 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-15 15:12:27,643 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-15 15:12:27,643 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 15:12:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:27,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326263225] [2022-04-15 15:12:27,644 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 15:12:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:27,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808610748] [2022-04-15 15:12:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:27,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:27,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319586580] [2022-04-15 15:12:27,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:27,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:27,659 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-15 15:12:27,660 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-15 15:12:27,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:27,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:27,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:12:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:27,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:27,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-15 15:12:27,876 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-15 15:12:27,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-15 15:12:27,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-15 15:12:27,877 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-15 15:12:27,877 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-15 15:12:27,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:12:27,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:12:27,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-15 15:12:27,877 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-15 15:12:27,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:12:27,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-15 15:12:27,878 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-15 15:12:27,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 50);havoc #t~post6; {3568#true} is VALID [2022-04-15 15:12:27,878 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-15 15:12:27,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,878 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-15 15:12:27,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:12:27,879 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-15 15:12:27,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:12:27,880 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-15 15:12:27,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:12:27,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:12:27,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,881 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-15 15:12:27,881 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-15 15:12:27,881 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-15 15:12:27,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:12:27,887 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-15 15:12:27,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:12:27,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:12:27,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:12:27,889 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-15 15:12:27,889 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-15 15:12:27,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-15 15:12:27,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 50);havoc #t~post6; {3569#false} is VALID [2022-04-15 15:12:27,890 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-15 15:12:27,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-15 15:12:27,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-15 15:12:27,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-15 15:12:27,890 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-15 15:12:27,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:12:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808610748] [2022-04-15 15:12:27,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319586580] [2022-04-15 15:12:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319586580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:27,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:27,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326263225] [2022-04-15 15:12:27,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326263225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:27,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:27,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300654132] [2022-04-15 15:12:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:27,893 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-15 15:12:27,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:27,895 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-15 15:12:27,921 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-15 15:12:27,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:12:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:12:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:12:27,923 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-15 15:12:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:28,110 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2022-04-15 15:12:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:12:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:12:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:28,110 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-15 15:12:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:12:28,112 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-15 15:12:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:12:28,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 15:12:28,200 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-15 15:12:28,203 INFO L225 Difference]: With dead ends: 119 [2022-04-15 15:12:28,203 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 15:12:28,204 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-15 15:12:28,204 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-15 15:12:28,204 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-15 15:12:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 15:12:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-04-15 15:12:28,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:28,277 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-15 15:12:28,278 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-15 15:12:28,278 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-15 15:12:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:28,281 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 15:12:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 15:12:28,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:28,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:28,282 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-15 15:12:28,282 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-15 15:12:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:28,286 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 15:12:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 15:12:28,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:28,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:28,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:28,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:28,287 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-15 15:12:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-15 15:12:28,290 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-15 15:12:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:28,290 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-15 15:12:28,291 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-15 15:12:28,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-15 15:12:30,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-15 15:12:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 15:12:30,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:30,387 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-15 15:12:30,403 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-15 15:12:30,591 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-15 15:12:30,591 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 15:12:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:30,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564176734] [2022-04-15 15:12:30,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 15:12:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261572204] [2022-04-15 15:12:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:30,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:30,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638897609] [2022-04-15 15:12:30,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:30,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:30,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:30,650 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-15 15:12:30,651 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-15 15:12:30,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:30,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:30,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:12:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:30,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:30,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4254#true} is VALID [2022-04-15 15:12:30,952 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-15 15:12:30,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4262#(<= ~counter~0 0)} {4254#true} #102#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {4262#(<= ~counter~0 0)} call #t~ret9 := main(); {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,956 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-15 15:12:30,957 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-15 15:12:30,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {4262#(<= ~counter~0 0)} ~cond := #in~cond; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {4262#(<= ~counter~0 0)} assume !(0 == ~cond); {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4262#(<= ~counter~0 0)} {4262#(<= ~counter~0 0)} #90#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,960 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-15 15:12:30,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {4262#(<= ~counter~0 0)} ~cond := #in~cond; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {4262#(<= ~counter~0 0)} assume !(0 == ~cond); {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {4262#(<= ~counter~0 0)} assume true; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,962 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4262#(<= ~counter~0 0)} {4262#(<= ~counter~0 0)} #92#return; {4262#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:30,962 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-15 15:12:30,963 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-15 15:12:30,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {4311#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,964 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-15 15:12:30,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {4311#(<= ~counter~0 1)} ~cond := #in~cond; {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {4311#(<= ~counter~0 1)} assume !(0 == ~cond); {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {4311#(<= ~counter~0 1)} assume true; {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,965 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4311#(<= ~counter~0 1)} {4311#(<= ~counter~0 1)} #94#return; {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {4311#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4311#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:30,966 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-15 15:12:30,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {4336#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,967 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-15 15:12:30,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {4336#(<= ~counter~0 2)} ~cond := #in~cond; {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {4336#(<= ~counter~0 2)} assume !(0 == ~cond); {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {4336#(<= ~counter~0 2)} assume true; {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,969 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4336#(<= ~counter~0 2)} {4336#(<= ~counter~0 2)} #96#return; {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {4336#(<= ~counter~0 2)} assume !(~r~0 > 0); {4336#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:30,970 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-15 15:12:30,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {4361#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {4361#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:30,971 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-15 15:12:30,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {4361#(<= ~counter~0 3)} ~cond := #in~cond; {4361#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:30,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {4361#(<= ~counter~0 3)} assume !(0 == ~cond); {4361#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:30,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {4361#(<= ~counter~0 3)} assume true; {4361#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:30,973 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4361#(<= ~counter~0 3)} {4361#(<= ~counter~0 3)} #98#return; {4361#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:30,973 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-15 15:12:30,974 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-15 15:12:30,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {4386#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {4255#false} is VALID [2022-04-15 15:12:30,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {4255#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4255#false} is VALID [2022-04-15 15:12:30,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {4255#false} assume !(#t~post6 < 50);havoc #t~post6; {4255#false} is VALID [2022-04-15 15:12:30,975 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-15 15:12:30,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {4255#false} ~cond := #in~cond; {4255#false} is VALID [2022-04-15 15:12:30,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {4255#false} assume 0 == ~cond; {4255#false} is VALID [2022-04-15 15:12:30,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-15 15:12:30,975 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-15 15:12:30,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:31,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-04-15 15:12:31,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {4255#false} assume 0 == ~cond; {4255#false} is VALID [2022-04-15 15:12:31,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {4255#false} ~cond := #in~cond; {4255#false} is VALID [2022-04-15 15:12:31,245 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-15 15:12:31,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {4255#false} assume !(#t~post6 < 50);havoc #t~post6; {4255#false} is VALID [2022-04-15 15:12:31,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {4255#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4255#false} is VALID [2022-04-15 15:12:31,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {4426#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {4255#false} is VALID [2022-04-15 15:12:31,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {4430#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4426#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:12:31,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {4430#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4430#(< ~counter~0 50)} is VALID [2022-04-15 15:12:31,247 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4254#true} {4430#(< ~counter~0 50)} #98#return; {4430#(< ~counter~0 50)} is VALID [2022-04-15 15:12:31,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 15:12:31,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-15 15:12:31,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-15 15:12:31,248 INFO L272 TraceCheckUtils]: 35: Hoare triple {4430#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:31,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {4430#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {4430#(< ~counter~0 50)} is VALID [2022-04-15 15:12:31,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {4455#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4430#(< ~counter~0 50)} is VALID [2022-04-15 15:12:31,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {4455#(< ~counter~0 49)} assume !(~r~0 > 0); {4455#(< ~counter~0 49)} is VALID [2022-04-15 15:12:31,249 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4254#true} {4455#(< ~counter~0 49)} #96#return; {4455#(< ~counter~0 49)} is VALID [2022-04-15 15:12:31,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 15:12:31,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-15 15:12:31,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-15 15:12:31,250 INFO L272 TraceCheckUtils]: 27: Hoare triple {4455#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:31,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {4455#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4455#(< ~counter~0 49)} is VALID [2022-04-15 15:12:31,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {4480#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4455#(< ~counter~0 49)} is VALID [2022-04-15 15:12:31,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {4480#(< ~counter~0 48)} assume !!(0 != ~r~0); {4480#(< ~counter~0 48)} is VALID [2022-04-15 15:12:31,251 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4254#true} {4480#(< ~counter~0 48)} #94#return; {4480#(< ~counter~0 48)} is VALID [2022-04-15 15:12:31,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 15:12:31,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-15 15:12:31,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-15 15:12:31,251 INFO L272 TraceCheckUtils]: 19: Hoare triple {4480#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:31,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {4480#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4480#(< ~counter~0 48)} is VALID [2022-04-15 15:12:31,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {4505#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4480#(< ~counter~0 48)} is VALID [2022-04-15 15:12:31,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {4505#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4254#true} {4505#(< ~counter~0 47)} #92#return; {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 15:12:31,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-15 15:12:31,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-15 15:12:31,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {4505#(< ~counter~0 47)} call assume_abort_if_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-15 15:12:31,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4254#true} {4505#(< ~counter~0 47)} #90#return; {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {4254#true} assume true; {4254#true} is VALID [2022-04-15 15:12:31,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {4254#true} assume !(0 == ~cond); {4254#true} is VALID [2022-04-15 15:12:31,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {4254#true} ~cond := #in~cond; {4254#true} is VALID [2022-04-15 15:12:31,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {4505#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4254#true} is VALID [2022-04-15 15:12:31,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {4505#(< ~counter~0 47)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 47)} is VALID [2022-04-15 15:12:31,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {4505#(< ~counter~0 47)} call #t~ret9 := main(); {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4505#(< ~counter~0 47)} {4254#true} #102#return; {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {4505#(< ~counter~0 47)} assume true; {4505#(< ~counter~0 47)} is VALID [2022-04-15 15:12:31,260 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 47)} is VALID [2022-04-15 15:12:31,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {4254#true} call ULTIMATE.init(); {4254#true} is VALID [2022-04-15 15:12:31,260 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-15 15:12:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261572204] [2022-04-15 15:12:31,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638897609] [2022-04-15 15:12:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638897609] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:31,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:12:31,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564176734] [2022-04-15 15:12:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564176734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:12:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315280360] [2022-04-15 15:12:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:31,262 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-15 15:12:31,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:31,262 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-15 15:12:31,305 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-15 15:12:31,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:12:31,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:12:31,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:12:31,306 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-15 15:12:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:31,555 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-15 15:12:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:12:31,555 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-15 15:12:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:31,557 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-15 15:12:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:12:31,559 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-15 15:12:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:12:31,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 15:12:31,648 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-15 15:12:31,649 INFO L225 Difference]: With dead ends: 118 [2022-04-15 15:12:31,649 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 15:12:31,650 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-15 15:12:31,650 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-15 15:12:31,651 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-15 15:12:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 15:12:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 15:12:31,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:31,728 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-15 15:12:31,728 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-15 15:12:31,728 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-15 15:12:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:31,731 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 15:12:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 15:12:31,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:31,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:31,732 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-15 15:12:31,732 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-15 15:12:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:31,734 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 15:12:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 15:12:31,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:31,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:31,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:31,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:31,735 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-15 15:12:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-15 15:12:31,737 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-15 15:12:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:31,738 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-15 15:12:31,738 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-15 15:12:31,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-15 15:12:32,573 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-15 15:12:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-15 15:12:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 15:12:32,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:32,574 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-15 15:12:32,594 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-15 15:12:32,783 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-15 15:12:32,783 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 15:12:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436338924] [2022-04-15 15:12:32,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 15:12:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:32,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291503567] [2022-04-15 15:12:32,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:32,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:32,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [181543375] [2022-04-15 15:12:32,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:32,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:32,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:32,798 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-15 15:12:32,800 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-15 15:12:32,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:32,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:32,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:12:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:32,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:33,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {5119#true} call ULTIMATE.init(); {5119#true} is VALID [2022-04-15 15:12:33,146 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-15 15:12:33,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5127#(<= ~counter~0 0)} {5119#true} #102#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {5127#(<= ~counter~0 0)} call #t~ret9 := main(); {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,147 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-15 15:12:33,148 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-15 15:12:33,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {5127#(<= ~counter~0 0)} ~cond := #in~cond; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {5127#(<= ~counter~0 0)} assume !(0 == ~cond); {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5127#(<= ~counter~0 0)} {5127#(<= ~counter~0 0)} #90#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,149 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-15 15:12:33,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {5127#(<= ~counter~0 0)} ~cond := #in~cond; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {5127#(<= ~counter~0 0)} assume !(0 == ~cond); {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {5127#(<= ~counter~0 0)} assume true; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5127#(<= ~counter~0 0)} {5127#(<= ~counter~0 0)} #92#return; {5127#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:33,151 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-15 15:12:33,151 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-15 15:12:33,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {5176#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,152 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-15 15:12:33,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {5176#(<= ~counter~0 1)} ~cond := #in~cond; {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {5176#(<= ~counter~0 1)} assume !(0 == ~cond); {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {5176#(<= ~counter~0 1)} assume true; {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,154 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5176#(<= ~counter~0 1)} {5176#(<= ~counter~0 1)} #94#return; {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {5176#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5176#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:33,154 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-15 15:12:33,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {5201#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {5201#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,155 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-15 15:12:33,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {5201#(<= ~counter~0 2)} ~cond := #in~cond; {5201#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {5201#(<= ~counter~0 2)} assume !(0 == ~cond); {5201#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {5201#(<= ~counter~0 2)} assume true; {5201#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,157 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5201#(<= ~counter~0 2)} {5201#(<= ~counter~0 2)} #96#return; {5201#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:33,157 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-15 15:12:33,157 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-15 15:12:33,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {5226#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {5226#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,170 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-15 15:12:33,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {5226#(<= ~counter~0 3)} ~cond := #in~cond; {5226#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {5226#(<= ~counter~0 3)} assume !(0 == ~cond); {5226#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {5226#(<= ~counter~0 3)} assume true; {5226#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,173 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5226#(<= ~counter~0 3)} {5226#(<= ~counter~0 3)} #96#return; {5226#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:33,173 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-15 15:12:33,174 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-15 15:12:33,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {5251#(<= |main_#t~post7| 3)} assume !(#t~post7 < 50);havoc #t~post7; {5120#false} is VALID [2022-04-15 15:12:33,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {5120#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5120#false} is VALID [2022-04-15 15:12:33,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {5120#false} assume !(#t~post8 < 50);havoc #t~post8; {5120#false} is VALID [2022-04-15 15:12:33,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {5120#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5120#false} is VALID [2022-04-15 15:12:33,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {5120#false} assume !(#t~post6 < 50);havoc #t~post6; {5120#false} is VALID [2022-04-15 15:12:33,174 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-15 15:12:33,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {5120#false} ~cond := #in~cond; {5120#false} is VALID [2022-04-15 15:12:33,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {5120#false} assume 0 == ~cond; {5120#false} is VALID [2022-04-15 15:12:33,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {5120#false} assume !false; {5120#false} is VALID [2022-04-15 15:12:33,175 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-15 15:12:33,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:33,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {5120#false} assume !false; {5120#false} is VALID [2022-04-15 15:12:33,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {5120#false} assume 0 == ~cond; {5120#false} is VALID [2022-04-15 15:12:33,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {5120#false} ~cond := #in~cond; {5120#false} is VALID [2022-04-15 15:12:33,433 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-15 15:12:33,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {5120#false} assume !(#t~post6 < 50);havoc #t~post6; {5120#false} is VALID [2022-04-15 15:12:33,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {5120#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5120#false} is VALID [2022-04-15 15:12:33,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {5120#false} assume !(#t~post8 < 50);havoc #t~post8; {5120#false} is VALID [2022-04-15 15:12:33,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {5120#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5120#false} is VALID [2022-04-15 15:12:33,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {5303#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {5120#false} is VALID [2022-04-15 15:12:33,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {5307#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5303#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:12:33,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {5307#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5307#(< ~counter~0 50)} is VALID [2022-04-15 15:12:33,436 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5119#true} {5307#(< ~counter~0 50)} #96#return; {5307#(< ~counter~0 50)} is VALID [2022-04-15 15:12:33,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-15 15:12:33,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-15 15:12:33,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-15 15:12:33,436 INFO L272 TraceCheckUtils]: 35: Hoare triple {5307#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:33,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {5307#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {5307#(< ~counter~0 50)} is VALID [2022-04-15 15:12:33,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {5332#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5307#(< ~counter~0 50)} is VALID [2022-04-15 15:12:33,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {5332#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5332#(< ~counter~0 49)} is VALID [2022-04-15 15:12:33,438 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5119#true} {5332#(< ~counter~0 49)} #96#return; {5332#(< ~counter~0 49)} is VALID [2022-04-15 15:12:33,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-15 15:12:33,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-15 15:12:33,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-15 15:12:33,439 INFO L272 TraceCheckUtils]: 27: Hoare triple {5332#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:33,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {5332#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {5332#(< ~counter~0 49)} is VALID [2022-04-15 15:12:33,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {5357#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5332#(< ~counter~0 49)} is VALID [2022-04-15 15:12:33,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {5357#(< ~counter~0 48)} assume !!(0 != ~r~0); {5357#(< ~counter~0 48)} is VALID [2022-04-15 15:12:33,441 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5119#true} {5357#(< ~counter~0 48)} #94#return; {5357#(< ~counter~0 48)} is VALID [2022-04-15 15:12:33,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-15 15:12:33,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-15 15:12:33,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-15 15:12:33,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {5357#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:33,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {5357#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {5357#(< ~counter~0 48)} is VALID [2022-04-15 15:12:33,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {5382#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5357#(< ~counter~0 48)} is VALID [2022-04-15 15:12:33,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {5382#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5119#true} {5382#(< ~counter~0 47)} #92#return; {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-15 15:12:33,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-15 15:12:33,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-15 15:12:33,444 INFO L272 TraceCheckUtils]: 11: Hoare triple {5382#(< ~counter~0 47)} call assume_abort_if_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-15 15:12:33,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5119#true} {5382#(< ~counter~0 47)} #90#return; {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {5119#true} assume true; {5119#true} is VALID [2022-04-15 15:12:33,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {5119#true} assume !(0 == ~cond); {5119#true} is VALID [2022-04-15 15:12:33,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {5119#true} ~cond := #in~cond; {5119#true} is VALID [2022-04-15 15:12:33,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {5382#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5119#true} is VALID [2022-04-15 15:12:33,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {5382#(< ~counter~0 47)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 47)} is VALID [2022-04-15 15:12:33,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {5382#(< ~counter~0 47)} call #t~ret9 := main(); {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5382#(< ~counter~0 47)} {5119#true} #102#return; {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {5382#(< ~counter~0 47)} assume true; {5382#(< ~counter~0 47)} is VALID [2022-04-15 15:12:33,447 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 47)} is VALID [2022-04-15 15:12:33,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {5119#true} call ULTIMATE.init(); {5119#true} is VALID [2022-04-15 15:12:33,447 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-15 15:12:33,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291503567] [2022-04-15 15:12:33,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181543375] [2022-04-15 15:12:33,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181543375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:33,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:33,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:12:33,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:33,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436338924] [2022-04-15 15:12:33,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436338924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:33,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:33,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:12:33,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169090750] [2022-04-15 15:12:33,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:33,449 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-15 15:12:33,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:33,450 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-15 15:12:33,489 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-15 15:12:33,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:12:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:12:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:12:33,489 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-15 15:12:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:33,708 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-15 15:12:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:12:33,709 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-15 15:12:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:33,709 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-15 15:12:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:12:33,711 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-15 15:12:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:12:33,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 15:12:33,797 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-15 15:12:33,799 INFO L225 Difference]: With dead ends: 119 [2022-04-15 15:12:33,799 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 15:12:33,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:33,800 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-15 15:12:33,800 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-15 15:12:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 15:12:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 15:12:33,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:33,881 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-15 15:12:33,881 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-15 15:12:33,881 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-15 15:12:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:33,883 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 15:12:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:12:33,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:33,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:33,884 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-15 15:12:33,884 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-15 15:12:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:33,886 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 15:12:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:12:33,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:33,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:33,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:33,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:33,887 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-15 15:12:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-15 15:12:33,889 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-15 15:12:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:33,890 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-15 15:12:33,890 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-15 15:12:33,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-15 15:12:34,981 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-15 15:12:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:12:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 15:12:34,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:34,984 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-15 15:12:35,002 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-15 15:12:35,191 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-15 15:12:35,191 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 15:12:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:35,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275578914] [2022-04-15 15:12:35,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 15:12:35,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:35,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880251158] [2022-04-15 15:12:35,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:35,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:35,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214970715] [2022-04-15 15:12:35,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:35,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:35,214 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-15 15:12:35,219 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-15 15:12:35,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:35,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:35,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:35,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:35,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-15 15:12:35,570 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-15 15:12:35,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6014#(<= ~counter~0 0)} {6006#true} #102#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {6014#(<= ~counter~0 0)} call #t~ret9 := main(); {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,571 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-15 15:12:35,572 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-15 15:12:35,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {6014#(<= ~counter~0 0)} ~cond := #in~cond; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {6014#(<= ~counter~0 0)} assume !(0 == ~cond); {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6014#(<= ~counter~0 0)} {6014#(<= ~counter~0 0)} #90#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,574 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-15 15:12:35,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {6014#(<= ~counter~0 0)} ~cond := #in~cond; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {6014#(<= ~counter~0 0)} assume !(0 == ~cond); {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {6014#(<= ~counter~0 0)} assume true; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,575 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6014#(<= ~counter~0 0)} {6014#(<= ~counter~0 0)} #92#return; {6014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,575 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-15 15:12:35,576 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-15 15:12:35,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {6063#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,577 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-15 15:12:35,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {6063#(<= ~counter~0 1)} ~cond := #in~cond; {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {6063#(<= ~counter~0 1)} assume !(0 == ~cond); {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {6063#(<= ~counter~0 1)} assume true; {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6063#(<= ~counter~0 1)} {6063#(<= ~counter~0 1)} #94#return; {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {6063#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,579 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-15 15:12:35,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {6088#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,580 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-15 15:12:35,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {6088#(<= ~counter~0 2)} ~cond := #in~cond; {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {6088#(<= ~counter~0 2)} assume !(0 == ~cond); {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {6088#(<= ~counter~0 2)} assume true; {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,581 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6088#(<= ~counter~0 2)} {6088#(<= ~counter~0 2)} #96#return; {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {6088#(<= ~counter~0 2)} assume !(~r~0 > 0); {6088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,582 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-15 15:12:35,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {6113#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {6113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,583 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-15 15:12:35,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {6113#(<= ~counter~0 3)} ~cond := #in~cond; {6113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {6113#(<= ~counter~0 3)} assume !(0 == ~cond); {6113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {6113#(<= ~counter~0 3)} assume true; {6113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,584 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6113#(<= ~counter~0 3)} {6113#(<= ~counter~0 3)} #98#return; {6113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,585 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-15 15:12:35,585 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-15 15:12:35,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {6138#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,586 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-15 15:12:35,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {6138#(<= ~counter~0 4)} ~cond := #in~cond; {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {6138#(<= ~counter~0 4)} assume !(0 == ~cond); {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {6138#(<= ~counter~0 4)} assume true; {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,587 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6138#(<= ~counter~0 4)} {6138#(<= ~counter~0 4)} #98#return; {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {6138#(<= ~counter~0 4)} assume !(~r~0 < 0); {6138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,588 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-15 15:12:35,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {6163#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {6007#false} is VALID [2022-04-15 15:12:35,589 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-15 15:12:35,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2022-04-15 15:12:35,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#false} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 15:12:35,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 15:12:35,589 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-15 15:12:35,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:35,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 15:12:35,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {6007#false} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 15:12:35,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2022-04-15 15:12:35,891 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-15 15:12:35,892 INFO L290 TraceCheckUtils]: 50: Hoare triple {6191#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {6007#false} is VALID [2022-04-15 15:12:35,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {6195#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6191#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:12:35,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {6195#(< ~counter~0 50)} assume !(~r~0 < 0); {6195#(< ~counter~0 50)} is VALID [2022-04-15 15:12:35,893 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6006#true} {6195#(< ~counter~0 50)} #98#return; {6195#(< ~counter~0 50)} is VALID [2022-04-15 15:12:35,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,893 INFO L272 TraceCheckUtils]: 43: Hoare triple {6195#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:35,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {6195#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {6195#(< ~counter~0 50)} is VALID [2022-04-15 15:12:35,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {6220#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6195#(< ~counter~0 50)} is VALID [2022-04-15 15:12:35,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {6220#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6220#(< ~counter~0 49)} is VALID [2022-04-15 15:12:35,895 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6006#true} {6220#(< ~counter~0 49)} #98#return; {6220#(< ~counter~0 49)} is VALID [2022-04-15 15:12:35,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,895 INFO L272 TraceCheckUtils]: 35: Hoare triple {6220#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:35,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {6220#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {6220#(< ~counter~0 49)} is VALID [2022-04-15 15:12:35,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {6245#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6220#(< ~counter~0 49)} is VALID [2022-04-15 15:12:35,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {6245#(< ~counter~0 48)} assume !(~r~0 > 0); {6245#(< ~counter~0 48)} is VALID [2022-04-15 15:12:35,917 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6006#true} {6245#(< ~counter~0 48)} #96#return; {6245#(< ~counter~0 48)} is VALID [2022-04-15 15:12:35,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,918 INFO L272 TraceCheckUtils]: 27: Hoare triple {6245#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:35,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {6245#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {6245#(< ~counter~0 48)} is VALID [2022-04-15 15:12:35,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {6270#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6245#(< ~counter~0 48)} is VALID [2022-04-15 15:12:35,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {6270#(< ~counter~0 47)} assume !!(0 != ~r~0); {6270#(< ~counter~0 47)} is VALID [2022-04-15 15:12:35,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6006#true} {6270#(< ~counter~0 47)} #94#return; {6270#(< ~counter~0 47)} is VALID [2022-04-15 15:12:35,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,921 INFO L272 TraceCheckUtils]: 19: Hoare triple {6270#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:35,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {6270#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {6270#(< ~counter~0 47)} is VALID [2022-04-15 15:12:35,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {6295#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6270#(< ~counter~0 47)} is VALID [2022-04-15 15:12:35,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {6295#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6006#true} {6295#(< ~counter~0 46)} #92#return; {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {6295#(< ~counter~0 46)} call assume_abort_if_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-15 15:12:35,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6006#true} {6295#(< ~counter~0 46)} #90#return; {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 15:12:35,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 15:12:35,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 15:12:35,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {6295#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6006#true} is VALID [2022-04-15 15:12:35,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {6295#(< ~counter~0 46)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 46)} is VALID [2022-04-15 15:12:35,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {6295#(< ~counter~0 46)} call #t~ret9 := main(); {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6295#(< ~counter~0 46)} {6006#true} #102#return; {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {6295#(< ~counter~0 46)} assume true; {6295#(< ~counter~0 46)} is VALID [2022-04-15 15:12:35,929 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 46)} is VALID [2022-04-15 15:12:35,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-15 15:12:35,930 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-15 15:12:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880251158] [2022-04-15 15:12:35,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214970715] [2022-04-15 15:12:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214970715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:35,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:35,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:35,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:35,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275578914] [2022-04-15 15:12:35,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275578914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:35,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:35,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122346613] [2022-04-15 15:12:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:35,932 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-15 15:12:35,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:35,932 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-15 15:12:35,972 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-15 15:12:35,972 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:35,973 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-15 15:12:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:36,330 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-15 15:12:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:12:36,330 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-15 15:12:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:36,330 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-15 15:12:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:12:36,332 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-15 15:12:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:12:36,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 15:12:36,404 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-15 15:12:36,405 INFO L225 Difference]: With dead ends: 99 [2022-04-15 15:12:36,405 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 15:12:36,406 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-15 15:12:36,406 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-15 15:12:36,407 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-15 15:12:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 15:12:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 15:12:36,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:36,484 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-15 15:12:36,484 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-15 15:12:36,485 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-15 15:12:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:36,487 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 15:12:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:12:36,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:36,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:36,488 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-15 15:12:36,488 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-15 15:12:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:36,490 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 15:12:36,490 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:12:36,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:36,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:36,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:36,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:36,491 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-15 15:12:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-15 15:12:36,493 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-15 15:12:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:36,493 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-15 15:12:36,494 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-15 15:12:36,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-15 15:12:38,425 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-15 15:12:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-15 15:12:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 15:12:38,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:38,426 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-15 15:12:38,442 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-15 15:12:38,627 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-15 15:12:38,627 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 15:12:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:38,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652009792] [2022-04-15 15:12:38,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 15:12:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:38,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754669104] [2022-04-15 15:12:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:38,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:38,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274365878] [2022-04-15 15:12:38,639 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:38,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:38,640 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-15 15:12:38,645 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-15 15:12:38,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:38,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:38,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:38,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:38,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {6919#true} call ULTIMATE.init(); {6919#true} is VALID [2022-04-15 15:12:38,969 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-15 15:12:38,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6927#(<= ~counter~0 0)} {6919#true} #102#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {6927#(<= ~counter~0 0)} call #t~ret9 := main(); {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,970 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-15 15:12:38,971 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-15 15:12:38,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {6927#(<= ~counter~0 0)} ~cond := #in~cond; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {6927#(<= ~counter~0 0)} assume !(0 == ~cond); {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6927#(<= ~counter~0 0)} {6927#(<= ~counter~0 0)} #90#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,973 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-15 15:12:38,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {6927#(<= ~counter~0 0)} ~cond := #in~cond; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {6927#(<= ~counter~0 0)} assume !(0 == ~cond); {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {6927#(<= ~counter~0 0)} assume true; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,975 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6927#(<= ~counter~0 0)} {6927#(<= ~counter~0 0)} #92#return; {6927#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:38,975 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-15 15:12:38,976 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-15 15:12:38,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {6976#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,976 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-15 15:12:38,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {6976#(<= ~counter~0 1)} ~cond := #in~cond; {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {6976#(<= ~counter~0 1)} assume !(0 == ~cond); {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {6976#(<= ~counter~0 1)} assume true; {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,978 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6976#(<= ~counter~0 1)} {6976#(<= ~counter~0 1)} #94#return; {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {6976#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6976#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:38,979 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-15 15:12:38,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {7001#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,979 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-15 15:12:38,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {7001#(<= ~counter~0 2)} ~cond := #in~cond; {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {7001#(<= ~counter~0 2)} assume !(0 == ~cond); {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {7001#(<= ~counter~0 2)} assume true; {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,981 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7001#(<= ~counter~0 2)} {7001#(<= ~counter~0 2)} #96#return; {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {7001#(<= ~counter~0 2)} assume !(~r~0 > 0); {7001#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:38,981 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-15 15:12:38,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {7026#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {7026#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:38,982 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-15 15:12:38,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {7026#(<= ~counter~0 3)} ~cond := #in~cond; {7026#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:38,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {7026#(<= ~counter~0 3)} assume !(0 == ~cond); {7026#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:38,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {7026#(<= ~counter~0 3)} assume true; {7026#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:38,984 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7026#(<= ~counter~0 3)} {7026#(<= ~counter~0 3)} #98#return; {7026#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:38,984 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-15 15:12:38,984 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-15 15:12:38,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {7051#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {7051#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:38,985 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-15 15:12:38,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {7051#(<= ~counter~0 4)} ~cond := #in~cond; {7051#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:38,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {7051#(<= ~counter~0 4)} assume !(0 == ~cond); {7051#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:38,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {7051#(<= ~counter~0 4)} assume true; {7051#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:38,987 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7051#(<= ~counter~0 4)} {7051#(<= ~counter~0 4)} #98#return; {7051#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:38,987 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-15 15:12:38,987 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-15 15:12:38,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {7076#(<= |main_#t~post8| 4)} assume !(#t~post8 < 50);havoc #t~post8; {6920#false} is VALID [2022-04-15 15:12:38,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {6920#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6920#false} is VALID [2022-04-15 15:12:38,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {6920#false} assume !(#t~post6 < 50);havoc #t~post6; {6920#false} is VALID [2022-04-15 15:12:38,988 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-15 15:12:38,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {6920#false} ~cond := #in~cond; {6920#false} is VALID [2022-04-15 15:12:38,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {6920#false} assume 0 == ~cond; {6920#false} is VALID [2022-04-15 15:12:38,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {6920#false} assume !false; {6920#false} is VALID [2022-04-15 15:12:38,988 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-15 15:12:38,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:39,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {6920#false} assume !false; {6920#false} is VALID [2022-04-15 15:12:39,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {6920#false} assume 0 == ~cond; {6920#false} is VALID [2022-04-15 15:12:39,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {6920#false} ~cond := #in~cond; {6920#false} is VALID [2022-04-15 15:12:39,280 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-15 15:12:39,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {6920#false} assume !(#t~post6 < 50);havoc #t~post6; {6920#false} is VALID [2022-04-15 15:12:39,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {6920#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6920#false} is VALID [2022-04-15 15:12:39,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {7116#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {6920#false} is VALID [2022-04-15 15:12:39,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {7120#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7116#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:12:39,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {7120#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7120#(< ~counter~0 50)} is VALID [2022-04-15 15:12:39,282 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6919#true} {7120#(< ~counter~0 50)} #98#return; {7120#(< ~counter~0 50)} is VALID [2022-04-15 15:12:39,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,283 INFO L272 TraceCheckUtils]: 43: Hoare triple {7120#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:39,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {7120#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {7120#(< ~counter~0 50)} is VALID [2022-04-15 15:12:39,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {7145#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7120#(< ~counter~0 50)} is VALID [2022-04-15 15:12:39,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {7145#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7145#(< ~counter~0 49)} is VALID [2022-04-15 15:12:39,285 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6919#true} {7145#(< ~counter~0 49)} #98#return; {7145#(< ~counter~0 49)} is VALID [2022-04-15 15:12:39,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,285 INFO L272 TraceCheckUtils]: 35: Hoare triple {7145#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:39,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {7145#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {7145#(< ~counter~0 49)} is VALID [2022-04-15 15:12:39,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {7170#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7145#(< ~counter~0 49)} is VALID [2022-04-15 15:12:39,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {7170#(< ~counter~0 48)} assume !(~r~0 > 0); {7170#(< ~counter~0 48)} is VALID [2022-04-15 15:12:39,288 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6919#true} {7170#(< ~counter~0 48)} #96#return; {7170#(< ~counter~0 48)} is VALID [2022-04-15 15:12:39,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,288 INFO L272 TraceCheckUtils]: 27: Hoare triple {7170#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:39,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {7170#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {7170#(< ~counter~0 48)} is VALID [2022-04-15 15:12:39,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {7195#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7170#(< ~counter~0 48)} is VALID [2022-04-15 15:12:39,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {7195#(< ~counter~0 47)} assume !!(0 != ~r~0); {7195#(< ~counter~0 47)} is VALID [2022-04-15 15:12:39,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6919#true} {7195#(< ~counter~0 47)} #94#return; {7195#(< ~counter~0 47)} is VALID [2022-04-15 15:12:39,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {7195#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:39,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {7195#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {7195#(< ~counter~0 47)} is VALID [2022-04-15 15:12:39,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {7220#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7195#(< ~counter~0 47)} is VALID [2022-04-15 15:12:39,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {7220#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6919#true} {7220#(< ~counter~0 46)} #92#return; {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {7220#(< ~counter~0 46)} call assume_abort_if_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-15 15:12:39,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6919#true} {7220#(< ~counter~0 46)} #90#return; {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {6919#true} assume true; {6919#true} is VALID [2022-04-15 15:12:39,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {6919#true} assume !(0 == ~cond); {6919#true} is VALID [2022-04-15 15:12:39,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {6919#true} ~cond := #in~cond; {6919#true} is VALID [2022-04-15 15:12:39,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {7220#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6919#true} is VALID [2022-04-15 15:12:39,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {7220#(< ~counter~0 46)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 46)} is VALID [2022-04-15 15:12:39,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {7220#(< ~counter~0 46)} call #t~ret9 := main(); {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7220#(< ~counter~0 46)} {6919#true} #102#return; {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {7220#(< ~counter~0 46)} assume true; {7220#(< ~counter~0 46)} is VALID [2022-04-15 15:12:39,296 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 46)} is VALID [2022-04-15 15:12:39,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {6919#true} call ULTIMATE.init(); {6919#true} is VALID [2022-04-15 15:12:39,296 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-15 15:12:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754669104] [2022-04-15 15:12:39,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274365878] [2022-04-15 15:12:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274365878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:39,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:39,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:39,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:39,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652009792] [2022-04-15 15:12:39,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652009792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:39,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:39,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:39,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300531405] [2022-04-15 15:12:39,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:39,298 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-15 15:12:39,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:39,299 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-15 15:12:39,368 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-15 15:12:39,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:39,369 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-15 15:12:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:39,659 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-15 15:12:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 15:12:39,659 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-15 15:12:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:39,660 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-15 15:12:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:39,661 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-15 15:12:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:39,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 15:12:39,748 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-15 15:12:39,750 INFO L225 Difference]: With dead ends: 132 [2022-04-15 15:12:39,750 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 15:12:39,750 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-15 15:12:39,751 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:39,751 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.0s Time] [2022-04-15 15:12:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 15:12:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 15:12:39,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:39,836 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-15 15:12:39,836 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-15 15:12:39,837 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-15 15:12:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:39,839 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 15:12:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 15:12:39,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:39,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:39,840 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-15 15:12:39,840 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-15 15:12:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:39,842 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 15:12:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 15:12:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:39,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:39,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:39,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:39,843 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-15 15:12:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-15 15:12:39,845 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-15 15:12:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:39,845 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-15 15:12:39,845 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-15 15:12:39,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-15 15:12:40,837 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-15 15:12:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:12:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 15:12:40,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:40,838 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-15 15:12:40,855 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-15 15:12:41,038 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-15 15:12:41,038 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 15:12:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:41,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558880278] [2022-04-15 15:12:41,039 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 15:12:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:41,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661406272] [2022-04-15 15:12:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:41,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:41,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623673827] [2022-04-15 15:12:41,066 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:41,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:41,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:41,067 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-15 15:12:41,077 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-15 15:12:41,172 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:12:41,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:41,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:41,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:41,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {7920#true} call ULTIMATE.init(); {7920#true} is VALID [2022-04-15 15:12:41,458 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-15 15:12:41,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7928#(<= ~counter~0 0)} {7920#true} #102#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {7928#(<= ~counter~0 0)} call #t~ret9 := main(); {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,459 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-15 15:12:41,460 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-15 15:12:41,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {7928#(<= ~counter~0 0)} ~cond := #in~cond; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {7928#(<= ~counter~0 0)} assume !(0 == ~cond); {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7928#(<= ~counter~0 0)} {7928#(<= ~counter~0 0)} #90#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,461 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-15 15:12:41,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {7928#(<= ~counter~0 0)} ~cond := #in~cond; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {7928#(<= ~counter~0 0)} assume !(0 == ~cond); {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {7928#(<= ~counter~0 0)} assume true; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,462 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7928#(<= ~counter~0 0)} {7928#(<= ~counter~0 0)} #92#return; {7928#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:41,463 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-15 15:12:41,463 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-15 15:12:41,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {7977#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,464 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-15 15:12:41,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {7977#(<= ~counter~0 1)} ~cond := #in~cond; {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {7977#(<= ~counter~0 1)} assume !(0 == ~cond); {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {7977#(<= ~counter~0 1)} assume true; {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7977#(<= ~counter~0 1)} {7977#(<= ~counter~0 1)} #94#return; {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {7977#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7977#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:41,466 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-15 15:12:41,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {8002#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {8002#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:41,467 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-15 15:12:41,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {8002#(<= ~counter~0 2)} ~cond := #in~cond; {8002#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:41,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {8002#(<= ~counter~0 2)} assume !(0 == ~cond); {8002#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:41,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {8002#(<= ~counter~0 2)} assume true; {8002#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:41,468 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8002#(<= ~counter~0 2)} {8002#(<= ~counter~0 2)} #96#return; {8002#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:41,470 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-15 15:12:41,471 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-15 15:12:41,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {8027#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {8027#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:41,472 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-15 15:12:41,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {8027#(<= ~counter~0 3)} ~cond := #in~cond; {8027#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:41,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {8027#(<= ~counter~0 3)} assume !(0 == ~cond); {8027#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:41,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {8027#(<= ~counter~0 3)} assume true; {8027#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:41,480 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8027#(<= ~counter~0 3)} {8027#(<= ~counter~0 3)} #96#return; {8027#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:41,480 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-15 15:12:41,483 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-15 15:12:41,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {8052#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {8052#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:41,484 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-15 15:12:41,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {8052#(<= ~counter~0 4)} ~cond := #in~cond; {8052#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:41,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {8052#(<= ~counter~0 4)} assume !(0 == ~cond); {8052#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:41,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {8052#(<= ~counter~0 4)} assume true; {8052#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:41,486 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8052#(<= ~counter~0 4)} {8052#(<= ~counter~0 4)} #96#return; {8052#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:41,487 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-15 15:12:41,487 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-15 15:12:41,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {8077#(<= |main_#t~post7| 4)} assume !(#t~post7 < 50);havoc #t~post7; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {7921#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {7921#false} assume !(#t~post8 < 50);havoc #t~post8; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {7921#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {7921#false} assume !(#t~post6 < 50);havoc #t~post6; {7921#false} is VALID [2022-04-15 15:12:41,488 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-15 15:12:41,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {7921#false} ~cond := #in~cond; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {7921#false} assume 0 == ~cond; {7921#false} is VALID [2022-04-15 15:12:41,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {7921#false} assume !false; {7921#false} is VALID [2022-04-15 15:12:41,489 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-15 15:12:41,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:41,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {7921#false} assume !false; {7921#false} is VALID [2022-04-15 15:12:41,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {7921#false} assume 0 == ~cond; {7921#false} is VALID [2022-04-15 15:12:41,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {7921#false} ~cond := #in~cond; {7921#false} is VALID [2022-04-15 15:12:41,777 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-15 15:12:41,777 INFO L290 TraceCheckUtils]: 54: Hoare triple {7921#false} assume !(#t~post6 < 50);havoc #t~post6; {7921#false} is VALID [2022-04-15 15:12:41,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {7921#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7921#false} is VALID [2022-04-15 15:12:41,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {7921#false} assume !(#t~post8 < 50);havoc #t~post8; {7921#false} is VALID [2022-04-15 15:12:41,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {7921#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7921#false} is VALID [2022-04-15 15:12:41,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {8129#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {7921#false} is VALID [2022-04-15 15:12:41,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {8133#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8129#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:12:41,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {8133#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8133#(< ~counter~0 50)} is VALID [2022-04-15 15:12:41,790 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7920#true} {8133#(< ~counter~0 50)} #96#return; {8133#(< ~counter~0 50)} is VALID [2022-04-15 15:12:41,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,790 INFO L272 TraceCheckUtils]: 43: Hoare triple {8133#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:41,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {8133#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {8133#(< ~counter~0 50)} is VALID [2022-04-15 15:12:41,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {8158#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8133#(< ~counter~0 50)} is VALID [2022-04-15 15:12:41,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {8158#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8158#(< ~counter~0 49)} is VALID [2022-04-15 15:12:41,792 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7920#true} {8158#(< ~counter~0 49)} #96#return; {8158#(< ~counter~0 49)} is VALID [2022-04-15 15:12:41,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {8158#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:41,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {8158#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {8158#(< ~counter~0 49)} is VALID [2022-04-15 15:12:41,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {8183#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8158#(< ~counter~0 49)} is VALID [2022-04-15 15:12:41,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {8183#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8183#(< ~counter~0 48)} is VALID [2022-04-15 15:12:41,793 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7920#true} {8183#(< ~counter~0 48)} #96#return; {8183#(< ~counter~0 48)} is VALID [2022-04-15 15:12:41,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {8183#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:41,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {8183#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {8183#(< ~counter~0 48)} is VALID [2022-04-15 15:12:41,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {8208#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8183#(< ~counter~0 48)} is VALID [2022-04-15 15:12:41,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {8208#(< ~counter~0 47)} assume !!(0 != ~r~0); {8208#(< ~counter~0 47)} is VALID [2022-04-15 15:12:41,795 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7920#true} {8208#(< ~counter~0 47)} #94#return; {8208#(< ~counter~0 47)} is VALID [2022-04-15 15:12:41,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {8208#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:41,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {8208#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {8208#(< ~counter~0 47)} is VALID [2022-04-15 15:12:41,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {8233#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8208#(< ~counter~0 47)} is VALID [2022-04-15 15:12:41,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {8233#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,797 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7920#true} {8233#(< ~counter~0 46)} #92#return; {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,797 INFO L272 TraceCheckUtils]: 11: Hoare triple {8233#(< ~counter~0 46)} call assume_abort_if_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-15 15:12:41,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7920#true} {8233#(< ~counter~0 46)} #90#return; {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {7920#true} assume true; {7920#true} is VALID [2022-04-15 15:12:41,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {7920#true} assume !(0 == ~cond); {7920#true} is VALID [2022-04-15 15:12:41,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {7920#true} ~cond := #in~cond; {7920#true} is VALID [2022-04-15 15:12:41,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {8233#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7920#true} is VALID [2022-04-15 15:12:41,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {8233#(< ~counter~0 46)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 46)} is VALID [2022-04-15 15:12:41,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {8233#(< ~counter~0 46)} call #t~ret9 := main(); {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8233#(< ~counter~0 46)} {7920#true} #102#return; {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {8233#(< ~counter~0 46)} assume true; {8233#(< ~counter~0 46)} is VALID [2022-04-15 15:12:41,800 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 46)} is VALID [2022-04-15 15:12:41,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {7920#true} call ULTIMATE.init(); {7920#true} is VALID [2022-04-15 15:12:41,800 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-15 15:12:41,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:41,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661406272] [2022-04-15 15:12:41,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:41,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623673827] [2022-04-15 15:12:41,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623673827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:41,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:41,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:12:41,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:41,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558880278] [2022-04-15 15:12:41,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558880278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:41,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:41,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:41,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867745627] [2022-04-15 15:12:41,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:41,801 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-15 15:12:41,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:41,802 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-15 15:12:41,840 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-15 15:12:41,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:12:41,841 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-15 15:12:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:42,148 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-15 15:12:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:12:42,148 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-15 15:12:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:42,148 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-15 15:12:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:42,150 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-15 15:12:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:42,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 15:12:42,248 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-15 15:12:42,250 INFO L225 Difference]: With dead ends: 133 [2022-04-15 15:12:42,250 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 15:12:42,250 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-15 15:12:42,251 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-15 15:12:42,251 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-15 15:12:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 15:12:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-15 15:12:42,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:42,345 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-15 15:12:42,346 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-15 15:12:42,346 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-15 15:12:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:42,348 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 15:12:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:42,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:42,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:42,349 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-15 15:12:42,349 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-15 15:12:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:42,351 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 15:12:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:42,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:42,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:42,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:42,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:42,352 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-15 15:12:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-15 15:12:42,354 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-15 15:12:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:42,354 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-15 15:12:42,354 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-15 15:12:42,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-15 15:12:44,047 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-15 15:12:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 15:12:44,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:44,048 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-15 15:12:44,059 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-15 15:12:44,252 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-15 15:12:44,253 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 15:12:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:44,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113344544] [2022-04-15 15:12:44,253 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 15:12:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:44,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56693182] [2022-04-15 15:12:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:44,263 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:44,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545624018] [2022-04-15 15:12:44,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:44,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:44,265 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-15 15:12:44,266 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-15 15:12:44,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:44,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:44,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:12:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:44,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:44,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {8943#true} call ULTIMATE.init(); {8943#true} is VALID [2022-04-15 15:12:44,650 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-15 15:12:44,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8951#(<= ~counter~0 0)} {8943#true} #102#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {8951#(<= ~counter~0 0)} call #t~ret9 := main(); {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,651 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-15 15:12:44,651 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-15 15:12:44,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {8951#(<= ~counter~0 0)} ~cond := #in~cond; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {8951#(<= ~counter~0 0)} assume !(0 == ~cond); {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8951#(<= ~counter~0 0)} {8951#(<= ~counter~0 0)} #90#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,653 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-15 15:12:44,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {8951#(<= ~counter~0 0)} ~cond := #in~cond; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {8951#(<= ~counter~0 0)} assume !(0 == ~cond); {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {8951#(<= ~counter~0 0)} assume true; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8951#(<= ~counter~0 0)} {8951#(<= ~counter~0 0)} #92#return; {8951#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:44,655 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-15 15:12:44,655 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-15 15:12:44,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {9000#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,656 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-15 15:12:44,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {9000#(<= ~counter~0 1)} ~cond := #in~cond; {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {9000#(<= ~counter~0 1)} assume !(0 == ~cond); {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {9000#(<= ~counter~0 1)} assume true; {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,657 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9000#(<= ~counter~0 1)} {9000#(<= ~counter~0 1)} #94#return; {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {9000#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9000#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:44,658 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-15 15:12:44,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {9025#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,659 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-15 15:12:44,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {9025#(<= ~counter~0 2)} ~cond := #in~cond; {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {9025#(<= ~counter~0 2)} assume !(0 == ~cond); {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {9025#(<= ~counter~0 2)} assume true; {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,660 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9025#(<= ~counter~0 2)} {9025#(<= ~counter~0 2)} #96#return; {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {9025#(<= ~counter~0 2)} assume !(~r~0 > 0); {9025#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:44,661 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-15 15:12:44,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {9050#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {9050#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:44,662 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-15 15:12:44,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {9050#(<= ~counter~0 3)} ~cond := #in~cond; {9050#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:44,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {9050#(<= ~counter~0 3)} assume !(0 == ~cond); {9050#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:44,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {9050#(<= ~counter~0 3)} assume true; {9050#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:44,663 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9050#(<= ~counter~0 3)} {9050#(<= ~counter~0 3)} #98#return; {9050#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:44,664 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-15 15:12:44,664 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-15 15:12:44,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {9075#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {9075#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:44,665 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-15 15:12:44,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {9075#(<= ~counter~0 4)} ~cond := #in~cond; {9075#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:44,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {9075#(<= ~counter~0 4)} assume !(0 == ~cond); {9075#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:44,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {9075#(<= ~counter~0 4)} assume true; {9075#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:44,666 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9075#(<= ~counter~0 4)} {9075#(<= ~counter~0 4)} #98#return; {9075#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:44,667 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-15 15:12:44,667 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-15 15:12:44,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {9100#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,668 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-15 15:12:44,668 INFO L290 TraceCheckUtils]: 52: Hoare triple {9100#(<= ~counter~0 5)} ~cond := #in~cond; {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {9100#(<= ~counter~0 5)} assume !(0 == ~cond); {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {9100#(<= ~counter~0 5)} assume true; {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,669 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9100#(<= ~counter~0 5)} {9100#(<= ~counter~0 5)} #98#return; {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {9100#(<= ~counter~0 5)} assume !(~r~0 < 0); {9100#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:44,670 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-15 15:12:44,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {9125#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {8944#false} is VALID [2022-04-15 15:12:44,670 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-15 15:12:44,670 INFO L290 TraceCheckUtils]: 60: Hoare triple {8944#false} ~cond := #in~cond; {8944#false} is VALID [2022-04-15 15:12:44,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {8944#false} assume 0 == ~cond; {8944#false} is VALID [2022-04-15 15:12:44,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {8944#false} assume !false; {8944#false} is VALID [2022-04-15 15:12:44,671 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-15 15:12:44,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:45,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {8944#false} assume !false; {8944#false} is VALID [2022-04-15 15:12:45,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {8944#false} assume 0 == ~cond; {8944#false} is VALID [2022-04-15 15:12:45,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {8944#false} ~cond := #in~cond; {8944#false} is VALID [2022-04-15 15:12:45,015 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-15 15:12:45,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {8944#false} is VALID [2022-04-15 15:12:45,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {9157#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:12:45,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {9157#(< ~counter~0 50)} assume !(~r~0 < 0); {9157#(< ~counter~0 50)} is VALID [2022-04-15 15:12:45,016 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8943#true} {9157#(< ~counter~0 50)} #98#return; {9157#(< ~counter~0 50)} is VALID [2022-04-15 15:12:45,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,017 INFO L272 TraceCheckUtils]: 51: Hoare triple {9157#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:45,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {9157#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {9157#(< ~counter~0 50)} is VALID [2022-04-15 15:12:45,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {9182#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9157#(< ~counter~0 50)} is VALID [2022-04-15 15:12:45,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {9182#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9182#(< ~counter~0 49)} is VALID [2022-04-15 15:12:45,018 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8943#true} {9182#(< ~counter~0 49)} #98#return; {9182#(< ~counter~0 49)} is VALID [2022-04-15 15:12:45,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,019 INFO L272 TraceCheckUtils]: 43: Hoare triple {9182#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:45,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {9182#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {9182#(< ~counter~0 49)} is VALID [2022-04-15 15:12:45,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {9207#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9182#(< ~counter~0 49)} is VALID [2022-04-15 15:12:45,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {9207#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9207#(< ~counter~0 48)} is VALID [2022-04-15 15:12:45,020 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8943#true} {9207#(< ~counter~0 48)} #98#return; {9207#(< ~counter~0 48)} is VALID [2022-04-15 15:12:45,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,020 INFO L290 TraceCheckUtils]: 37: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,020 INFO L272 TraceCheckUtils]: 35: Hoare triple {9207#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:45,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {9207#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {9207#(< ~counter~0 48)} is VALID [2022-04-15 15:12:45,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {9232#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9207#(< ~counter~0 48)} is VALID [2022-04-15 15:12:45,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {9232#(< ~counter~0 47)} assume !(~r~0 > 0); {9232#(< ~counter~0 47)} is VALID [2022-04-15 15:12:45,022 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8943#true} {9232#(< ~counter~0 47)} #96#return; {9232#(< ~counter~0 47)} is VALID [2022-04-15 15:12:45,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,022 INFO L272 TraceCheckUtils]: 27: Hoare triple {9232#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:45,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {9232#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {9232#(< ~counter~0 47)} is VALID [2022-04-15 15:12:45,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {9257#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9232#(< ~counter~0 47)} is VALID [2022-04-15 15:12:45,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {9257#(< ~counter~0 46)} assume !!(0 != ~r~0); {9257#(< ~counter~0 46)} is VALID [2022-04-15 15:12:45,024 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8943#true} {9257#(< ~counter~0 46)} #94#return; {9257#(< ~counter~0 46)} is VALID [2022-04-15 15:12:45,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,024 INFO L272 TraceCheckUtils]: 19: Hoare triple {9257#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:12:45,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {9257#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9257#(< ~counter~0 46)} is VALID [2022-04-15 15:12:45,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {9282#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9257#(< ~counter~0 46)} is VALID [2022-04-15 15:12:45,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {9282#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8943#true} {9282#(< ~counter~0 45)} #92#return; {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {9282#(< ~counter~0 45)} call assume_abort_if_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-15 15:12:45,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8943#true} {9282#(< ~counter~0 45)} #90#return; {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {8943#true} assume true; {8943#true} is VALID [2022-04-15 15:12:45,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {8943#true} assume !(0 == ~cond); {8943#true} is VALID [2022-04-15 15:12:45,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {8943#true} ~cond := #in~cond; {8943#true} is VALID [2022-04-15 15:12:45,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {9282#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8943#true} is VALID [2022-04-15 15:12:45,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {9282#(< ~counter~0 45)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 45)} is VALID [2022-04-15 15:12:45,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {9282#(< ~counter~0 45)} call #t~ret9 := main(); {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9282#(< ~counter~0 45)} {8943#true} #102#return; {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {9282#(< ~counter~0 45)} assume true; {9282#(< ~counter~0 45)} is VALID [2022-04-15 15:12:45,029 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 45)} is VALID [2022-04-15 15:12:45,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {8943#true} call ULTIMATE.init(); {8943#true} is VALID [2022-04-15 15:12:45,029 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-15 15:12:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56693182] [2022-04-15 15:12:45,029 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545624018] [2022-04-15 15:12:45,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545624018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:45,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:12:45,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113344544] [2022-04-15 15:12:45,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113344544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:45,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:12:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992296669] [2022-04-15 15:12:45,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:45,031 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-15 15:12:45,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:45,031 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-15 15:12:45,076 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-15 15:12:45,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:12:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:12:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:45,077 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-15 15:12:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:45,459 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-15 15:12:45,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:12:45,459 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-15 15:12:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:45,459 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-15 15:12:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:12:45,461 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-15 15:12:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:12:45,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-15 15:12:45,562 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-15 15:12:45,564 INFO L225 Difference]: With dead ends: 116 [2022-04-15 15:12:45,564 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 15:12:45,565 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-15 15:12:45,565 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-15 15:12:45,565 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-15 15:12:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 15:12:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-15 15:12:45,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:45,655 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-15 15:12:45,655 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-15 15:12:45,655 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-15 15:12:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:45,658 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-15 15:12:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-15 15:12:45,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:45,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:45,659 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-15 15:12:45,659 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-15 15:12:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:45,661 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-15 15:12:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-15 15:12:45,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:45,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:45,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:45,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:45,662 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-15 15:12:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-15 15:12:45,665 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-15 15:12:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:45,665 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-15 15:12:45,665 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-15 15:12:45,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-15 15:12:47,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-15 15:12:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 15:12:47,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:47,818 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-15 15:12:47,842 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-15 15:12:48,018 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-15 15:12:48,018 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-15 15:12:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:48,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812757391] [2022-04-15 15:12:48,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-15 15:12:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:48,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212792099] [2022-04-15 15:12:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:48,032 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:48,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152004069] [2022-04-15 15:12:48,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:48,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:48,034 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-15 15:12:48,034 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-15 15:12:48,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:12:48,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:48,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:12:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:48,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:48,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {10006#true} call ULTIMATE.init(); {10006#true} is VALID [2022-04-15 15:12:48,402 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-15 15:12:48,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10014#(<= ~counter~0 0)} {10006#true} #102#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {10014#(<= ~counter~0 0)} call #t~ret9 := main(); {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,404 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-15 15:12:48,404 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-15 15:12:48,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {10014#(<= ~counter~0 0)} ~cond := #in~cond; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {10014#(<= ~counter~0 0)} assume !(0 == ~cond); {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10014#(<= ~counter~0 0)} {10014#(<= ~counter~0 0)} #90#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,406 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-15 15:12:48,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {10014#(<= ~counter~0 0)} ~cond := #in~cond; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {10014#(<= ~counter~0 0)} assume !(0 == ~cond); {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {10014#(<= ~counter~0 0)} assume true; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10014#(<= ~counter~0 0)} {10014#(<= ~counter~0 0)} #92#return; {10014#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:48,407 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-15 15:12:48,408 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-15 15:12:48,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {10063#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,409 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-15 15:12:48,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {10063#(<= ~counter~0 1)} ~cond := #in~cond; {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {10063#(<= ~counter~0 1)} assume !(0 == ~cond); {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {10063#(<= ~counter~0 1)} assume true; {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,410 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10063#(<= ~counter~0 1)} {10063#(<= ~counter~0 1)} #94#return; {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {10063#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10063#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:48,411 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-15 15:12:48,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {10088#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,412 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-15 15:12:48,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {10088#(<= ~counter~0 2)} ~cond := #in~cond; {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {10088#(<= ~counter~0 2)} assume !(0 == ~cond); {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {10088#(<= ~counter~0 2)} assume true; {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,413 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10088#(<= ~counter~0 2)} {10088#(<= ~counter~0 2)} #96#return; {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {10088#(<= ~counter~0 2)} assume !(~r~0 > 0); {10088#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:48,414 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-15 15:12:48,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {10113#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {10113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:48,415 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-15 15:12:48,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {10113#(<= ~counter~0 3)} ~cond := #in~cond; {10113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:48,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {10113#(<= ~counter~0 3)} assume !(0 == ~cond); {10113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:48,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {10113#(<= ~counter~0 3)} assume true; {10113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:48,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10113#(<= ~counter~0 3)} {10113#(<= ~counter~0 3)} #98#return; {10113#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:48,417 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-15 15:12:48,417 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-15 15:12:48,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {10138#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {10138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:48,418 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-15 15:12:48,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {10138#(<= ~counter~0 4)} ~cond := #in~cond; {10138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:48,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {10138#(<= ~counter~0 4)} assume !(0 == ~cond); {10138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:48,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {10138#(<= ~counter~0 4)} assume true; {10138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:48,419 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10138#(<= ~counter~0 4)} {10138#(<= ~counter~0 4)} #98#return; {10138#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:48,420 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-15 15:12:48,420 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-15 15:12:48,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {10163#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {10163#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:48,421 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-15 15:12:48,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {10163#(<= ~counter~0 5)} ~cond := #in~cond; {10163#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:48,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {10163#(<= ~counter~0 5)} assume !(0 == ~cond); {10163#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:48,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {10163#(<= ~counter~0 5)} assume true; {10163#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:48,422 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10163#(<= ~counter~0 5)} {10163#(<= ~counter~0 5)} #98#return; {10163#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:48,423 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-15 15:12:48,423 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-15 15:12:48,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {10188#(<= |main_#t~post8| 5)} assume !(#t~post8 < 50);havoc #t~post8; {10007#false} is VALID [2022-04-15 15:12:48,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {10007#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10007#false} is VALID [2022-04-15 15:12:48,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {10007#false} assume !(#t~post6 < 50);havoc #t~post6; {10007#false} is VALID [2022-04-15 15:12:48,424 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-15 15:12:48,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {10007#false} ~cond := #in~cond; {10007#false} is VALID [2022-04-15 15:12:48,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {10007#false} assume 0 == ~cond; {10007#false} is VALID [2022-04-15 15:12:48,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {10007#false} assume !false; {10007#false} is VALID [2022-04-15 15:12:48,424 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-15 15:12:48,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:48,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {10007#false} assume !false; {10007#false} is VALID [2022-04-15 15:12:48,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {10007#false} assume 0 == ~cond; {10007#false} is VALID [2022-04-15 15:12:48,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {10007#false} ~cond := #in~cond; {10007#false} is VALID [2022-04-15 15:12:48,765 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-15 15:12:48,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {10007#false} assume !(#t~post6 < 50);havoc #t~post6; {10007#false} is VALID [2022-04-15 15:12:48,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {10007#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10007#false} is VALID [2022-04-15 15:12:48,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {10228#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {10007#false} is VALID [2022-04-15 15:12:48,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {10232#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10228#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:12:48,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {10232#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10232#(< ~counter~0 50)} is VALID [2022-04-15 15:12:48,787 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10006#true} {10232#(< ~counter~0 50)} #98#return; {10232#(< ~counter~0 50)} is VALID [2022-04-15 15:12:48,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,788 INFO L272 TraceCheckUtils]: 51: Hoare triple {10232#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:48,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {10232#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {10232#(< ~counter~0 50)} is VALID [2022-04-15 15:12:48,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {10257#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10232#(< ~counter~0 50)} is VALID [2022-04-15 15:12:48,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {10257#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10257#(< ~counter~0 49)} is VALID [2022-04-15 15:12:48,790 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10006#true} {10257#(< ~counter~0 49)} #98#return; {10257#(< ~counter~0 49)} is VALID [2022-04-15 15:12:48,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,790 INFO L272 TraceCheckUtils]: 43: Hoare triple {10257#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:48,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {10257#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {10257#(< ~counter~0 49)} is VALID [2022-04-15 15:12:48,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {10282#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10257#(< ~counter~0 49)} is VALID [2022-04-15 15:12:48,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {10282#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10282#(< ~counter~0 48)} is VALID [2022-04-15 15:12:48,791 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10006#true} {10282#(< ~counter~0 48)} #98#return; {10282#(< ~counter~0 48)} is VALID [2022-04-15 15:12:48,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {10282#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:48,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {10282#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {10282#(< ~counter~0 48)} is VALID [2022-04-15 15:12:48,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {10307#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10282#(< ~counter~0 48)} is VALID [2022-04-15 15:12:48,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {10307#(< ~counter~0 47)} assume !(~r~0 > 0); {10307#(< ~counter~0 47)} is VALID [2022-04-15 15:12:48,793 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10006#true} {10307#(< ~counter~0 47)} #96#return; {10307#(< ~counter~0 47)} is VALID [2022-04-15 15:12:48,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {10307#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:48,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {10307#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {10307#(< ~counter~0 47)} is VALID [2022-04-15 15:12:48,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {10332#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10307#(< ~counter~0 47)} is VALID [2022-04-15 15:12:48,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {10332#(< ~counter~0 46)} assume !!(0 != ~r~0); {10332#(< ~counter~0 46)} is VALID [2022-04-15 15:12:48,795 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10006#true} {10332#(< ~counter~0 46)} #94#return; {10332#(< ~counter~0 46)} is VALID [2022-04-15 15:12:48,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {10332#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:12:48,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {10332#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {10332#(< ~counter~0 46)} is VALID [2022-04-15 15:12:48,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {10357#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10332#(< ~counter~0 46)} is VALID [2022-04-15 15:12:48,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {10357#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,797 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10006#true} {10357#(< ~counter~0 45)} #92#return; {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,797 INFO L272 TraceCheckUtils]: 11: Hoare triple {10357#(< ~counter~0 45)} call assume_abort_if_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-15 15:12:48,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10006#true} {10357#(< ~counter~0 45)} #90#return; {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {10006#true} assume true; {10006#true} is VALID [2022-04-15 15:12:48,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {10006#true} assume !(0 == ~cond); {10006#true} is VALID [2022-04-15 15:12:48,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {10006#true} ~cond := #in~cond; {10006#true} is VALID [2022-04-15 15:12:48,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {10357#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10006#true} is VALID [2022-04-15 15:12:48,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {10357#(< ~counter~0 45)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 45)} is VALID [2022-04-15 15:12:48,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {10357#(< ~counter~0 45)} call #t~ret9 := main(); {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10357#(< ~counter~0 45)} {10006#true} #102#return; {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {10357#(< ~counter~0 45)} assume true; {10357#(< ~counter~0 45)} is VALID [2022-04-15 15:12:48,800 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 45)} is VALID [2022-04-15 15:12:48,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {10006#true} call ULTIMATE.init(); {10006#true} is VALID [2022-04-15 15:12:48,800 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-15 15:12:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212792099] [2022-04-15 15:12:48,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152004069] [2022-04-15 15:12:48,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152004069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:48,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:48,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:12:48,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812757391] [2022-04-15 15:12:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812757391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:48,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:48,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:12:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621119164] [2022-04-15 15:12:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:48,801 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-15 15:12:48,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:48,802 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-15 15:12:48,846 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-15 15:12:48,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:12:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:48,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:12:48,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:48,847 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-15 15:12:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:49,195 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-15 15:12:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:12:49,195 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-15 15:12:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:49,195 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-15 15:12:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:12:49,197 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-15 15:12:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:12:49,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-15 15:12:49,298 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-15 15:12:49,300 INFO L225 Difference]: With dead ends: 149 [2022-04-15 15:12:49,300 INFO L226 Difference]: Without dead ends: 112 [2022-04-15 15:12:49,301 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-15 15:12:49,301 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-15 15:12:49,301 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-15 15:12:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-15 15:12:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-15 15:12:49,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:49,394 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-15 15:12:49,394 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-15 15:12:49,395 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-15 15:12:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:49,397 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-15 15:12:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-15 15:12:49,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:49,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:49,398 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-15 15:12:49,398 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-15 15:12:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:49,400 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-15 15:12:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-15 15:12:49,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:49,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:49,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:49,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:49,401 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-15 15:12:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-15 15:12:49,404 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-15 15:12:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:49,404 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-15 15:12:49,404 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-15 15:12:49,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-15 15:12:51,221 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-15 15:12:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-15 15:12:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 15:12:51,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:51,222 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-15 15:12:51,238 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-15 15:12:51,422 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-15 15:12:51,422 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-15 15:12:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273650428] [2022-04-15 15:12:51,423 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-15 15:12:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:51,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798928083] [2022-04-15 15:12:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:51,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828695134] [2022-04-15 15:12:51,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:51,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:51,435 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-15 15:12:51,471 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-15 15:12:51,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:51,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:51,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:12:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:51,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:51,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {11157#true} call ULTIMATE.init(); {11157#true} is VALID [2022-04-15 15:12:51,813 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-15 15:12:51,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11165#(<= ~counter~0 0)} {11157#true} #102#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {11165#(<= ~counter~0 0)} call #t~ret9 := main(); {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,815 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-15 15:12:51,815 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-15 15:12:51,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {11165#(<= ~counter~0 0)} ~cond := #in~cond; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {11165#(<= ~counter~0 0)} assume !(0 == ~cond); {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11165#(<= ~counter~0 0)} {11165#(<= ~counter~0 0)} #90#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,817 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-15 15:12:51,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {11165#(<= ~counter~0 0)} ~cond := #in~cond; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {11165#(<= ~counter~0 0)} assume !(0 == ~cond); {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {11165#(<= ~counter~0 0)} assume true; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11165#(<= ~counter~0 0)} {11165#(<= ~counter~0 0)} #92#return; {11165#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:51,818 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-15 15:12:51,819 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-15 15:12:51,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {11214#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,820 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-15 15:12:51,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {11214#(<= ~counter~0 1)} ~cond := #in~cond; {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {11214#(<= ~counter~0 1)} assume !(0 == ~cond); {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {11214#(<= ~counter~0 1)} assume true; {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,821 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11214#(<= ~counter~0 1)} {11214#(<= ~counter~0 1)} #94#return; {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {11214#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11214#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:51,822 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-15 15:12:51,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {11239#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,823 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-15 15:12:51,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {11239#(<= ~counter~0 2)} ~cond := #in~cond; {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {11239#(<= ~counter~0 2)} assume !(0 == ~cond); {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {11239#(<= ~counter~0 2)} assume true; {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,824 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11239#(<= ~counter~0 2)} {11239#(<= ~counter~0 2)} #96#return; {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {11239#(<= ~counter~0 2)} assume !(~r~0 > 0); {11239#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:51,825 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-15 15:12:51,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {11264#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {11264#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:51,826 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-15 15:12:51,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {11264#(<= ~counter~0 3)} ~cond := #in~cond; {11264#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:51,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {11264#(<= ~counter~0 3)} assume !(0 == ~cond); {11264#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:51,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {11264#(<= ~counter~0 3)} assume true; {11264#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:51,827 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11264#(<= ~counter~0 3)} {11264#(<= ~counter~0 3)} #98#return; {11264#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:51,827 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-15 15:12:51,828 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-15 15:12:51,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {11289#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,829 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-15 15:12:51,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {11289#(<= ~counter~0 4)} ~cond := #in~cond; {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {11289#(<= ~counter~0 4)} assume !(0 == ~cond); {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {11289#(<= ~counter~0 4)} assume true; {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,830 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11289#(<= ~counter~0 4)} {11289#(<= ~counter~0 4)} #98#return; {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {11289#(<= ~counter~0 4)} assume !(~r~0 < 0); {11289#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:51,831 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-15 15:12:51,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {11314#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,832 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-15 15:12:51,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {11314#(<= ~counter~0 5)} ~cond := #in~cond; {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {11314#(<= ~counter~0 5)} assume !(0 == ~cond); {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {11314#(<= ~counter~0 5)} assume true; {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,833 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11314#(<= ~counter~0 5)} {11314#(<= ~counter~0 5)} #94#return; {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {11314#(<= ~counter~0 5)} assume !!(0 != ~r~0); {11314#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:51,834 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-15 15:12:51,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {11339#(<= |main_#t~post7| 5)} assume !(#t~post7 < 50);havoc #t~post7; {11158#false} is VALID [2022-04-15 15:12:51,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {11158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11158#false} is VALID [2022-04-15 15:12:51,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#false} assume !(#t~post8 < 50);havoc #t~post8; {11158#false} is VALID [2022-04-15 15:12:51,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {11158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11158#false} is VALID [2022-04-15 15:12:51,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {11158#false} assume !(#t~post6 < 50);havoc #t~post6; {11158#false} is VALID [2022-04-15 15:12:51,834 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-15 15:12:51,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {11158#false} ~cond := #in~cond; {11158#false} is VALID [2022-04-15 15:12:51,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {11158#false} assume 0 == ~cond; {11158#false} is VALID [2022-04-15 15:12:51,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {11158#false} assume !false; {11158#false} is VALID [2022-04-15 15:12:51,835 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-15 15:12:51,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:52,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {11158#false} assume !false; {11158#false} is VALID [2022-04-15 15:12:52,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {11158#false} assume 0 == ~cond; {11158#false} is VALID [2022-04-15 15:12:52,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {11158#false} ~cond := #in~cond; {11158#false} is VALID [2022-04-15 15:12:52,227 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-15 15:12:52,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {11158#false} assume !(#t~post6 < 50);havoc #t~post6; {11158#false} is VALID [2022-04-15 15:12:52,228 INFO L290 TraceCheckUtils]: 61: Hoare triple {11158#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11158#false} is VALID [2022-04-15 15:12:52,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#false} assume !(#t~post8 < 50);havoc #t~post8; {11158#false} is VALID [2022-04-15 15:12:52,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {11158#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11158#false} is VALID [2022-04-15 15:12:52,228 INFO L290 TraceCheckUtils]: 58: Hoare triple {11391#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {11158#false} is VALID [2022-04-15 15:12:52,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {11395#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11391#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:12:52,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {11395#(< ~counter~0 50)} assume !!(0 != ~r~0); {11395#(< ~counter~0 50)} is VALID [2022-04-15 15:12:52,229 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11157#true} {11395#(< ~counter~0 50)} #94#return; {11395#(< ~counter~0 50)} is VALID [2022-04-15 15:12:52,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,229 INFO L272 TraceCheckUtils]: 51: Hoare triple {11395#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:52,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {11395#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {11395#(< ~counter~0 50)} is VALID [2022-04-15 15:12:52,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {11420#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11395#(< ~counter~0 50)} is VALID [2022-04-15 15:12:52,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {11420#(< ~counter~0 49)} assume !(~r~0 < 0); {11420#(< ~counter~0 49)} is VALID [2022-04-15 15:12:52,231 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11157#true} {11420#(< ~counter~0 49)} #98#return; {11420#(< ~counter~0 49)} is VALID [2022-04-15 15:12:52,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,231 INFO L272 TraceCheckUtils]: 43: Hoare triple {11420#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:52,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {11420#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {11420#(< ~counter~0 49)} is VALID [2022-04-15 15:12:52,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {11445#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11420#(< ~counter~0 49)} is VALID [2022-04-15 15:12:52,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {11445#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11445#(< ~counter~0 48)} is VALID [2022-04-15 15:12:52,233 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11157#true} {11445#(< ~counter~0 48)} #98#return; {11445#(< ~counter~0 48)} is VALID [2022-04-15 15:12:52,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,233 INFO L272 TraceCheckUtils]: 35: Hoare triple {11445#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:52,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {11445#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {11445#(< ~counter~0 48)} is VALID [2022-04-15 15:12:52,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {11470#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11445#(< ~counter~0 48)} is VALID [2022-04-15 15:12:52,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {11470#(< ~counter~0 47)} assume !(~r~0 > 0); {11470#(< ~counter~0 47)} is VALID [2022-04-15 15:12:52,235 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11157#true} {11470#(< ~counter~0 47)} #96#return; {11470#(< ~counter~0 47)} is VALID [2022-04-15 15:12:52,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,235 INFO L272 TraceCheckUtils]: 27: Hoare triple {11470#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:52,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {11470#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {11470#(< ~counter~0 47)} is VALID [2022-04-15 15:12:52,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {11495#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11470#(< ~counter~0 47)} is VALID [2022-04-15 15:12:52,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {11495#(< ~counter~0 46)} assume !!(0 != ~r~0); {11495#(< ~counter~0 46)} is VALID [2022-04-15 15:12:52,237 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11157#true} {11495#(< ~counter~0 46)} #94#return; {11495#(< ~counter~0 46)} is VALID [2022-04-15 15:12:52,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,237 INFO L272 TraceCheckUtils]: 19: Hoare triple {11495#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:12:52,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {11495#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {11495#(< ~counter~0 46)} is VALID [2022-04-15 15:12:52,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {11520#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11495#(< ~counter~0 46)} is VALID [2022-04-15 15:12:52,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {11520#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11157#true} {11520#(< ~counter~0 45)} #92#return; {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {11520#(< ~counter~0 45)} call assume_abort_if_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-15 15:12:52,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11157#true} {11520#(< ~counter~0 45)} #90#return; {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {11157#true} assume true; {11157#true} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {11157#true} assume !(0 == ~cond); {11157#true} is VALID [2022-04-15 15:12:52,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {11157#true} ~cond := #in~cond; {11157#true} is VALID [2022-04-15 15:12:52,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {11520#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11157#true} is VALID [2022-04-15 15:12:52,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {11520#(< ~counter~0 45)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 45)} is VALID [2022-04-15 15:12:52,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {11520#(< ~counter~0 45)} call #t~ret9 := main(); {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11520#(< ~counter~0 45)} {11157#true} #102#return; {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {11520#(< ~counter~0 45)} assume true; {11520#(< ~counter~0 45)} is VALID [2022-04-15 15:12:52,244 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 45)} is VALID [2022-04-15 15:12:52,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {11157#true} call ULTIMATE.init(); {11157#true} is VALID [2022-04-15 15:12:52,244 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-15 15:12:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798928083] [2022-04-15 15:12:52,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:52,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828695134] [2022-04-15 15:12:52,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828695134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:52,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:52,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:12:52,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273650428] [2022-04-15 15:12:52,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273650428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:52,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:52,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:12:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816376642] [2022-04-15 15:12:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:52,246 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-15 15:12:52,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:52,246 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-15 15:12:52,296 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-15 15:12:52,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:12:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:12:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:12:52,297 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-15 15:12:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:52,699 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-15 15:12:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:12:52,699 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-15 15:12:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:52,700 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-15 15:12:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:12:52,701 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-15 15:12:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:12:52,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-15 15:12:52,817 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-15 15:12:52,819 INFO L225 Difference]: With dead ends: 151 [2022-04-15 15:12:52,819 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 15:12:52,820 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-15 15:12:52,820 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-15 15:12:52,820 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-15 15:12:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 15:12:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-15 15:12:52,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:52,934 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-15 15:12:52,934 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-15 15:12:52,935 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-15 15:12:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:52,937 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-15 15:12:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 15:12:52,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:52,937 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-15 15:12:52,938 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-15 15:12:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:52,940 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-15 15:12:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 15:12:52,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:52,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:52,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:52,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:52,941 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-15 15:12:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-15 15:12:52,943 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-15 15:12:52,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:52,944 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-15 15:12:52,944 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-15 15:12:52,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-15 15:12:55,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:55,119 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 15:12:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 15:12:55,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:55,120 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-15 15:12:55,148 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-15 15:12:55,343 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-15 15:12:55,343 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:55,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-15 15:12:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032998284] [2022-04-15 15:12:55,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-15 15:12:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523442414] [2022-04-15 15:12:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:55,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237953795] [2022-04-15 15:12:55,366 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:55,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:55,367 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-15 15:12:55,370 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-15 15:12:55,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:12:55,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:55,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:12:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:55,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:55,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {12340#true} call ULTIMATE.init(); {12340#true} is VALID [2022-04-15 15:12:55,849 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-15 15:12:55,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12348#(<= ~counter~0 0)} {12340#true} #102#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {12348#(<= ~counter~0 0)} call #t~ret9 := main(); {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,850 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-15 15:12:55,850 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-15 15:12:55,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {12348#(<= ~counter~0 0)} ~cond := #in~cond; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {12348#(<= ~counter~0 0)} assume !(0 == ~cond); {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12348#(<= ~counter~0 0)} {12348#(<= ~counter~0 0)} #90#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,852 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-15 15:12:55,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {12348#(<= ~counter~0 0)} ~cond := #in~cond; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {12348#(<= ~counter~0 0)} assume !(0 == ~cond); {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {12348#(<= ~counter~0 0)} assume true; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12348#(<= ~counter~0 0)} {12348#(<= ~counter~0 0)} #92#return; {12348#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,854 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-15 15:12:55,854 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-15 15:12:55,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {12397#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,855 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-15 15:12:55,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {12397#(<= ~counter~0 1)} ~cond := #in~cond; {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {12397#(<= ~counter~0 1)} assume !(0 == ~cond); {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {12397#(<= ~counter~0 1)} assume true; {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12397#(<= ~counter~0 1)} {12397#(<= ~counter~0 1)} #94#return; {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {12397#(<= ~counter~0 1)} assume !!(0 != ~r~0); {12397#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,857 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-15 15:12:55,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {12422#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,858 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-15 15:12:55,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {12422#(<= ~counter~0 2)} ~cond := #in~cond; {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {12422#(<= ~counter~0 2)} assume !(0 == ~cond); {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {12422#(<= ~counter~0 2)} assume true; {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,859 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12422#(<= ~counter~0 2)} {12422#(<= ~counter~0 2)} #96#return; {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {12422#(<= ~counter~0 2)} assume !(~r~0 > 0); {12422#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,860 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-15 15:12:55,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {12447#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {12447#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,861 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-15 15:12:55,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {12447#(<= ~counter~0 3)} ~cond := #in~cond; {12447#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {12447#(<= ~counter~0 3)} assume !(0 == ~cond); {12447#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {12447#(<= ~counter~0 3)} assume true; {12447#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,862 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12447#(<= ~counter~0 3)} {12447#(<= ~counter~0 3)} #98#return; {12447#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,862 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-15 15:12:55,863 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-15 15:12:55,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {12472#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {12472#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,864 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-15 15:12:55,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {12472#(<= ~counter~0 4)} ~cond := #in~cond; {12472#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {12472#(<= ~counter~0 4)} assume !(0 == ~cond); {12472#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {12472#(<= ~counter~0 4)} assume true; {12472#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,865 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12472#(<= ~counter~0 4)} {12472#(<= ~counter~0 4)} #98#return; {12472#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,865 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-15 15:12:55,866 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-15 15:12:55,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {12497#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {12497#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,867 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-15 15:12:55,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {12497#(<= ~counter~0 5)} ~cond := #in~cond; {12497#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {12497#(<= ~counter~0 5)} assume !(0 == ~cond); {12497#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {12497#(<= ~counter~0 5)} assume true; {12497#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,868 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12497#(<= ~counter~0 5)} {12497#(<= ~counter~0 5)} #98#return; {12497#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,868 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-15 15:12:55,869 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-15 15:12:55,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {12522#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,870 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-15 15:12:55,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {12522#(<= ~counter~0 6)} ~cond := #in~cond; {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {12522#(<= ~counter~0 6)} assume !(0 == ~cond); {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {12522#(<= ~counter~0 6)} assume true; {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,871 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12522#(<= ~counter~0 6)} {12522#(<= ~counter~0 6)} #98#return; {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {12522#(<= ~counter~0 6)} assume !(~r~0 < 0); {12522#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,872 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-15 15:12:55,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {12547#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {12341#false} is VALID [2022-04-15 15:12:55,873 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-15 15:12:55,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {12341#false} ~cond := #in~cond; {12341#false} is VALID [2022-04-15 15:12:55,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {12341#false} assume 0 == ~cond; {12341#false} is VALID [2022-04-15 15:12:55,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {12341#false} assume !false; {12341#false} is VALID [2022-04-15 15:12:55,873 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-15 15:12:55,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:56,284 INFO L290 TraceCheckUtils]: 70: Hoare triple {12341#false} assume !false; {12341#false} is VALID [2022-04-15 15:12:56,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {12341#false} assume 0 == ~cond; {12341#false} is VALID [2022-04-15 15:12:56,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {12341#false} ~cond := #in~cond; {12341#false} is VALID [2022-04-15 15:12:56,284 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-15 15:12:56,285 INFO L290 TraceCheckUtils]: 66: Hoare triple {12575#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {12341#false} is VALID [2022-04-15 15:12:56,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {12579#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12575#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:12:56,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {12579#(< ~counter~0 50)} assume !(~r~0 < 0); {12579#(< ~counter~0 50)} is VALID [2022-04-15 15:12:56,286 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12340#true} {12579#(< ~counter~0 50)} #98#return; {12579#(< ~counter~0 50)} is VALID [2022-04-15 15:12:56,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,286 INFO L272 TraceCheckUtils]: 59: Hoare triple {12579#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:12:56,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {12579#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {12579#(< ~counter~0 50)} is VALID [2022-04-15 15:12:56,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {12604#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12579#(< ~counter~0 50)} is VALID [2022-04-15 15:12:56,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {12604#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12604#(< ~counter~0 49)} is VALID [2022-04-15 15:12:56,288 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12340#true} {12604#(< ~counter~0 49)} #98#return; {12604#(< ~counter~0 49)} is VALID [2022-04-15 15:12:56,288 INFO L290 TraceCheckUtils]: 54: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,288 INFO L272 TraceCheckUtils]: 51: Hoare triple {12604#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:12:56,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {12604#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {12604#(< ~counter~0 49)} is VALID [2022-04-15 15:12:56,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {12629#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12604#(< ~counter~0 49)} is VALID [2022-04-15 15:12:56,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {12629#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12629#(< ~counter~0 48)} is VALID [2022-04-15 15:12:56,290 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12340#true} {12629#(< ~counter~0 48)} #98#return; {12629#(< ~counter~0 48)} is VALID [2022-04-15 15:12:56,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,290 INFO L272 TraceCheckUtils]: 43: Hoare triple {12629#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:12:56,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {12629#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {12629#(< ~counter~0 48)} is VALID [2022-04-15 15:12:56,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {12654#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12629#(< ~counter~0 48)} is VALID [2022-04-15 15:12:56,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {12654#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12654#(< ~counter~0 47)} is VALID [2022-04-15 15:12:56,292 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12340#true} {12654#(< ~counter~0 47)} #98#return; {12654#(< ~counter~0 47)} is VALID [2022-04-15 15:12:56,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,292 INFO L272 TraceCheckUtils]: 35: Hoare triple {12654#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:12:56,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {12654#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {12654#(< ~counter~0 47)} is VALID [2022-04-15 15:12:56,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {12679#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12654#(< ~counter~0 47)} is VALID [2022-04-15 15:12:56,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {12679#(< ~counter~0 46)} assume !(~r~0 > 0); {12679#(< ~counter~0 46)} is VALID [2022-04-15 15:12:56,293 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12340#true} {12679#(< ~counter~0 46)} #96#return; {12679#(< ~counter~0 46)} is VALID [2022-04-15 15:12:56,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,294 INFO L272 TraceCheckUtils]: 27: Hoare triple {12679#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:12:56,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {12679#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {12679#(< ~counter~0 46)} is VALID [2022-04-15 15:12:56,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {12704#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12679#(< ~counter~0 46)} is VALID [2022-04-15 15:12:56,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {12704#(< ~counter~0 45)} assume !!(0 != ~r~0); {12704#(< ~counter~0 45)} is VALID [2022-04-15 15:12:56,295 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12340#true} {12704#(< ~counter~0 45)} #94#return; {12704#(< ~counter~0 45)} is VALID [2022-04-15 15:12:56,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,296 INFO L272 TraceCheckUtils]: 19: Hoare triple {12704#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:12:56,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {12704#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {12704#(< ~counter~0 45)} is VALID [2022-04-15 15:12:56,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {12729#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12704#(< ~counter~0 45)} is VALID [2022-04-15 15:12:56,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {12729#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12340#true} {12729#(< ~counter~0 44)} #92#return; {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,297 INFO L272 TraceCheckUtils]: 11: Hoare triple {12729#(< ~counter~0 44)} call assume_abort_if_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-15 15:12:56,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12340#true} {12729#(< ~counter~0 44)} #90#return; {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#true} assume true; {12340#true} is VALID [2022-04-15 15:12:56,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {12340#true} assume !(0 == ~cond); {12340#true} is VALID [2022-04-15 15:12:56,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {12340#true} ~cond := #in~cond; {12340#true} is VALID [2022-04-15 15:12:56,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {12729#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12340#true} is VALID [2022-04-15 15:12:56,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {12729#(< ~counter~0 44)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 44)} is VALID [2022-04-15 15:12:56,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {12729#(< ~counter~0 44)} call #t~ret9 := main(); {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12729#(< ~counter~0 44)} {12340#true} #102#return; {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {12729#(< ~counter~0 44)} assume true; {12729#(< ~counter~0 44)} is VALID [2022-04-15 15:12:56,300 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 44)} is VALID [2022-04-15 15:12:56,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {12340#true} call ULTIMATE.init(); {12340#true} is VALID [2022-04-15 15:12:56,300 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-15 15:12:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523442414] [2022-04-15 15:12:56,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237953795] [2022-04-15 15:12:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237953795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:56,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:56,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:12:56,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032998284] [2022-04-15 15:12:56,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032998284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:56,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:56,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:12:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436916806] [2022-04-15 15:12:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:56,301 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-15 15:12:56,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:56,302 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-15 15:12:56,351 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-15 15:12:56,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:12:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:12:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:12:56,352 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-15 15:12:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:56,769 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-15 15:12:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:12:56,769 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-15 15:12:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:56,769 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-15 15:12:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:12:56,771 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-15 15:12:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:12:56,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 15:12:56,892 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-15 15:12:56,894 INFO L225 Difference]: With dead ends: 137 [2022-04-15 15:12:56,894 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 15:12:56,895 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-15 15:12:56,895 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-15 15:12:56,895 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-15 15:12:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 15:12:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-15 15:12:57,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:57,021 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-15 15:12:57,021 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-15 15:12:57,021 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-15 15:12:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:57,024 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-15 15:12:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-15 15:12:57,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:57,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:57,025 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-15 15:12:57,025 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-15 15:12:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:57,028 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-15 15:12:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-15 15:12:57,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:57,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:57,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:57,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:57,029 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-15 15:12:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-15 15:12:57,032 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-15 15:12:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:57,032 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-15 15:12:57,033 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-15 15:12:57,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-15 15:12:58,929 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-15 15:12:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-15 15:12:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:12:58,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:58,930 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-15 15:12:58,946 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-15 15:12:59,131 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-15 15:12:59,132 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:59,132 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-15 15:12:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:59,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677814281] [2022-04-15 15:12:59,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:59,133 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-15 15:12:59,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:59,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998141377] [2022-04-15 15:12:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:59,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:59,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011179267] [2022-04-15 15:12:59,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:59,160 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-15 15:12:59,161 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-15 15:12:59,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:59,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:59,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:12:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:59,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:59,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {13577#true} call ULTIMATE.init(); {13577#true} is VALID [2022-04-15 15:12:59,409 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-15 15:12:59,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13577#true} {13577#true} #102#return; {13577#true} is VALID [2022-04-15 15:12:59,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {13577#true} call #t~ret9 := main(); {13577#true} is VALID [2022-04-15 15:12:59,410 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-15 15:12:59,410 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-15 15:12:59,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13577#true} {13577#true} #90#return; {13577#true} is VALID [2022-04-15 15:12:59,410 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-15 15:12:59,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13577#true} {13577#true} #92#return; {13577#true} is VALID [2022-04-15 15:12:59,410 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-15 15:12:59,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {13577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13577#true} is VALID [2022-04-15 15:12:59,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {13577#true} assume !!(#t~post6 < 50);havoc #t~post6; {13577#true} is VALID [2022-04-15 15:12:59,411 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-15 15:12:59,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13577#true} {13577#true} #94#return; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {13577#true} assume !!(0 != ~r~0); {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {13577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {13577#true} assume !!(#t~post7 < 50);havoc #t~post7; {13577#true} is VALID [2022-04-15 15:12:59,411 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-15 15:12:59,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,411 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13577#true} {13577#true} #96#return; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {13577#true} assume !(~r~0 > 0); {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {13577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {13577#true} assume !!(#t~post8 < 50);havoc #t~post8; {13577#true} is VALID [2022-04-15 15:12:59,412 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-15 15:12:59,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13577#true} {13577#true} #98#return; {13577#true} is VALID [2022-04-15 15:12:59,412 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-15 15:12:59,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {13577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {13577#true} assume !!(#t~post8 < 50);havoc #t~post8; {13577#true} is VALID [2022-04-15 15:12:59,412 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-15 15:12:59,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,413 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13577#true} {13577#true} #98#return; {13577#true} is VALID [2022-04-15 15:12:59,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {13577#true} assume !(~r~0 < 0); {13726#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:59,413 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-15 15:12:59,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {13726#(not (< main_~r~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {13726#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:59,413 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-15 15:12:59,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,414 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-15 15:12:59,415 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-15 15:12:59,415 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-15 15:12:59,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {13751#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:12:59,415 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-15 15:12:59,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {13577#true} ~cond := #in~cond; {13577#true} is VALID [2022-04-15 15:12:59,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {13577#true} assume !(0 == ~cond); {13577#true} is VALID [2022-04-15 15:12:59,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {13577#true} assume true; {13577#true} is VALID [2022-04-15 15:12:59,416 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-15 15:12:59,416 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-15 15:12:59,416 INFO L290 TraceCheckUtils]: 65: Hoare triple {13578#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13578#false} is VALID [2022-04-15 15:12:59,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {13578#false} assume !(#t~post8 < 50);havoc #t~post8; {13578#false} is VALID [2022-04-15 15:12:59,417 INFO L290 TraceCheckUtils]: 67: Hoare triple {13578#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13578#false} is VALID [2022-04-15 15:12:59,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {13578#false} assume !(#t~post6 < 50);havoc #t~post6; {13578#false} is VALID [2022-04-15 15:12:59,417 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-15 15:12:59,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {13578#false} ~cond := #in~cond; {13578#false} is VALID [2022-04-15 15:12:59,417 INFO L290 TraceCheckUtils]: 71: Hoare triple {13578#false} assume 0 == ~cond; {13578#false} is VALID [2022-04-15 15:12:59,417 INFO L290 TraceCheckUtils]: 72: Hoare triple {13578#false} assume !false; {13578#false} is VALID [2022-04-15 15:12:59,417 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-15 15:12:59,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:12:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998141377] [2022-04-15 15:12:59,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:59,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011179267] [2022-04-15 15:12:59,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011179267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:59,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:59,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677814281] [2022-04-15 15:12:59,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677814281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037659506] [2022-04-15 15:12:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:59,419 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-15 15:12:59,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:59,419 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-15 15:12:59,452 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-15 15:12:59,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:12:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:12:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:12:59,452 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-15 15:12:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:59,660 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-15 15:12:59,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:12:59,660 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-15 15:12:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:59,661 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-15 15:12:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:12:59,662 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-15 15:12:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:12:59,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:12:59,750 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-15 15:12:59,753 INFO L225 Difference]: With dead ends: 180 [2022-04-15 15:12:59,753 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 15:12:59,753 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-15 15:12:59,754 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-15 15:12:59,754 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-15 15:12:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 15:12:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-15 15:12:59,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:59,896 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-15 15:12:59,897 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-15 15:12:59,897 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-15 15:12:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:59,904 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-15 15:12:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-15 15:12:59,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:59,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:59,905 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-15 15:12:59,905 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-15 15:12:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:59,908 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-15 15:12:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-15 15:12:59,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:59,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:59,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:59,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:59,909 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-15 15:12:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-15 15:12:59,912 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-15 15:12:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:59,912 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-15 15:12:59,913 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-15 15:12:59,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-15 15:13:00,634 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-15 15:13:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-15 15:13:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:13:00,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:00,636 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-15 15:13:00,660 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-15 15:13:00,836 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-15 15:13:00,836 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-15 15:13:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:00,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277363003] [2022-04-15 15:13:00,837 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-15 15:13:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:00,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420306702] [2022-04-15 15:13:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:00,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:00,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371333814] [2022-04-15 15:13:00,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:00,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:00,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:00,850 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-15 15:13:00,859 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-15 15:13:00,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:00,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:00,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:13:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:00,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:01,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {14719#true} call ULTIMATE.init(); {14719#true} is VALID [2022-04-15 15:13:01,256 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-15 15:13:01,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14727#(<= ~counter~0 0)} {14719#true} #102#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {14727#(<= ~counter~0 0)} call #t~ret9 := main(); {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,257 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-15 15:13:01,257 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-15 15:13:01,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {14727#(<= ~counter~0 0)} ~cond := #in~cond; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {14727#(<= ~counter~0 0)} assume !(0 == ~cond); {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14727#(<= ~counter~0 0)} {14727#(<= ~counter~0 0)} #90#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,259 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-15 15:13:01,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {14727#(<= ~counter~0 0)} ~cond := #in~cond; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {14727#(<= ~counter~0 0)} assume !(0 == ~cond); {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {14727#(<= ~counter~0 0)} assume true; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14727#(<= ~counter~0 0)} {14727#(<= ~counter~0 0)} #92#return; {14727#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:01,261 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-15 15:13:01,261 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-15 15:13:01,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {14776#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,262 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-15 15:13:01,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {14776#(<= ~counter~0 1)} ~cond := #in~cond; {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {14776#(<= ~counter~0 1)} assume !(0 == ~cond); {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {14776#(<= ~counter~0 1)} assume true; {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,263 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14776#(<= ~counter~0 1)} {14776#(<= ~counter~0 1)} #94#return; {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {14776#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14776#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:01,264 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-15 15:13:01,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {14801#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,279 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-15 15:13:01,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {14801#(<= ~counter~0 2)} ~cond := #in~cond; {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {14801#(<= ~counter~0 2)} assume !(0 == ~cond); {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {14801#(<= ~counter~0 2)} assume true; {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,281 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14801#(<= ~counter~0 2)} {14801#(<= ~counter~0 2)} #96#return; {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {14801#(<= ~counter~0 2)} assume !(~r~0 > 0); {14801#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:01,282 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-15 15:13:01,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {14826#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {14826#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:01,282 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-15 15:13:01,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {14826#(<= ~counter~0 3)} ~cond := #in~cond; {14826#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:01,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {14826#(<= ~counter~0 3)} assume !(0 == ~cond); {14826#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:01,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {14826#(<= ~counter~0 3)} assume true; {14826#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:01,285 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14826#(<= ~counter~0 3)} {14826#(<= ~counter~0 3)} #98#return; {14826#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:01,286 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-15 15:13:01,286 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-15 15:13:01,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {14851#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {14851#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:01,287 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-15 15:13:01,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {14851#(<= ~counter~0 4)} ~cond := #in~cond; {14851#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:01,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {14851#(<= ~counter~0 4)} assume !(0 == ~cond); {14851#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:01,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {14851#(<= ~counter~0 4)} assume true; {14851#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:01,289 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14851#(<= ~counter~0 4)} {14851#(<= ~counter~0 4)} #98#return; {14851#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:01,289 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-15 15:13:01,290 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-15 15:13:01,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {14876#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {14876#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:01,290 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-15 15:13:01,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {14876#(<= ~counter~0 5)} ~cond := #in~cond; {14876#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:01,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {14876#(<= ~counter~0 5)} assume !(0 == ~cond); {14876#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:01,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {14876#(<= ~counter~0 5)} assume true; {14876#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:01,292 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14876#(<= ~counter~0 5)} {14876#(<= ~counter~0 5)} #98#return; {14876#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:01,292 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-15 15:13:01,293 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-15 15:13:01,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {14901#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {14901#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:01,293 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-15 15:13:01,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {14901#(<= ~counter~0 6)} ~cond := #in~cond; {14901#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:01,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {14901#(<= ~counter~0 6)} assume !(0 == ~cond); {14901#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:01,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {14901#(<= ~counter~0 6)} assume true; {14901#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:01,295 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14901#(<= ~counter~0 6)} {14901#(<= ~counter~0 6)} #98#return; {14901#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:01,295 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-15 15:13:01,295 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-15 15:13:01,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {14926#(<= |main_#t~post8| 6)} assume !(#t~post8 < 50);havoc #t~post8; {14720#false} is VALID [2022-04-15 15:13:01,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {14720#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14720#false} is VALID [2022-04-15 15:13:01,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {14720#false} assume !(#t~post6 < 50);havoc #t~post6; {14720#false} is VALID [2022-04-15 15:13:01,296 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-15 15:13:01,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {14720#false} ~cond := #in~cond; {14720#false} is VALID [2022-04-15 15:13:01,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {14720#false} assume 0 == ~cond; {14720#false} is VALID [2022-04-15 15:13:01,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {14720#false} assume !false; {14720#false} is VALID [2022-04-15 15:13:01,296 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-15 15:13:01,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:01,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {14720#false} assume !false; {14720#false} is VALID [2022-04-15 15:13:01,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {14720#false} assume 0 == ~cond; {14720#false} is VALID [2022-04-15 15:13:01,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {14720#false} ~cond := #in~cond; {14720#false} is VALID [2022-04-15 15:13:01,654 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-15 15:13:01,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {14720#false} assume !(#t~post6 < 50);havoc #t~post6; {14720#false} is VALID [2022-04-15 15:13:01,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {14720#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14720#false} is VALID [2022-04-15 15:13:01,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {14966#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {14720#false} is VALID [2022-04-15 15:13:01,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {14970#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14966#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:13:01,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {14970#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14970#(< ~counter~0 50)} is VALID [2022-04-15 15:13:01,655 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14719#true} {14970#(< ~counter~0 50)} #98#return; {14970#(< ~counter~0 50)} is VALID [2022-04-15 15:13:01,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,656 INFO L272 TraceCheckUtils]: 59: Hoare triple {14970#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:01,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {14970#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {14970#(< ~counter~0 50)} is VALID [2022-04-15 15:13:01,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {14995#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14970#(< ~counter~0 50)} is VALID [2022-04-15 15:13:01,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {14995#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14995#(< ~counter~0 49)} is VALID [2022-04-15 15:13:01,657 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14719#true} {14995#(< ~counter~0 49)} #98#return; {14995#(< ~counter~0 49)} is VALID [2022-04-15 15:13:01,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,658 INFO L272 TraceCheckUtils]: 51: Hoare triple {14995#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:01,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {14995#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {14995#(< ~counter~0 49)} is VALID [2022-04-15 15:13:01,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {15020#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14995#(< ~counter~0 49)} is VALID [2022-04-15 15:13:01,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {15020#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15020#(< ~counter~0 48)} is VALID [2022-04-15 15:13:01,659 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14719#true} {15020#(< ~counter~0 48)} #98#return; {15020#(< ~counter~0 48)} is VALID [2022-04-15 15:13:01,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,660 INFO L272 TraceCheckUtils]: 43: Hoare triple {15020#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:01,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {15020#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {15020#(< ~counter~0 48)} is VALID [2022-04-15 15:13:01,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {15045#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15020#(< ~counter~0 48)} is VALID [2022-04-15 15:13:01,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {15045#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15045#(< ~counter~0 47)} is VALID [2022-04-15 15:13:01,661 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14719#true} {15045#(< ~counter~0 47)} #98#return; {15045#(< ~counter~0 47)} is VALID [2022-04-15 15:13:01,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,661 INFO L272 TraceCheckUtils]: 35: Hoare triple {15045#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:01,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {15045#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {15045#(< ~counter~0 47)} is VALID [2022-04-15 15:13:01,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {15070#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15045#(< ~counter~0 47)} is VALID [2022-04-15 15:13:01,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {15070#(< ~counter~0 46)} assume !(~r~0 > 0); {15070#(< ~counter~0 46)} is VALID [2022-04-15 15:13:01,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14719#true} {15070#(< ~counter~0 46)} #96#return; {15070#(< ~counter~0 46)} is VALID [2022-04-15 15:13:01,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,663 INFO L272 TraceCheckUtils]: 27: Hoare triple {15070#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:01,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {15070#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {15070#(< ~counter~0 46)} is VALID [2022-04-15 15:13:01,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {15095#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15070#(< ~counter~0 46)} is VALID [2022-04-15 15:13:01,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {15095#(< ~counter~0 45)} assume !!(0 != ~r~0); {15095#(< ~counter~0 45)} is VALID [2022-04-15 15:13:01,665 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14719#true} {15095#(< ~counter~0 45)} #94#return; {15095#(< ~counter~0 45)} is VALID [2022-04-15 15:13:01,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {15095#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:01,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {15095#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {15095#(< ~counter~0 45)} is VALID [2022-04-15 15:13:01,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {15120#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15095#(< ~counter~0 45)} is VALID [2022-04-15 15:13:01,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {15120#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14719#true} {15120#(< ~counter~0 44)} #92#return; {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,667 INFO L272 TraceCheckUtils]: 11: Hoare triple {15120#(< ~counter~0 44)} call assume_abort_if_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-15 15:13:01,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14719#true} {15120#(< ~counter~0 44)} #90#return; {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {14719#true} assume true; {14719#true} is VALID [2022-04-15 15:13:01,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {14719#true} assume !(0 == ~cond); {14719#true} is VALID [2022-04-15 15:13:01,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {14719#true} ~cond := #in~cond; {14719#true} is VALID [2022-04-15 15:13:01,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {15120#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14719#true} is VALID [2022-04-15 15:13:01,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {15120#(< ~counter~0 44)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 44)} is VALID [2022-04-15 15:13:01,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {15120#(< ~counter~0 44)} call #t~ret9 := main(); {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15120#(< ~counter~0 44)} {14719#true} #102#return; {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {15120#(< ~counter~0 44)} assume true; {15120#(< ~counter~0 44)} is VALID [2022-04-15 15:13:01,670 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 44)} is VALID [2022-04-15 15:13:01,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {14719#true} call ULTIMATE.init(); {14719#true} is VALID [2022-04-15 15:13:01,670 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-15 15:13:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420306702] [2022-04-15 15:13:01,670 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:01,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371333814] [2022-04-15 15:13:01,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371333814] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:01,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:01,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:13:01,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:01,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277363003] [2022-04-15 15:13:01,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277363003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:01,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:01,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:13:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430591116] [2022-04-15 15:13:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:01,672 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-15 15:13:01,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:01,672 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-15 15:13:01,728 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-15 15:13:01,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:13:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:13:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:13:01,729 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-15 15:13:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:02,254 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-15 15:13:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 15:13:02,254 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-15 15:13:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:02,255 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-15 15:13:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:13:02,256 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-15 15:13:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:13:02,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-15 15:13:02,391 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-15 15:13:02,394 INFO L225 Difference]: With dead ends: 193 [2022-04-15 15:13:02,394 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 15:13:02,394 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-15 15:13:02,395 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-15 15:13:02,395 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-15 15:13:02,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 15:13:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-15 15:13:02,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:02,576 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-15 15:13:02,576 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-15 15:13:02,577 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-15 15:13:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:02,579 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-15 15:13:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-15 15:13:02,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:02,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:02,580 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-15 15:13:02,580 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-15 15:13:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:02,583 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-15 15:13:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-15 15:13:02,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:02,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:02,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:02,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:02,584 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-15 15:13:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-15 15:13:02,587 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-15 15:13:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:02,587 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-15 15:13:02,587 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-15 15:13:02,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-15 15:13:04,800 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-15 15:13:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-15 15:13:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 15:13:04,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:04,801 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-15 15:13:04,820 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-15 15:13:05,015 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-15 15:13:05,015 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-15 15:13:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:05,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872811071] [2022-04-15 15:13:05,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-15 15:13:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:05,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564130151] [2022-04-15 15:13:05,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:05,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:05,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564022243] [2022-04-15 15:13:05,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:05,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:05,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:05,033 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-15 15:13:05,035 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-15 15:13:05,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:05,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:05,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:13:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:05,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:05,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {16136#true} call ULTIMATE.init(); {16136#true} is VALID [2022-04-15 15:13:05,436 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-15 15:13:05,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16144#(<= ~counter~0 0)} {16136#true} #102#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {16144#(<= ~counter~0 0)} call #t~ret9 := main(); {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,437 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-15 15:13:05,438 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-15 15:13:05,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {16144#(<= ~counter~0 0)} ~cond := #in~cond; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {16144#(<= ~counter~0 0)} assume !(0 == ~cond); {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16144#(<= ~counter~0 0)} {16144#(<= ~counter~0 0)} #90#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,440 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-15 15:13:05,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {16144#(<= ~counter~0 0)} ~cond := #in~cond; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {16144#(<= ~counter~0 0)} assume !(0 == ~cond); {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {16144#(<= ~counter~0 0)} assume true; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,442 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16144#(<= ~counter~0 0)} {16144#(<= ~counter~0 0)} #92#return; {16144#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:05,442 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-15 15:13:05,443 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-15 15:13:05,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {16193#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,444 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-15 15:13:05,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {16193#(<= ~counter~0 1)} ~cond := #in~cond; {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {16193#(<= ~counter~0 1)} assume !(0 == ~cond); {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {16193#(<= ~counter~0 1)} assume true; {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,446 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16193#(<= ~counter~0 1)} {16193#(<= ~counter~0 1)} #94#return; {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {16193#(<= ~counter~0 1)} assume !!(0 != ~r~0); {16193#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:05,447 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-15 15:13:05,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {16218#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,448 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-15 15:13:05,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {16218#(<= ~counter~0 2)} ~cond := #in~cond; {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {16218#(<= ~counter~0 2)} assume !(0 == ~cond); {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {16218#(<= ~counter~0 2)} assume true; {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,450 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16218#(<= ~counter~0 2)} {16218#(<= ~counter~0 2)} #96#return; {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {16218#(<= ~counter~0 2)} assume !(~r~0 > 0); {16218#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:05,451 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-15 15:13:05,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {16243#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {16243#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:05,452 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-15 15:13:05,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {16243#(<= ~counter~0 3)} ~cond := #in~cond; {16243#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:05,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {16243#(<= ~counter~0 3)} assume !(0 == ~cond); {16243#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:05,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {16243#(<= ~counter~0 3)} assume true; {16243#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:05,454 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16243#(<= ~counter~0 3)} {16243#(<= ~counter~0 3)} #98#return; {16243#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:05,454 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-15 15:13:05,455 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-15 15:13:05,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {16268#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,456 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-15 15:13:05,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {16268#(<= ~counter~0 4)} ~cond := #in~cond; {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {16268#(<= ~counter~0 4)} assume !(0 == ~cond); {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {16268#(<= ~counter~0 4)} assume true; {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,458 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16268#(<= ~counter~0 4)} {16268#(<= ~counter~0 4)} #98#return; {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {16268#(<= ~counter~0 4)} assume !(~r~0 < 0); {16268#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:05,459 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-15 15:13:05,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {16293#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,460 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-15 15:13:05,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {16293#(<= ~counter~0 5)} ~cond := #in~cond; {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {16293#(<= ~counter~0 5)} assume !(0 == ~cond); {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {16293#(<= ~counter~0 5)} assume true; {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,462 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16293#(<= ~counter~0 5)} {16293#(<= ~counter~0 5)} #94#return; {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {16293#(<= ~counter~0 5)} assume !!(0 != ~r~0); {16293#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:05,463 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-15 15:13:05,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {16318#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {16318#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:05,464 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-15 15:13:05,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {16318#(<= ~counter~0 6)} ~cond := #in~cond; {16318#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:05,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {16318#(<= ~counter~0 6)} assume !(0 == ~cond); {16318#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:05,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {16318#(<= ~counter~0 6)} assume true; {16318#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:05,466 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16318#(<= ~counter~0 6)} {16318#(<= ~counter~0 6)} #96#return; {16318#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:05,466 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-15 15:13:05,466 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-15 15:13:05,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {16343#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {16137#false} is VALID [2022-04-15 15:13:05,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {16137#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16137#false} is VALID [2022-04-15 15:13:05,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {16137#false} assume !(#t~post8 < 50);havoc #t~post8; {16137#false} is VALID [2022-04-15 15:13:05,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {16137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16137#false} is VALID [2022-04-15 15:13:05,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {16137#false} assume !(#t~post6 < 50);havoc #t~post6; {16137#false} is VALID [2022-04-15 15:13:05,467 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-15 15:13:05,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {16137#false} ~cond := #in~cond; {16137#false} is VALID [2022-04-15 15:13:05,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {16137#false} assume 0 == ~cond; {16137#false} is VALID [2022-04-15 15:13:05,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {16137#false} assume !false; {16137#false} is VALID [2022-04-15 15:13:05,468 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-15 15:13:05,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:05,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {16137#false} assume !false; {16137#false} is VALID [2022-04-15 15:13:05,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {16137#false} assume 0 == ~cond; {16137#false} is VALID [2022-04-15 15:13:05,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {16137#false} ~cond := #in~cond; {16137#false} is VALID [2022-04-15 15:13:05,861 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-15 15:13:05,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {16137#false} assume !(#t~post6 < 50);havoc #t~post6; {16137#false} is VALID [2022-04-15 15:13:05,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {16137#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16137#false} is VALID [2022-04-15 15:13:05,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {16137#false} assume !(#t~post8 < 50);havoc #t~post8; {16137#false} is VALID [2022-04-15 15:13:05,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {16137#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16137#false} is VALID [2022-04-15 15:13:05,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {16395#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {16137#false} is VALID [2022-04-15 15:13:05,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {16399#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16395#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:13:05,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {16399#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16399#(< ~counter~0 50)} is VALID [2022-04-15 15:13:05,869 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16136#true} {16399#(< ~counter~0 50)} #96#return; {16399#(< ~counter~0 50)} is VALID [2022-04-15 15:13:05,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {16399#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:05,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {16399#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {16399#(< ~counter~0 50)} is VALID [2022-04-15 15:13:05,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {16424#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16399#(< ~counter~0 50)} is VALID [2022-04-15 15:13:05,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {16424#(< ~counter~0 49)} assume !!(0 != ~r~0); {16424#(< ~counter~0 49)} is VALID [2022-04-15 15:13:05,871 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16136#true} {16424#(< ~counter~0 49)} #94#return; {16424#(< ~counter~0 49)} is VALID [2022-04-15 15:13:05,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,871 INFO L272 TraceCheckUtils]: 51: Hoare triple {16424#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:05,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {16424#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {16424#(< ~counter~0 49)} is VALID [2022-04-15 15:13:05,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {16449#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16424#(< ~counter~0 49)} is VALID [2022-04-15 15:13:05,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {16449#(< ~counter~0 48)} assume !(~r~0 < 0); {16449#(< ~counter~0 48)} is VALID [2022-04-15 15:13:05,873 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16136#true} {16449#(< ~counter~0 48)} #98#return; {16449#(< ~counter~0 48)} is VALID [2022-04-15 15:13:05,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,873 INFO L272 TraceCheckUtils]: 43: Hoare triple {16449#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:05,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {16449#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {16449#(< ~counter~0 48)} is VALID [2022-04-15 15:13:05,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {16474#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16449#(< ~counter~0 48)} is VALID [2022-04-15 15:13:05,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {16474#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16474#(< ~counter~0 47)} is VALID [2022-04-15 15:13:05,875 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16136#true} {16474#(< ~counter~0 47)} #98#return; {16474#(< ~counter~0 47)} is VALID [2022-04-15 15:13:05,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,875 INFO L272 TraceCheckUtils]: 35: Hoare triple {16474#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:05,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {16474#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {16474#(< ~counter~0 47)} is VALID [2022-04-15 15:13:05,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {16499#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16474#(< ~counter~0 47)} is VALID [2022-04-15 15:13:05,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {16499#(< ~counter~0 46)} assume !(~r~0 > 0); {16499#(< ~counter~0 46)} is VALID [2022-04-15 15:13:05,877 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16136#true} {16499#(< ~counter~0 46)} #96#return; {16499#(< ~counter~0 46)} is VALID [2022-04-15 15:13:05,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,877 INFO L272 TraceCheckUtils]: 27: Hoare triple {16499#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:05,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {16499#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {16499#(< ~counter~0 46)} is VALID [2022-04-15 15:13:05,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {16524#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16499#(< ~counter~0 46)} is VALID [2022-04-15 15:13:05,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {16524#(< ~counter~0 45)} assume !!(0 != ~r~0); {16524#(< ~counter~0 45)} is VALID [2022-04-15 15:13:05,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16136#true} {16524#(< ~counter~0 45)} #94#return; {16524#(< ~counter~0 45)} is VALID [2022-04-15 15:13:05,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,879 INFO L272 TraceCheckUtils]: 19: Hoare triple {16524#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:05,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {16524#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {16524#(< ~counter~0 45)} is VALID [2022-04-15 15:13:05,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {16549#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16524#(< ~counter~0 45)} is VALID [2022-04-15 15:13:05,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {16549#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,880 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16136#true} {16549#(< ~counter~0 44)} #92#return; {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,881 INFO L272 TraceCheckUtils]: 11: Hoare triple {16549#(< ~counter~0 44)} call assume_abort_if_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-15 15:13:05,881 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16136#true} {16549#(< ~counter~0 44)} #90#return; {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {16136#true} assume true; {16136#true} is VALID [2022-04-15 15:13:05,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {16136#true} assume !(0 == ~cond); {16136#true} is VALID [2022-04-15 15:13:05,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {16136#true} ~cond := #in~cond; {16136#true} is VALID [2022-04-15 15:13:05,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {16549#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16136#true} is VALID [2022-04-15 15:13:05,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {16549#(< ~counter~0 44)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 44)} is VALID [2022-04-15 15:13:05,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {16549#(< ~counter~0 44)} call #t~ret9 := main(); {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16549#(< ~counter~0 44)} {16136#true} #102#return; {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {16549#(< ~counter~0 44)} assume true; {16549#(< ~counter~0 44)} is VALID [2022-04-15 15:13:05,883 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 44)} is VALID [2022-04-15 15:13:05,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {16136#true} call ULTIMATE.init(); {16136#true} is VALID [2022-04-15 15:13:05,883 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-15 15:13:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564130151] [2022-04-15 15:13:05,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:05,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564022243] [2022-04-15 15:13:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564022243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:05,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:13:05,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:05,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872811071] [2022-04-15 15:13:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872811071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:05,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:13:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360747942] [2022-04-15 15:13:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:05,885 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-15 15:13:05,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:05,885 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-15 15:13:05,940 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-15 15:13:05,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:13:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:13:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:13:05,941 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-15 15:13:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:06,486 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-15 15:13:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:13:06,487 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-15 15:13:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:06,487 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-15 15:13:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:13:06,489 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-15 15:13:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:13:06,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-15 15:13:06,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:06,629 INFO L225 Difference]: With dead ends: 195 [2022-04-15 15:13:06,629 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 15:13:06,630 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-15 15:13:06,630 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-15 15:13:06,631 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-15 15:13:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 15:13:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-15 15:13:06,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:06,822 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-15 15:13:06,822 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-15 15:13:06,822 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-15 15:13:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:06,825 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-15 15:13:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 15:13:06,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:06,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:06,826 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-15 15:13:06,827 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-15 15:13:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:06,829 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-15 15:13:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 15:13:06,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:06,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:06,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:06,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:06,830 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-15 15:13:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-15 15:13:06,834 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-15 15:13:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:06,834 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-15 15:13:06,834 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-15 15:13:06,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-15 15:13:09,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 15:13:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 15:13:09,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:09,078 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-15 15:13:09,096 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-15 15:13:09,278 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-15 15:13:09,279 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-15 15:13:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:09,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315192850] [2022-04-15 15:13:09,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-15 15:13:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228943124] [2022-04-15 15:13:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:09,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:09,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366692104] [2022-04-15 15:13:09,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:09,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:09,294 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-15 15:13:09,295 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-15 15:13:09,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:09,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:09,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:13:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:09,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:09,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {17587#true} call ULTIMATE.init(); {17587#true} is VALID [2022-04-15 15:13:09,714 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-15 15:13:09,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17595#(<= ~counter~0 0)} {17587#true} #102#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {17595#(<= ~counter~0 0)} call #t~ret9 := main(); {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,716 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-15 15:13:09,716 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-15 15:13:09,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {17595#(<= ~counter~0 0)} ~cond := #in~cond; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {17595#(<= ~counter~0 0)} assume !(0 == ~cond); {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17595#(<= ~counter~0 0)} {17595#(<= ~counter~0 0)} #90#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,718 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-15 15:13:09,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {17595#(<= ~counter~0 0)} ~cond := #in~cond; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {17595#(<= ~counter~0 0)} assume !(0 == ~cond); {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {17595#(<= ~counter~0 0)} assume true; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,719 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17595#(<= ~counter~0 0)} {17595#(<= ~counter~0 0)} #92#return; {17595#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:09,719 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-15 15:13:09,720 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-15 15:13:09,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {17644#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,721 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-15 15:13:09,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {17644#(<= ~counter~0 1)} ~cond := #in~cond; {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {17644#(<= ~counter~0 1)} assume !(0 == ~cond); {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {17644#(<= ~counter~0 1)} assume true; {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,722 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17644#(<= ~counter~0 1)} {17644#(<= ~counter~0 1)} #94#return; {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {17644#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17644#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:09,723 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-15 15:13:09,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {17669#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,724 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-15 15:13:09,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {17669#(<= ~counter~0 2)} ~cond := #in~cond; {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {17669#(<= ~counter~0 2)} assume !(0 == ~cond); {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {17669#(<= ~counter~0 2)} assume true; {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,725 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17669#(<= ~counter~0 2)} {17669#(<= ~counter~0 2)} #96#return; {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {17669#(<= ~counter~0 2)} assume !(~r~0 > 0); {17669#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:09,726 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-15 15:13:09,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {17694#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {17694#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:09,726 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-15 15:13:09,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {17694#(<= ~counter~0 3)} ~cond := #in~cond; {17694#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:09,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {17694#(<= ~counter~0 3)} assume !(0 == ~cond); {17694#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:09,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {17694#(<= ~counter~0 3)} assume true; {17694#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:09,728 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17694#(<= ~counter~0 3)} {17694#(<= ~counter~0 3)} #98#return; {17694#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:09,728 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-15 15:13:09,728 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-15 15:13:09,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {17719#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {17719#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:09,729 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-15 15:13:09,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {17719#(<= ~counter~0 4)} ~cond := #in~cond; {17719#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:09,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {17719#(<= ~counter~0 4)} assume !(0 == ~cond); {17719#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:09,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {17719#(<= ~counter~0 4)} assume true; {17719#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:09,731 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17719#(<= ~counter~0 4)} {17719#(<= ~counter~0 4)} #98#return; {17719#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:09,731 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-15 15:13:09,731 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-15 15:13:09,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {17744#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {17744#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:09,732 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-15 15:13:09,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {17744#(<= ~counter~0 5)} ~cond := #in~cond; {17744#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:09,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {17744#(<= ~counter~0 5)} assume !(0 == ~cond); {17744#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:09,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {17744#(<= ~counter~0 5)} assume true; {17744#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:09,733 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17744#(<= ~counter~0 5)} {17744#(<= ~counter~0 5)} #98#return; {17744#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:09,734 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-15 15:13:09,734 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-15 15:13:09,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {17769#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {17769#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:09,735 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-15 15:13:09,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {17769#(<= ~counter~0 6)} ~cond := #in~cond; {17769#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:09,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {17769#(<= ~counter~0 6)} assume !(0 == ~cond); {17769#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:09,736 INFO L290 TraceCheckUtils]: 62: Hoare triple {17769#(<= ~counter~0 6)} assume true; {17769#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:09,736 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17769#(<= ~counter~0 6)} {17769#(<= ~counter~0 6)} #98#return; {17769#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:09,743 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-15 15:13:09,744 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-15 15:13:09,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {17794#(<= ~counter~0 7)} assume !!(#t~post8 < 50);havoc #t~post8; {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,745 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-15 15:13:09,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {17794#(<= ~counter~0 7)} ~cond := #in~cond; {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {17794#(<= ~counter~0 7)} assume !(0 == ~cond); {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,746 INFO L290 TraceCheckUtils]: 70: Hoare triple {17794#(<= ~counter~0 7)} assume true; {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,746 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17794#(<= ~counter~0 7)} {17794#(<= ~counter~0 7)} #98#return; {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,746 INFO L290 TraceCheckUtils]: 72: Hoare triple {17794#(<= ~counter~0 7)} assume !(~r~0 < 0); {17794#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:09,747 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-15 15:13:09,747 INFO L290 TraceCheckUtils]: 74: Hoare triple {17819#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {17588#false} is VALID [2022-04-15 15:13:09,747 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-15 15:13:09,747 INFO L290 TraceCheckUtils]: 76: Hoare triple {17588#false} ~cond := #in~cond; {17588#false} is VALID [2022-04-15 15:13:09,747 INFO L290 TraceCheckUtils]: 77: Hoare triple {17588#false} assume 0 == ~cond; {17588#false} is VALID [2022-04-15 15:13:09,747 INFO L290 TraceCheckUtils]: 78: Hoare triple {17588#false} assume !false; {17588#false} is VALID [2022-04-15 15:13:09,748 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-15 15:13:09,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:10,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {17588#false} assume !false; {17588#false} is VALID [2022-04-15 15:13:10,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {17588#false} assume 0 == ~cond; {17588#false} is VALID [2022-04-15 15:13:10,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {17588#false} ~cond := #in~cond; {17588#false} is VALID [2022-04-15 15:13:10,163 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-15 15:13:10,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {17847#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {17588#false} is VALID [2022-04-15 15:13:10,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {17851#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17847#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:13:10,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {17851#(< ~counter~0 50)} assume !(~r~0 < 0); {17851#(< ~counter~0 50)} is VALID [2022-04-15 15:13:10,165 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17587#true} {17851#(< ~counter~0 50)} #98#return; {17851#(< ~counter~0 50)} is VALID [2022-04-15 15:13:10,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,165 INFO L272 TraceCheckUtils]: 67: Hoare triple {17851#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:10,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {17851#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {17851#(< ~counter~0 50)} is VALID [2022-04-15 15:13:10,166 INFO L290 TraceCheckUtils]: 65: Hoare triple {17876#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17851#(< ~counter~0 50)} is VALID [2022-04-15 15:13:10,166 INFO L290 TraceCheckUtils]: 64: Hoare triple {17876#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17876#(< ~counter~0 49)} is VALID [2022-04-15 15:13:10,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17587#true} {17876#(< ~counter~0 49)} #98#return; {17876#(< ~counter~0 49)} is VALID [2022-04-15 15:13:10,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,167 INFO L272 TraceCheckUtils]: 59: Hoare triple {17876#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:10,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {17876#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {17876#(< ~counter~0 49)} is VALID [2022-04-15 15:13:10,168 INFO L290 TraceCheckUtils]: 57: Hoare triple {17901#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17876#(< ~counter~0 49)} is VALID [2022-04-15 15:13:10,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {17901#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17901#(< ~counter~0 48)} is VALID [2022-04-15 15:13:10,169 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17587#true} {17901#(< ~counter~0 48)} #98#return; {17901#(< ~counter~0 48)} is VALID [2022-04-15 15:13:10,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,169 INFO L272 TraceCheckUtils]: 51: Hoare triple {17901#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:10,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {17901#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {17901#(< ~counter~0 48)} is VALID [2022-04-15 15:13:10,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {17926#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17901#(< ~counter~0 48)} is VALID [2022-04-15 15:13:10,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {17926#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17926#(< ~counter~0 47)} is VALID [2022-04-15 15:13:10,170 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17587#true} {17926#(< ~counter~0 47)} #98#return; {17926#(< ~counter~0 47)} is VALID [2022-04-15 15:13:10,171 INFO L290 TraceCheckUtils]: 46: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,171 INFO L290 TraceCheckUtils]: 45: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,171 INFO L290 TraceCheckUtils]: 44: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,171 INFO L272 TraceCheckUtils]: 43: Hoare triple {17926#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:10,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {17926#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {17926#(< ~counter~0 47)} is VALID [2022-04-15 15:13:10,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {17951#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17926#(< ~counter~0 47)} is VALID [2022-04-15 15:13:10,172 INFO L290 TraceCheckUtils]: 40: Hoare triple {17951#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17951#(< ~counter~0 46)} is VALID [2022-04-15 15:13:10,172 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17587#true} {17951#(< ~counter~0 46)} #98#return; {17951#(< ~counter~0 46)} is VALID [2022-04-15 15:13:10,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,172 INFO L290 TraceCheckUtils]: 37: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,173 INFO L272 TraceCheckUtils]: 35: Hoare triple {17951#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:10,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {17951#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {17951#(< ~counter~0 46)} is VALID [2022-04-15 15:13:10,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {17976#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17951#(< ~counter~0 46)} is VALID [2022-04-15 15:13:10,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {17976#(< ~counter~0 45)} assume !(~r~0 > 0); {17976#(< ~counter~0 45)} is VALID [2022-04-15 15:13:10,174 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17587#true} {17976#(< ~counter~0 45)} #96#return; {17976#(< ~counter~0 45)} is VALID [2022-04-15 15:13:10,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,174 INFO L272 TraceCheckUtils]: 27: Hoare triple {17976#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:10,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {17976#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {17976#(< ~counter~0 45)} is VALID [2022-04-15 15:13:10,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {18001#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17976#(< ~counter~0 45)} is VALID [2022-04-15 15:13:10,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {18001#(< ~counter~0 44)} assume !!(0 != ~r~0); {18001#(< ~counter~0 44)} is VALID [2022-04-15 15:13:10,176 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17587#true} {18001#(< ~counter~0 44)} #94#return; {18001#(< ~counter~0 44)} is VALID [2022-04-15 15:13:10,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,176 INFO L272 TraceCheckUtils]: 19: Hoare triple {18001#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:10,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {18001#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {18001#(< ~counter~0 44)} is VALID [2022-04-15 15:13:10,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {18026#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18001#(< ~counter~0 44)} is VALID [2022-04-15 15:13:10,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {18026#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17587#true} {18026#(< ~counter~0 43)} #92#return; {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {18026#(< ~counter~0 43)} call assume_abort_if_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-15 15:13:10,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17587#true} {18026#(< ~counter~0 43)} #90#return; {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {17587#true} assume true; {17587#true} is VALID [2022-04-15 15:13:10,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#true} assume !(0 == ~cond); {17587#true} is VALID [2022-04-15 15:13:10,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {17587#true} ~cond := #in~cond; {17587#true} is VALID [2022-04-15 15:13:10,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {18026#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17587#true} is VALID [2022-04-15 15:13:10,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {18026#(< ~counter~0 43)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 43)} is VALID [2022-04-15 15:13:10,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {18026#(< ~counter~0 43)} call #t~ret9 := main(); {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18026#(< ~counter~0 43)} {17587#true} #102#return; {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {18026#(< ~counter~0 43)} assume true; {18026#(< ~counter~0 43)} is VALID [2022-04-15 15:13:10,180 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 43)} is VALID [2022-04-15 15:13:10,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {17587#true} call ULTIMATE.init(); {17587#true} is VALID [2022-04-15 15:13:10,181 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-15 15:13:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:10,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228943124] [2022-04-15 15:13:10,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:10,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366692104] [2022-04-15 15:13:10,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366692104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:10,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:10,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:13:10,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:10,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315192850] [2022-04-15 15:13:10,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315192850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:13:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640919960] [2022-04-15 15:13:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:10,182 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-15 15:13:10,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:10,183 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-15 15:13:10,259 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-15 15:13:10,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:13:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:13:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:13:10,260 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-15 15:13:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:10,882 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-15 15:13:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:13:10,882 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-15 15:13:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:10,882 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-15 15:13:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:13:10,884 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-15 15:13:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:13:10,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-15 15:13:11,003 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-15 15:13:11,005 INFO L225 Difference]: With dead ends: 168 [2022-04-15 15:13:11,005 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 15:13:11,006 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-15 15:13:11,006 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:11,007 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.1s Time] [2022-04-15 15:13:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 15:13:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-15 15:13:11,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:11,159 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-15 15:13:11,160 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-15 15:13:11,160 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-15 15:13:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:11,163 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 15:13:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 15:13:11,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:11,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:11,170 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-15 15:13:11,170 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-15 15:13:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:11,173 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 15:13:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 15:13:11,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:11,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:11,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:11,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:11,174 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-15 15:13:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-15 15:13:11,178 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-15 15:13:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:11,178 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-15 15:13:11,178 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-15 15:13:11,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-15 15:13:12,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-15 15:13:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 15:13:12,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:12,939 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-15 15:13:12,962 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-15 15:13:13,147 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-15 15:13:13,147 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:13,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-15 15:13:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:13,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236255701] [2022-04-15 15:13:13,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-15 15:13:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:13,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880330439] [2022-04-15 15:13:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:13,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:13,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598351901] [2022-04-15 15:13:13,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:13,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:13,160 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-15 15:13:13,162 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-15 15:13:13,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:13,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:13,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:13:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:13,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:13,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {19064#true} call ULTIMATE.init(); {19064#true} is VALID [2022-04-15 15:13:13,605 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-15 15:13:13,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19072#(<= ~counter~0 0)} {19064#true} #102#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {19072#(<= ~counter~0 0)} call #t~ret9 := main(); {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,607 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-15 15:13:13,607 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-15 15:13:13,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {19072#(<= ~counter~0 0)} ~cond := #in~cond; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {19072#(<= ~counter~0 0)} assume !(0 == ~cond); {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19072#(<= ~counter~0 0)} {19072#(<= ~counter~0 0)} #90#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,609 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-15 15:13:13,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {19072#(<= ~counter~0 0)} ~cond := #in~cond; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {19072#(<= ~counter~0 0)} assume !(0 == ~cond); {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {19072#(<= ~counter~0 0)} assume true; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19072#(<= ~counter~0 0)} {19072#(<= ~counter~0 0)} #92#return; {19072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:13,610 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-15 15:13:13,611 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-15 15:13:13,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {19121#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,612 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-15 15:13:13,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {19121#(<= ~counter~0 1)} ~cond := #in~cond; {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {19121#(<= ~counter~0 1)} assume !(0 == ~cond); {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {19121#(<= ~counter~0 1)} assume true; {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19121#(<= ~counter~0 1)} {19121#(<= ~counter~0 1)} #94#return; {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {19121#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:13,614 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-15 15:13:13,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {19146#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,615 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-15 15:13:13,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {19146#(<= ~counter~0 2)} ~cond := #in~cond; {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {19146#(<= ~counter~0 2)} assume !(0 == ~cond); {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {19146#(<= ~counter~0 2)} assume true; {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,616 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19146#(<= ~counter~0 2)} {19146#(<= ~counter~0 2)} #96#return; {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {19146#(<= ~counter~0 2)} assume !(~r~0 > 0); {19146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:13,617 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-15 15:13:13,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {19171#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {19171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:13,618 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-15 15:13:13,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {19171#(<= ~counter~0 3)} ~cond := #in~cond; {19171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:13,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {19171#(<= ~counter~0 3)} assume !(0 == ~cond); {19171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:13,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {19171#(<= ~counter~0 3)} assume true; {19171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:13,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19171#(<= ~counter~0 3)} {19171#(<= ~counter~0 3)} #98#return; {19171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:13,619 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-15 15:13:13,620 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-15 15:13:13,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {19196#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,621 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-15 15:13:13,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {19196#(<= ~counter~0 4)} ~cond := #in~cond; {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {19196#(<= ~counter~0 4)} assume !(0 == ~cond); {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {19196#(<= ~counter~0 4)} assume true; {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,622 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19196#(<= ~counter~0 4)} {19196#(<= ~counter~0 4)} #98#return; {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {19196#(<= ~counter~0 4)} assume !(~r~0 < 0); {19196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:13,623 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-15 15:13:13,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {19221#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,624 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-15 15:13:13,624 INFO L290 TraceCheckUtils]: 52: Hoare triple {19221#(<= ~counter~0 5)} ~cond := #in~cond; {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {19221#(<= ~counter~0 5)} assume !(0 == ~cond); {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {19221#(<= ~counter~0 5)} assume true; {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19221#(<= ~counter~0 5)} {19221#(<= ~counter~0 5)} #94#return; {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {19221#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:13,626 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-15 15:13:13,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {19246#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {19246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:13,626 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-15 15:13:13,627 INFO L290 TraceCheckUtils]: 60: Hoare triple {19246#(<= ~counter~0 6)} ~cond := #in~cond; {19246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:13,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {19246#(<= ~counter~0 6)} assume !(0 == ~cond); {19246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:13,627 INFO L290 TraceCheckUtils]: 62: Hoare triple {19246#(<= ~counter~0 6)} assume true; {19246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:13,628 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19246#(<= ~counter~0 6)} {19246#(<= ~counter~0 6)} #96#return; {19246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:13,628 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-15 15:13:13,628 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-15 15:13:13,629 INFO L290 TraceCheckUtils]: 66: Hoare triple {19271#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,629 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-15 15:13:13,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {19271#(<= ~counter~0 7)} ~cond := #in~cond; {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,630 INFO L290 TraceCheckUtils]: 69: Hoare triple {19271#(<= ~counter~0 7)} assume !(0 == ~cond); {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,630 INFO L290 TraceCheckUtils]: 70: Hoare triple {19271#(<= ~counter~0 7)} assume true; {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,631 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19271#(<= ~counter~0 7)} {19271#(<= ~counter~0 7)} #96#return; {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {19271#(<= ~counter~0 7)} assume !(~r~0 > 0); {19271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:13,631 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-15 15:13:13,632 INFO L290 TraceCheckUtils]: 74: Hoare triple {19296#(<= |main_#t~post8| 7)} assume !(#t~post8 < 50);havoc #t~post8; {19065#false} is VALID [2022-04-15 15:13:13,632 INFO L290 TraceCheckUtils]: 75: Hoare triple {19065#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19065#false} is VALID [2022-04-15 15:13:13,632 INFO L290 TraceCheckUtils]: 76: Hoare triple {19065#false} assume !(#t~post6 < 50);havoc #t~post6; {19065#false} is VALID [2022-04-15 15:13:13,632 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-15 15:13:13,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {19065#false} ~cond := #in~cond; {19065#false} is VALID [2022-04-15 15:13:13,632 INFO L290 TraceCheckUtils]: 79: Hoare triple {19065#false} assume 0 == ~cond; {19065#false} is VALID [2022-04-15 15:13:13,632 INFO L290 TraceCheckUtils]: 80: Hoare triple {19065#false} assume !false; {19065#false} is VALID [2022-04-15 15:13:13,633 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-15 15:13:13,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:14,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {19065#false} assume !false; {19065#false} is VALID [2022-04-15 15:13:14,081 INFO L290 TraceCheckUtils]: 79: Hoare triple {19065#false} assume 0 == ~cond; {19065#false} is VALID [2022-04-15 15:13:14,081 INFO L290 TraceCheckUtils]: 78: Hoare triple {19065#false} ~cond := #in~cond; {19065#false} is VALID [2022-04-15 15:13:14,081 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-15 15:13:14,081 INFO L290 TraceCheckUtils]: 76: Hoare triple {19065#false} assume !(#t~post6 < 50);havoc #t~post6; {19065#false} is VALID [2022-04-15 15:13:14,081 INFO L290 TraceCheckUtils]: 75: Hoare triple {19065#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19065#false} is VALID [2022-04-15 15:13:14,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {19336#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {19065#false} is VALID [2022-04-15 15:13:14,082 INFO L290 TraceCheckUtils]: 73: Hoare triple {19340#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19336#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:13:14,082 INFO L290 TraceCheckUtils]: 72: Hoare triple {19340#(< ~counter~0 50)} assume !(~r~0 > 0); {19340#(< ~counter~0 50)} is VALID [2022-04-15 15:13:14,082 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19064#true} {19340#(< ~counter~0 50)} #96#return; {19340#(< ~counter~0 50)} is VALID [2022-04-15 15:13:14,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,083 INFO L290 TraceCheckUtils]: 69: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,083 INFO L272 TraceCheckUtils]: 67: Hoare triple {19340#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:14,083 INFO L290 TraceCheckUtils]: 66: Hoare triple {19340#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {19340#(< ~counter~0 50)} is VALID [2022-04-15 15:13:14,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {19365#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19340#(< ~counter~0 50)} is VALID [2022-04-15 15:13:14,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {19365#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19365#(< ~counter~0 49)} is VALID [2022-04-15 15:13:14,085 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19064#true} {19365#(< ~counter~0 49)} #96#return; {19365#(< ~counter~0 49)} is VALID [2022-04-15 15:13:14,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,085 INFO L272 TraceCheckUtils]: 59: Hoare triple {19365#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:14,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {19365#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {19365#(< ~counter~0 49)} is VALID [2022-04-15 15:13:14,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {19390#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19365#(< ~counter~0 49)} is VALID [2022-04-15 15:13:14,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {19390#(< ~counter~0 48)} assume !!(0 != ~r~0); {19390#(< ~counter~0 48)} is VALID [2022-04-15 15:13:14,087 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19064#true} {19390#(< ~counter~0 48)} #94#return; {19390#(< ~counter~0 48)} is VALID [2022-04-15 15:13:14,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,087 INFO L272 TraceCheckUtils]: 51: Hoare triple {19390#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:14,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {19390#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {19390#(< ~counter~0 48)} is VALID [2022-04-15 15:13:14,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {19415#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19390#(< ~counter~0 48)} is VALID [2022-04-15 15:13:14,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {19415#(< ~counter~0 47)} assume !(~r~0 < 0); {19415#(< ~counter~0 47)} is VALID [2022-04-15 15:13:14,089 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19064#true} {19415#(< ~counter~0 47)} #98#return; {19415#(< ~counter~0 47)} is VALID [2022-04-15 15:13:14,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,089 INFO L272 TraceCheckUtils]: 43: Hoare triple {19415#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:14,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {19415#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {19415#(< ~counter~0 47)} is VALID [2022-04-15 15:13:14,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {19440#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19415#(< ~counter~0 47)} is VALID [2022-04-15 15:13:14,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {19440#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19440#(< ~counter~0 46)} is VALID [2022-04-15 15:13:14,090 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19064#true} {19440#(< ~counter~0 46)} #98#return; {19440#(< ~counter~0 46)} is VALID [2022-04-15 15:13:14,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,091 INFO L272 TraceCheckUtils]: 35: Hoare triple {19440#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:14,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {19440#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {19440#(< ~counter~0 46)} is VALID [2022-04-15 15:13:14,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {19465#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19440#(< ~counter~0 46)} is VALID [2022-04-15 15:13:14,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {19465#(< ~counter~0 45)} assume !(~r~0 > 0); {19465#(< ~counter~0 45)} is VALID [2022-04-15 15:13:14,092 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19064#true} {19465#(< ~counter~0 45)} #96#return; {19465#(< ~counter~0 45)} is VALID [2022-04-15 15:13:14,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,093 INFO L272 TraceCheckUtils]: 27: Hoare triple {19465#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:14,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {19465#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {19465#(< ~counter~0 45)} is VALID [2022-04-15 15:13:14,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {19490#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19465#(< ~counter~0 45)} is VALID [2022-04-15 15:13:14,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {19490#(< ~counter~0 44)} assume !!(0 != ~r~0); {19490#(< ~counter~0 44)} is VALID [2022-04-15 15:13:14,094 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19064#true} {19490#(< ~counter~0 44)} #94#return; {19490#(< ~counter~0 44)} is VALID [2022-04-15 15:13:14,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,094 INFO L272 TraceCheckUtils]: 19: Hoare triple {19490#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:14,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {19490#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {19490#(< ~counter~0 44)} is VALID [2022-04-15 15:13:14,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {19515#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19490#(< ~counter~0 44)} is VALID [2022-04-15 15:13:14,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {19515#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,096 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19064#true} {19515#(< ~counter~0 43)} #92#return; {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,096 INFO L272 TraceCheckUtils]: 11: Hoare triple {19515#(< ~counter~0 43)} call assume_abort_if_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-15 15:13:14,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19064#true} {19515#(< ~counter~0 43)} #90#return; {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {19064#true} assume true; {19064#true} is VALID [2022-04-15 15:13:14,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {19064#true} assume !(0 == ~cond); {19064#true} is VALID [2022-04-15 15:13:14,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {19064#true} ~cond := #in~cond; {19064#true} is VALID [2022-04-15 15:13:14,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {19515#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19064#true} is VALID [2022-04-15 15:13:14,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {19515#(< ~counter~0 43)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 43)} is VALID [2022-04-15 15:13:14,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {19515#(< ~counter~0 43)} call #t~ret9 := main(); {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19515#(< ~counter~0 43)} {19064#true} #102#return; {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {19515#(< ~counter~0 43)} assume true; {19515#(< ~counter~0 43)} is VALID [2022-04-15 15:13:14,098 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 43)} is VALID [2022-04-15 15:13:14,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {19064#true} call ULTIMATE.init(); {19064#true} is VALID [2022-04-15 15:13:14,099 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-15 15:13:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:14,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880330439] [2022-04-15 15:13:14,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:14,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598351901] [2022-04-15 15:13:14,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598351901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:14,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:14,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:13:14,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:14,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236255701] [2022-04-15 15:13:14,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236255701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:14,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:14,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:13:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439117574] [2022-04-15 15:13:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:14,100 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-15 15:13:14,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:14,101 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-15 15:13:14,154 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-15 15:13:14,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:13:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:13:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:13:14,155 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-15 15:13:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:14,764 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-15 15:13:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 15:13:14,764 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-15 15:13:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:14,765 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-15 15:13:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:13:14,766 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-15 15:13:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:13:14,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-15 15:13:14,903 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-15 15:13:14,905 INFO L225 Difference]: With dead ends: 213 [2022-04-15 15:13:14,905 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 15:13:14,906 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-15 15:13:14,906 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:14,907 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.1s Time] [2022-04-15 15:13:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 15:13:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-15 15:13:15,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:15,082 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-15 15:13:15,082 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-15 15:13:15,083 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-15 15:13:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:15,086 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-15 15:13:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-15 15:13:15,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:15,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:15,087 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-15 15:13:15,087 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-15 15:13:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:15,090 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-15 15:13:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-15 15:13:15,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:15,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:15,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:15,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:15,091 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-15 15:13:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-15 15:13:15,095 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-15 15:13:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:15,095 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-15 15:13:15,095 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-15 15:13:15,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-15 15:13:17,366 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-15 15:13:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-15 15:13:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 15:13:17,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:17,367 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-15 15:13:17,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 15:13:17,567 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-15 15:13:17,568 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-15 15:13:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614108183] [2022-04-15 15:13:17,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-15 15:13:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:17,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398689146] [2022-04-15 15:13:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:17,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:17,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487386468] [2022-04-15 15:13:17,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:17,581 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-15 15:13:17,581 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-15 15:13:17,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:17,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:17,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:13:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:17,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:18,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {20653#true} call ULTIMATE.init(); {20653#true} is VALID [2022-04-15 15:13:18,073 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-15 15:13:18,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20661#(<= ~counter~0 0)} {20653#true} #102#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {20661#(<= ~counter~0 0)} call #t~ret9 := main(); {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,074 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-15 15:13:18,074 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-15 15:13:18,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {20661#(<= ~counter~0 0)} ~cond := #in~cond; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {20661#(<= ~counter~0 0)} assume !(0 == ~cond); {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20661#(<= ~counter~0 0)} {20661#(<= ~counter~0 0)} #90#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,076 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-15 15:13:18,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {20661#(<= ~counter~0 0)} ~cond := #in~cond; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {20661#(<= ~counter~0 0)} assume !(0 == ~cond); {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {20661#(<= ~counter~0 0)} assume true; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,077 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20661#(<= ~counter~0 0)} {20661#(<= ~counter~0 0)} #92#return; {20661#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:18,077 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-15 15:13:18,078 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-15 15:13:18,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {20710#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,079 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-15 15:13:18,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {20710#(<= ~counter~0 1)} ~cond := #in~cond; {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {20710#(<= ~counter~0 1)} assume !(0 == ~cond); {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {20710#(<= ~counter~0 1)} assume true; {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20710#(<= ~counter~0 1)} {20710#(<= ~counter~0 1)} #94#return; {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {20710#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20710#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:18,081 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-15 15:13:18,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {20735#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,082 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-15 15:13:18,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {20735#(<= ~counter~0 2)} ~cond := #in~cond; {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {20735#(<= ~counter~0 2)} assume !(0 == ~cond); {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {20735#(<= ~counter~0 2)} assume true; {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,083 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20735#(<= ~counter~0 2)} {20735#(<= ~counter~0 2)} #96#return; {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {20735#(<= ~counter~0 2)} assume !(~r~0 > 0); {20735#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:18,084 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-15 15:13:18,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {20760#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {20760#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,085 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-15 15:13:18,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {20760#(<= ~counter~0 3)} ~cond := #in~cond; {20760#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {20760#(<= ~counter~0 3)} assume !(0 == ~cond); {20760#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {20760#(<= ~counter~0 3)} assume true; {20760#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,086 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20760#(<= ~counter~0 3)} {20760#(<= ~counter~0 3)} #98#return; {20760#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:18,086 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-15 15:13:18,087 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-15 15:13:18,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {20785#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,088 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-15 15:13:18,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {20785#(<= ~counter~0 4)} ~cond := #in~cond; {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {20785#(<= ~counter~0 4)} assume !(0 == ~cond); {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {20785#(<= ~counter~0 4)} assume true; {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,089 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20785#(<= ~counter~0 4)} {20785#(<= ~counter~0 4)} #98#return; {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {20785#(<= ~counter~0 4)} assume !(~r~0 < 0); {20785#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:18,090 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-15 15:13:18,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {20810#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,090 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-15 15:13:18,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {20810#(<= ~counter~0 5)} ~cond := #in~cond; {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {20810#(<= ~counter~0 5)} assume !(0 == ~cond); {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {20810#(<= ~counter~0 5)} assume true; {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,092 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20810#(<= ~counter~0 5)} {20810#(<= ~counter~0 5)} #94#return; {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {20810#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20810#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:18,093 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-15 15:13:18,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {20835#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {20835#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,093 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-15 15:13:18,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {20835#(<= ~counter~0 6)} ~cond := #in~cond; {20835#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {20835#(<= ~counter~0 6)} assume !(0 == ~cond); {20835#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {20835#(<= ~counter~0 6)} assume true; {20835#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,095 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20835#(<= ~counter~0 6)} {20835#(<= ~counter~0 6)} #96#return; {20835#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:18,095 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-15 15:13:18,095 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-15 15:13:18,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {20860#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {20860#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:18,096 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-15 15:13:18,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {20860#(<= ~counter~0 7)} ~cond := #in~cond; {20860#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:18,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {20860#(<= ~counter~0 7)} assume !(0 == ~cond); {20860#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:18,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {20860#(<= ~counter~0 7)} assume true; {20860#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:18,098 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20860#(<= ~counter~0 7)} {20860#(<= ~counter~0 7)} #96#return; {20860#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:18,098 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-15 15:13:18,098 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-15 15:13:18,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {20885#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {20654#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {20654#false} assume !(#t~post8 < 50);havoc #t~post8; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {20654#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {20654#false} assume !(#t~post6 < 50);havoc #t~post6; {20654#false} is VALID [2022-04-15 15:13:18,099 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-15 15:13:18,099 INFO L290 TraceCheckUtils]: 80: Hoare triple {20654#false} ~cond := #in~cond; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 81: Hoare triple {20654#false} assume 0 == ~cond; {20654#false} is VALID [2022-04-15 15:13:18,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {20654#false} assume !false; {20654#false} is VALID [2022-04-15 15:13:18,099 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-15 15:13:18,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {20654#false} assume !false; {20654#false} is VALID [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {20654#false} assume 0 == ~cond; {20654#false} is VALID [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {20654#false} ~cond := #in~cond; {20654#false} is VALID [2022-04-15 15:13:18,537 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-15 15:13:18,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {20654#false} assume !(#t~post6 < 50);havoc #t~post6; {20654#false} is VALID [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {20654#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20654#false} is VALID [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {20654#false} assume !(#t~post8 < 50);havoc #t~post8; {20654#false} is VALID [2022-04-15 15:13:18,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {20654#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20654#false} is VALID [2022-04-15 15:13:18,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {20937#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {20654#false} is VALID [2022-04-15 15:13:18,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {20941#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20937#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:13:18,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {20941#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20941#(< ~counter~0 50)} is VALID [2022-04-15 15:13:18,539 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20653#true} {20941#(< ~counter~0 50)} #96#return; {20941#(< ~counter~0 50)} is VALID [2022-04-15 15:13:18,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,539 INFO L272 TraceCheckUtils]: 67: Hoare triple {20941#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:18,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {20941#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {20941#(< ~counter~0 50)} is VALID [2022-04-15 15:13:18,540 INFO L290 TraceCheckUtils]: 65: Hoare triple {20966#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20941#(< ~counter~0 50)} is VALID [2022-04-15 15:13:18,540 INFO L290 TraceCheckUtils]: 64: Hoare triple {20966#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20966#(< ~counter~0 49)} is VALID [2022-04-15 15:13:18,541 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20653#true} {20966#(< ~counter~0 49)} #96#return; {20966#(< ~counter~0 49)} is VALID [2022-04-15 15:13:18,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,541 INFO L272 TraceCheckUtils]: 59: Hoare triple {20966#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:18,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {20966#(< ~counter~0 49)} is VALID [2022-04-15 15:13:18,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {20991#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20966#(< ~counter~0 49)} is VALID [2022-04-15 15:13:18,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {20991#(< ~counter~0 48)} assume !!(0 != ~r~0); {20991#(< ~counter~0 48)} is VALID [2022-04-15 15:13:18,543 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20653#true} {20991#(< ~counter~0 48)} #94#return; {20991#(< ~counter~0 48)} is VALID [2022-04-15 15:13:18,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,543 INFO L272 TraceCheckUtils]: 51: Hoare triple {20991#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:18,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {20991#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {20991#(< ~counter~0 48)} is VALID [2022-04-15 15:13:18,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {21016#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20991#(< ~counter~0 48)} is VALID [2022-04-15 15:13:18,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {21016#(< ~counter~0 47)} assume !(~r~0 < 0); {21016#(< ~counter~0 47)} is VALID [2022-04-15 15:13:18,545 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20653#true} {21016#(< ~counter~0 47)} #98#return; {21016#(< ~counter~0 47)} is VALID [2022-04-15 15:13:18,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,545 INFO L272 TraceCheckUtils]: 43: Hoare triple {21016#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:18,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {21016#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {21016#(< ~counter~0 47)} is VALID [2022-04-15 15:13:18,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {21041#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21016#(< ~counter~0 47)} is VALID [2022-04-15 15:13:18,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {21041#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21041#(< ~counter~0 46)} is VALID [2022-04-15 15:13:18,546 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20653#true} {21041#(< ~counter~0 46)} #98#return; {21041#(< ~counter~0 46)} is VALID [2022-04-15 15:13:18,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,547 INFO L272 TraceCheckUtils]: 35: Hoare triple {21041#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:18,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {21041#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {21041#(< ~counter~0 46)} is VALID [2022-04-15 15:13:18,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {21066#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21041#(< ~counter~0 46)} is VALID [2022-04-15 15:13:18,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {21066#(< ~counter~0 45)} assume !(~r~0 > 0); {21066#(< ~counter~0 45)} is VALID [2022-04-15 15:13:18,548 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20653#true} {21066#(< ~counter~0 45)} #96#return; {21066#(< ~counter~0 45)} is VALID [2022-04-15 15:13:18,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,549 INFO L272 TraceCheckUtils]: 27: Hoare triple {21066#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:18,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {21066#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {21066#(< ~counter~0 45)} is VALID [2022-04-15 15:13:18,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {21091#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21066#(< ~counter~0 45)} is VALID [2022-04-15 15:13:18,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {21091#(< ~counter~0 44)} assume !!(0 != ~r~0); {21091#(< ~counter~0 44)} is VALID [2022-04-15 15:13:18,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20653#true} {21091#(< ~counter~0 44)} #94#return; {21091#(< ~counter~0 44)} is VALID [2022-04-15 15:13:18,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,550 INFO L272 TraceCheckUtils]: 19: Hoare triple {21091#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:18,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {21091#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {21091#(< ~counter~0 44)} is VALID [2022-04-15 15:13:18,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {21116#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21091#(< ~counter~0 44)} is VALID [2022-04-15 15:13:18,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {21116#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,552 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20653#true} {21116#(< ~counter~0 43)} #92#return; {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {21116#(< ~counter~0 43)} call assume_abort_if_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-15 15:13:18,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20653#true} {21116#(< ~counter~0 43)} #90#return; {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {20653#true} assume true; {20653#true} is VALID [2022-04-15 15:13:18,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {20653#true} assume !(0 == ~cond); {20653#true} is VALID [2022-04-15 15:13:18,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {20653#true} ~cond := #in~cond; {20653#true} is VALID [2022-04-15 15:13:18,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {21116#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20653#true} is VALID [2022-04-15 15:13:18,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {21116#(< ~counter~0 43)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 43)} is VALID [2022-04-15 15:13:18,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {21116#(< ~counter~0 43)} call #t~ret9 := main(); {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21116#(< ~counter~0 43)} {20653#true} #102#return; {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {21116#(< ~counter~0 43)} assume true; {21116#(< ~counter~0 43)} is VALID [2022-04-15 15:13:18,555 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 43)} is VALID [2022-04-15 15:13:18,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {20653#true} call ULTIMATE.init(); {20653#true} is VALID [2022-04-15 15:13:18,555 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-15 15:13:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398689146] [2022-04-15 15:13:18,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487386468] [2022-04-15 15:13:18,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487386468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:18,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:18,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:13:18,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:18,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614108183] [2022-04-15 15:13:18,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614108183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:18,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:18,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:13:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955230140] [2022-04-15 15:13:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:18,556 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-15 15:13:18,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:18,557 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-15 15:13:18,610 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-15 15:13:18,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:13:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:18,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:13:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:13:18,611 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-15 15:13:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,147 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-15 15:13:19,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:13:19,148 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-15 15:13:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:19,148 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-15 15:13:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:13:19,151 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-15 15:13:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:13:19,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-15 15:13:19,305 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-15 15:13:19,308 INFO L225 Difference]: With dead ends: 215 [2022-04-15 15:13:19,308 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 15:13:19,308 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-15 15:13:19,309 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-15 15:13:19,309 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-15 15:13:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 15:13:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-15 15:13:19,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:19,539 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-15 15:13:19,540 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-15 15:13:19,540 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-15 15:13:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,545 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 15:13:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 15:13:19,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:19,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:19,546 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-15 15:13:19,546 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-15 15:13:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:19,550 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 15:13:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 15:13:19,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:19,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:19,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:19,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:19,551 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-15 15:13:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-15 15:13:19,556 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-15 15:13:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:19,556 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-15 15:13:19,557 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-15 15:13:19,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-15 15:13:21,046 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-15 15:13:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 15:13:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 15:13:21,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:21,047 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-15 15:13:21,063 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-15 15:13:21,251 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-15 15:13:21,251 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-15 15:13:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554178123] [2022-04-15 15:13:21,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-15 15:13:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918783014] [2022-04-15 15:13:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:21,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:21,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360491866] [2022-04-15 15:13:21,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:21,265 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-15 15:13:21,265 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-15 15:13:21,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:21,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:21,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:13:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:21,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:21,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {22276#true} call ULTIMATE.init(); {22276#true} is VALID [2022-04-15 15:13:21,737 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-15 15:13:21,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22284#(<= ~counter~0 0)} {22276#true} #102#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {22284#(<= ~counter~0 0)} call #t~ret9 := main(); {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,738 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-15 15:13:21,739 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-15 15:13:21,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {22284#(<= ~counter~0 0)} ~cond := #in~cond; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {22284#(<= ~counter~0 0)} assume !(0 == ~cond); {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,740 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22284#(<= ~counter~0 0)} {22284#(<= ~counter~0 0)} #90#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,740 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-15 15:13:21,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {22284#(<= ~counter~0 0)} ~cond := #in~cond; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {22284#(<= ~counter~0 0)} assume !(0 == ~cond); {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {22284#(<= ~counter~0 0)} assume true; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,741 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22284#(<= ~counter~0 0)} {22284#(<= ~counter~0 0)} #92#return; {22284#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:21,742 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-15 15:13:21,742 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-15 15:13:21,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {22333#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,743 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-15 15:13:21,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {22333#(<= ~counter~0 1)} ~cond := #in~cond; {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {22333#(<= ~counter~0 1)} assume !(0 == ~cond); {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {22333#(<= ~counter~0 1)} assume true; {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,744 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22333#(<= ~counter~0 1)} {22333#(<= ~counter~0 1)} #94#return; {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#(<= ~counter~0 1)} assume !!(0 != ~r~0); {22333#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:21,745 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-15 15:13:21,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {22358#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,746 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-15 15:13:21,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {22358#(<= ~counter~0 2)} ~cond := #in~cond; {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {22358#(<= ~counter~0 2)} assume !(0 == ~cond); {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {22358#(<= ~counter~0 2)} assume true; {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,747 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22358#(<= ~counter~0 2)} {22358#(<= ~counter~0 2)} #96#return; {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {22358#(<= ~counter~0 2)} assume !(~r~0 > 0); {22358#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:21,748 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-15 15:13:21,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {22383#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {22383#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:21,749 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-15 15:13:21,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {22383#(<= ~counter~0 3)} ~cond := #in~cond; {22383#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:21,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {22383#(<= ~counter~0 3)} assume !(0 == ~cond); {22383#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:21,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {22383#(<= ~counter~0 3)} assume true; {22383#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:21,750 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22383#(<= ~counter~0 3)} {22383#(<= ~counter~0 3)} #98#return; {22383#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:21,750 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-15 15:13:21,751 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-15 15:13:21,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {22408#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,752 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-15 15:13:21,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {22408#(<= ~counter~0 4)} ~cond := #in~cond; {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {22408#(<= ~counter~0 4)} assume !(0 == ~cond); {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {22408#(<= ~counter~0 4)} assume true; {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,753 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22408#(<= ~counter~0 4)} {22408#(<= ~counter~0 4)} #98#return; {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {22408#(<= ~counter~0 4)} assume !(~r~0 < 0); {22408#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:21,754 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-15 15:13:21,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {22433#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,755 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-15 15:13:21,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {22433#(<= ~counter~0 5)} ~cond := #in~cond; {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {22433#(<= ~counter~0 5)} assume !(0 == ~cond); {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {22433#(<= ~counter~0 5)} assume true; {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,756 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22433#(<= ~counter~0 5)} {22433#(<= ~counter~0 5)} #94#return; {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {22433#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22433#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:21,757 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-15 15:13:21,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {22458#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {22458#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:21,757 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-15 15:13:21,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {22458#(<= ~counter~0 6)} ~cond := #in~cond; {22458#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:21,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {22458#(<= ~counter~0 6)} assume !(0 == ~cond); {22458#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:21,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {22458#(<= ~counter~0 6)} assume true; {22458#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:21,759 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22458#(<= ~counter~0 6)} {22458#(<= ~counter~0 6)} #96#return; {22458#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:21,759 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-15 15:13:21,760 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-15 15:13:21,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {22483#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,760 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-15 15:13:21,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {22483#(<= ~counter~0 7)} ~cond := #in~cond; {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {22483#(<= ~counter~0 7)} assume !(0 == ~cond); {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {22483#(<= ~counter~0 7)} assume true; {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,762 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22483#(<= ~counter~0 7)} {22483#(<= ~counter~0 7)} #96#return; {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,762 INFO L290 TraceCheckUtils]: 72: Hoare triple {22483#(<= ~counter~0 7)} assume !(~r~0 > 0); {22483#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:21,763 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-15 15:13:21,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {22508#(<= ~counter~0 8)} assume !!(#t~post8 < 50);havoc #t~post8; {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,763 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-15 15:13:21,764 INFO L290 TraceCheckUtils]: 76: Hoare triple {22508#(<= ~counter~0 8)} ~cond := #in~cond; {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,764 INFO L290 TraceCheckUtils]: 77: Hoare triple {22508#(<= ~counter~0 8)} assume !(0 == ~cond); {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,764 INFO L290 TraceCheckUtils]: 78: Hoare triple {22508#(<= ~counter~0 8)} assume true; {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,765 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22508#(<= ~counter~0 8)} {22508#(<= ~counter~0 8)} #98#return; {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,765 INFO L290 TraceCheckUtils]: 80: Hoare triple {22508#(<= ~counter~0 8)} assume !(~r~0 < 0); {22508#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:21,765 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-15 15:13:21,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {22533#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {22277#false} is VALID [2022-04-15 15:13:21,766 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-15 15:13:21,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {22277#false} ~cond := #in~cond; {22277#false} is VALID [2022-04-15 15:13:21,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {22277#false} assume 0 == ~cond; {22277#false} is VALID [2022-04-15 15:13:21,766 INFO L290 TraceCheckUtils]: 86: Hoare triple {22277#false} assume !false; {22277#false} is VALID [2022-04-15 15:13:21,766 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-15 15:13:21,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:22,233 INFO L290 TraceCheckUtils]: 86: Hoare triple {22277#false} assume !false; {22277#false} is VALID [2022-04-15 15:13:22,233 INFO L290 TraceCheckUtils]: 85: Hoare triple {22277#false} assume 0 == ~cond; {22277#false} is VALID [2022-04-15 15:13:22,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {22277#false} ~cond := #in~cond; {22277#false} is VALID [2022-04-15 15:13:22,233 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-15 15:13:22,234 INFO L290 TraceCheckUtils]: 82: Hoare triple {22561#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {22277#false} is VALID [2022-04-15 15:13:22,234 INFO L290 TraceCheckUtils]: 81: Hoare triple {22565#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22561#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:13:22,234 INFO L290 TraceCheckUtils]: 80: Hoare triple {22565#(< ~counter~0 50)} assume !(~r~0 < 0); {22565#(< ~counter~0 50)} is VALID [2022-04-15 15:13:22,235 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22276#true} {22565#(< ~counter~0 50)} #98#return; {22565#(< ~counter~0 50)} is VALID [2022-04-15 15:13:22,235 INFO L290 TraceCheckUtils]: 78: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,235 INFO L290 TraceCheckUtils]: 77: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,235 INFO L290 TraceCheckUtils]: 76: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,235 INFO L272 TraceCheckUtils]: 75: Hoare triple {22565#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:22,251 INFO L290 TraceCheckUtils]: 74: Hoare triple {22565#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {22565#(< ~counter~0 50)} is VALID [2022-04-15 15:13:22,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {22590#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22565#(< ~counter~0 50)} is VALID [2022-04-15 15:13:22,252 INFO L290 TraceCheckUtils]: 72: Hoare triple {22590#(< ~counter~0 49)} assume !(~r~0 > 0); {22590#(< ~counter~0 49)} is VALID [2022-04-15 15:13:22,253 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22276#true} {22590#(< ~counter~0 49)} #96#return; {22590#(< ~counter~0 49)} is VALID [2022-04-15 15:13:22,253 INFO L290 TraceCheckUtils]: 70: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,253 INFO L272 TraceCheckUtils]: 67: Hoare triple {22590#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:22,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {22590#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {22590#(< ~counter~0 49)} is VALID [2022-04-15 15:13:22,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {22615#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22590#(< ~counter~0 49)} is VALID [2022-04-15 15:13:22,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {22615#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22615#(< ~counter~0 48)} is VALID [2022-04-15 15:13:22,255 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22276#true} {22615#(< ~counter~0 48)} #96#return; {22615#(< ~counter~0 48)} is VALID [2022-04-15 15:13:22,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,255 INFO L290 TraceCheckUtils]: 61: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,255 INFO L272 TraceCheckUtils]: 59: Hoare triple {22615#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:22,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {22615#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {22615#(< ~counter~0 48)} is VALID [2022-04-15 15:13:22,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {22640#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22615#(< ~counter~0 48)} is VALID [2022-04-15 15:13:22,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {22640#(< ~counter~0 47)} assume !!(0 != ~r~0); {22640#(< ~counter~0 47)} is VALID [2022-04-15 15:13:22,257 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22276#true} {22640#(< ~counter~0 47)} #94#return; {22640#(< ~counter~0 47)} is VALID [2022-04-15 15:13:22,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,257 INFO L272 TraceCheckUtils]: 51: Hoare triple {22640#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:22,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {22640#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {22640#(< ~counter~0 47)} is VALID [2022-04-15 15:13:22,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {22665#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22640#(< ~counter~0 47)} is VALID [2022-04-15 15:13:22,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {22665#(< ~counter~0 46)} assume !(~r~0 < 0); {22665#(< ~counter~0 46)} is VALID [2022-04-15 15:13:22,259 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22276#true} {22665#(< ~counter~0 46)} #98#return; {22665#(< ~counter~0 46)} is VALID [2022-04-15 15:13:22,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,259 INFO L272 TraceCheckUtils]: 43: Hoare triple {22665#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:22,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {22665#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {22665#(< ~counter~0 46)} is VALID [2022-04-15 15:13:22,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {22690#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22665#(< ~counter~0 46)} is VALID [2022-04-15 15:13:22,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {22690#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22690#(< ~counter~0 45)} is VALID [2022-04-15 15:13:22,260 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22276#true} {22690#(< ~counter~0 45)} #98#return; {22690#(< ~counter~0 45)} is VALID [2022-04-15 15:13:22,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,261 INFO L272 TraceCheckUtils]: 35: Hoare triple {22690#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:22,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {22690#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {22690#(< ~counter~0 45)} is VALID [2022-04-15 15:13:22,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {22715#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22690#(< ~counter~0 45)} is VALID [2022-04-15 15:13:22,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {22715#(< ~counter~0 44)} assume !(~r~0 > 0); {22715#(< ~counter~0 44)} is VALID [2022-04-15 15:13:22,262 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22276#true} {22715#(< ~counter~0 44)} #96#return; {22715#(< ~counter~0 44)} is VALID [2022-04-15 15:13:22,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,262 INFO L272 TraceCheckUtils]: 27: Hoare triple {22715#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:22,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {22715#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {22715#(< ~counter~0 44)} is VALID [2022-04-15 15:13:22,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {22740#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22715#(< ~counter~0 44)} is VALID [2022-04-15 15:13:22,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {22740#(< ~counter~0 43)} assume !!(0 != ~r~0); {22740#(< ~counter~0 43)} is VALID [2022-04-15 15:13:22,264 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22276#true} {22740#(< ~counter~0 43)} #94#return; {22740#(< ~counter~0 43)} is VALID [2022-04-15 15:13:22,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {22740#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:22,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {22740#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {22740#(< ~counter~0 43)} is VALID [2022-04-15 15:13:22,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {22765#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22740#(< ~counter~0 43)} is VALID [2022-04-15 15:13:22,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {22765#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22276#true} {22765#(< ~counter~0 42)} #92#return; {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {22765#(< ~counter~0 42)} call assume_abort_if_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-15 15:13:22,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22276#true} {22765#(< ~counter~0 42)} #90#return; {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {22276#true} assume true; {22276#true} is VALID [2022-04-15 15:13:22,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {22276#true} assume !(0 == ~cond); {22276#true} is VALID [2022-04-15 15:13:22,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {22276#true} ~cond := #in~cond; {22276#true} is VALID [2022-04-15 15:13:22,267 INFO L272 TraceCheckUtils]: 6: Hoare triple {22765#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22276#true} is VALID [2022-04-15 15:13:22,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {22765#(< ~counter~0 42)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 42)} is VALID [2022-04-15 15:13:22,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {22765#(< ~counter~0 42)} call #t~ret9 := main(); {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22765#(< ~counter~0 42)} {22276#true} #102#return; {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {22765#(< ~counter~0 42)} assume true; {22765#(< ~counter~0 42)} is VALID [2022-04-15 15:13:22,268 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 42)} is VALID [2022-04-15 15:13:22,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {22276#true} call ULTIMATE.init(); {22276#true} is VALID [2022-04-15 15:13:22,269 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-15 15:13:22,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918783014] [2022-04-15 15:13:22,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360491866] [2022-04-15 15:13:22,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360491866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:22,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:22,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:13:22,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554178123] [2022-04-15 15:13:22,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554178123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:22,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:22,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:13:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509768308] [2022-04-15 15:13:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:22,270 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-15 15:13:22,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:22,271 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-15 15:13:22,330 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-15 15:13:22,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:13:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:13:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:13:22,331 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-15 15:13:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:23,041 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-15 15:13:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:13:23,042 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-15 15:13:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:23,042 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-15 15:13:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:13:23,046 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-15 15:13:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:13:23,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-15 15:13:23,211 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-15 15:13:23,214 INFO L225 Difference]: With dead ends: 188 [2022-04-15 15:13:23,214 INFO L226 Difference]: Without dead ends: 183 [2022-04-15 15:13:23,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-15 15:13:23,215 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-15 15:13:23,215 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-15 15:13:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-15 15:13:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-15 15:13:23,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:23,447 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-15 15:13:23,447 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-15 15:13:23,447 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-15 15:13:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:23,452 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-15 15:13:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-15 15:13:23,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:23,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:23,453 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-15 15:13:23,454 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-15 15:13:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:23,457 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-15 15:13:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-15 15:13:23,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:23,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:23,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:23,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:23,458 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-15 15:13:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-15 15:13:23,462 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-15 15:13:23,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:23,463 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-15 15:13:23,463 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-15 15:13:23,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-15 15:13:25,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 15:13:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:13:25,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:25,032 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-15 15:13:25,057 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-15 15:13:25,254 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-15 15:13:25,255 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-15 15:13:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:25,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036267529] [2022-04-15 15:13:25,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-15 15:13:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179704740] [2022-04-15 15:13:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:25,266 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772295769] [2022-04-15 15:13:25,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:25,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:25,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:25,268 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-15 15:13:25,279 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-15 15:13:25,319 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:25,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:25,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 15:13:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:25,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:25,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {23925#true} call ULTIMATE.init(); {23925#true} is VALID [2022-04-15 15:13:25,557 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-15 15:13:25,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23925#true} {23925#true} #102#return; {23925#true} is VALID [2022-04-15 15:13:25,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {23925#true} call #t~ret9 := main(); {23925#true} is VALID [2022-04-15 15:13:25,557 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-15 15:13:25,557 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-15 15:13:25,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23925#true} {23925#true} #90#return; {23925#true} is VALID [2022-04-15 15:13:25,558 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-15 15:13:25,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,558 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23925#true} {23925#true} #92#return; {23925#true} is VALID [2022-04-15 15:13:25,558 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-15 15:13:25,559 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-15 15:13:25,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,559 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-15 15:13:25,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,560 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,561 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-15 15:13:25,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,562 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-15 15:13:25,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,562 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 > 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,563 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-15 15:13:25,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,563 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-15 15:13:25,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,564 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,564 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-15 15:13:25,565 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-15 15:13:25,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,565 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-15 15:13:25,565 INFO L290 TraceCheckUtils]: 44: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,566 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 < 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,567 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-15 15:13:25,567 INFO L290 TraceCheckUtils]: 50: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,567 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-15 15:13:25,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,568 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,568 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-15 15:13:25,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,569 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-15 15:13:25,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,569 INFO L290 TraceCheckUtils]: 62: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,569 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,570 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-15 15:13:25,570 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-15 15:13:25,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:13:25,571 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-15 15:13:25,571 INFO L290 TraceCheckUtils]: 68: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,571 INFO L290 TraceCheckUtils]: 69: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,571 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,571 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-15 15:13:25,572 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-15 15:13:25,572 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-15 15:13:25,572 INFO L290 TraceCheckUtils]: 74: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:13:25,572 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-15 15:13:25,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,573 INFO L290 TraceCheckUtils]: 77: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,573 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-15 15:13:25,574 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-15 15:13:25,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {23926#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23926#false} is VALID [2022-04-15 15:13:25,574 INFO L290 TraceCheckUtils]: 82: Hoare triple {23926#false} assume !(#t~post8 < 50);havoc #t~post8; {23926#false} is VALID [2022-04-15 15:13:25,574 INFO L290 TraceCheckUtils]: 83: Hoare triple {23926#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23926#false} is VALID [2022-04-15 15:13:25,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {23926#false} assume !(#t~post6 < 50);havoc #t~post6; {23926#false} is VALID [2022-04-15 15:13:25,574 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-15 15:13:25,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {23926#false} ~cond := #in~cond; {23926#false} is VALID [2022-04-15 15:13:25,574 INFO L290 TraceCheckUtils]: 87: Hoare triple {23926#false} assume 0 == ~cond; {23926#false} is VALID [2022-04-15 15:13:25,574 INFO L290 TraceCheckUtils]: 88: Hoare triple {23926#false} assume !false; {23926#false} is VALID [2022-04-15 15:13:25,575 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-15 15:13:25,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:25,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {23926#false} assume !false; {23926#false} is VALID [2022-04-15 15:13:25,817 INFO L290 TraceCheckUtils]: 87: Hoare triple {23926#false} assume 0 == ~cond; {23926#false} is VALID [2022-04-15 15:13:25,817 INFO L290 TraceCheckUtils]: 86: Hoare triple {23926#false} ~cond := #in~cond; {23926#false} is VALID [2022-04-15 15:13:25,817 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-15 15:13:25,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {23926#false} assume !(#t~post6 < 50);havoc #t~post6; {23926#false} is VALID [2022-04-15 15:13:25,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {23926#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23926#false} is VALID [2022-04-15 15:13:25,817 INFO L290 TraceCheckUtils]: 82: Hoare triple {23926#false} assume !(#t~post8 < 50);havoc #t~post8; {23926#false} is VALID [2022-04-15 15:13:25,818 INFO L290 TraceCheckUtils]: 81: Hoare triple {23926#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23926#false} is VALID [2022-04-15 15:13:25,818 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-15 15:13:25,819 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-15 15:13:25,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,819 INFO L290 TraceCheckUtils]: 77: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,819 INFO L290 TraceCheckUtils]: 76: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,819 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-15 15:13:25,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:13:25,820 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-15 15:13:25,820 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-15 15:13:25,821 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-15 15:13:25,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,821 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-15 15:13:25,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {24123#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {24123#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:13:25,821 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-15 15:13:25,822 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-15 15:13:25,831 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,831 INFO L290 TraceCheckUtils]: 62: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,832 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-15 15:13:25,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,832 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-15 15:13:25,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,833 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,834 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-15 15:13:25,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,835 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-15 15:13:25,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 < 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,836 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,836 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-15 15:13:25,836 INFO L290 TraceCheckUtils]: 42: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,837 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-15 15:13:25,837 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-15 15:13:25,838 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #98#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,838 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-15 15:13:25,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,839 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-15 15:13:25,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {23978#(<= main_~v~0 1)} assume !(~r~0 > 0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #96#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,840 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-15 15:13:25,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,841 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-15 15:13:25,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {23978#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23925#true} {23978#(<= main_~v~0 1)} #94#return; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,842 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-15 15:13:25,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {23978#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {23978#(<= main_~v~0 1)} is VALID [2022-04-15 15:13:25,843 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-15 15:13:25,843 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-15 15:13:25,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23925#true} {23925#true} #92#return; {23925#true} is VALID [2022-04-15 15:13:25,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,844 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-15 15:13:25,844 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23925#true} {23925#true} #90#return; {23925#true} is VALID [2022-04-15 15:13:25,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {23925#true} assume !(0 == ~cond); {23925#true} is VALID [2022-04-15 15:13:25,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {23925#true} ~cond := #in~cond; {23925#true} is VALID [2022-04-15 15:13:25,844 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-15 15:13:25,844 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-15 15:13:25,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {23925#true} call #t~ret9 := main(); {23925#true} is VALID [2022-04-15 15:13:25,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23925#true} {23925#true} #102#return; {23925#true} is VALID [2022-04-15 15:13:25,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {23925#true} assume true; {23925#true} is VALID [2022-04-15 15:13:25,845 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-15 15:13:25,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {23925#true} call ULTIMATE.init(); {23925#true} is VALID [2022-04-15 15:13:25,845 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-15 15:13:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:25,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179704740] [2022-04-15 15:13:25,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772295769] [2022-04-15 15:13:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772295769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:25,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 15:13:25,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036267529] [2022-04-15 15:13:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036267529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:13:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185939013] [2022-04-15 15:13:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:25,847 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-15 15:13:25,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:25,847 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-15 15:13:25,885 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-15 15:13:25,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:13:25,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:13:25,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:13:25,885 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-15 15:13:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:26,510 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-15 15:13:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:13:26,511 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-15 15:13:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:26,511 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-15 15:13:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:13:26,512 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-15 15:13:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:13:26,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-15 15:13:26,623 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-15 15:13:26,630 INFO L225 Difference]: With dead ends: 407 [2022-04-15 15:13:26,630 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 15:13:26,631 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-15 15:13:26,633 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-15 15:13:26,633 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-15 15:13:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 15:13:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-15 15:13:27,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:27,067 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-15 15:13:27,068 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-15 15:13:27,068 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-15 15:13:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:27,075 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-15 15:13:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-15 15:13:27,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:27,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:27,077 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-15 15:13:27,078 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-15 15:13:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:27,085 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-15 15:13:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-15 15:13:27,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:27,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:27,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:27,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:27,087 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-15 15:13:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-15 15:13:27,095 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-15 15:13:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:27,095 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-15 15:13:27,095 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-15 15:13:27,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-15 15:13:29,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 394 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-15 15:13:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:13:29,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:29,614 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-15 15:13:29,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 15:13:29,815 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-15 15:13:29,815 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-15 15:13:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:29,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856123965] [2022-04-15 15:13:29,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-15 15:13:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:29,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936748300] [2022-04-15 15:13:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:29,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:29,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1264153320] [2022-04-15 15:13:29,831 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:13:29,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:29,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:29,832 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-15 15:13:29,863 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-15 15:13:29,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:13:29,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:29,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:13:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:29,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:30,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {26472#true} call ULTIMATE.init(); {26472#true} is VALID [2022-04-15 15:13:30,520 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-15 15:13:30,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26480#(<= ~counter~0 0)} {26472#true} #102#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {26480#(<= ~counter~0 0)} call #t~ret9 := main(); {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,524 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-15 15:13:30,524 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-15 15:13:30,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {26480#(<= ~counter~0 0)} ~cond := #in~cond; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {26480#(<= ~counter~0 0)} assume !(0 == ~cond); {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26480#(<= ~counter~0 0)} {26480#(<= ~counter~0 0)} #90#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,526 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-15 15:13:30,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {26480#(<= ~counter~0 0)} ~cond := #in~cond; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {26480#(<= ~counter~0 0)} assume !(0 == ~cond); {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {26480#(<= ~counter~0 0)} assume true; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26480#(<= ~counter~0 0)} {26480#(<= ~counter~0 0)} #92#return; {26480#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:30,527 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-15 15:13:30,528 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-15 15:13:30,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {26529#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,529 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-15 15:13:30,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {26529#(<= ~counter~0 1)} ~cond := #in~cond; {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {26529#(<= ~counter~0 1)} assume !(0 == ~cond); {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {26529#(<= ~counter~0 1)} assume true; {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,533 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26529#(<= ~counter~0 1)} {26529#(<= ~counter~0 1)} #94#return; {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {26529#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26529#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:30,535 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-15 15:13:30,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {26554#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,536 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-15 15:13:30,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {26554#(<= ~counter~0 2)} ~cond := #in~cond; {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {26554#(<= ~counter~0 2)} assume !(0 == ~cond); {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {26554#(<= ~counter~0 2)} assume true; {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,537 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26554#(<= ~counter~0 2)} {26554#(<= ~counter~0 2)} #96#return; {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {26554#(<= ~counter~0 2)} assume !(~r~0 > 0); {26554#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:30,538 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-15 15:13:30,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {26579#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {26579#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:30,539 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-15 15:13:30,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {26579#(<= ~counter~0 3)} ~cond := #in~cond; {26579#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:30,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {26579#(<= ~counter~0 3)} assume !(0 == ~cond); {26579#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:30,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {26579#(<= ~counter~0 3)} assume true; {26579#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:30,540 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26579#(<= ~counter~0 3)} {26579#(<= ~counter~0 3)} #98#return; {26579#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:30,541 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-15 15:13:30,541 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-15 15:13:30,541 INFO L290 TraceCheckUtils]: 42: Hoare triple {26604#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,542 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-15 15:13:30,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {26604#(<= ~counter~0 4)} ~cond := #in~cond; {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {26604#(<= ~counter~0 4)} assume !(0 == ~cond); {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {26604#(<= ~counter~0 4)} assume true; {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,543 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26604#(<= ~counter~0 4)} {26604#(<= ~counter~0 4)} #98#return; {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {26604#(<= ~counter~0 4)} assume !(~r~0 < 0); {26604#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:30,544 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-15 15:13:30,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {26629#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,545 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-15 15:13:30,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {26629#(<= ~counter~0 5)} ~cond := #in~cond; {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {26629#(<= ~counter~0 5)} assume !(0 == ~cond); {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,546 INFO L290 TraceCheckUtils]: 54: Hoare triple {26629#(<= ~counter~0 5)} assume true; {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,546 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26629#(<= ~counter~0 5)} {26629#(<= ~counter~0 5)} #94#return; {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {26629#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26629#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:30,547 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-15 15:13:30,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {26654#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {26654#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:30,548 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-15 15:13:30,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {26654#(<= ~counter~0 6)} ~cond := #in~cond; {26654#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:30,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {26654#(<= ~counter~0 6)} assume !(0 == ~cond); {26654#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:30,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {26654#(<= ~counter~0 6)} assume true; {26654#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:30,549 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26654#(<= ~counter~0 6)} {26654#(<= ~counter~0 6)} #96#return; {26654#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:30,549 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-15 15:13:30,550 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-15 15:13:30,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {26679#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {26679#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:30,552 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-15 15:13:30,552 INFO L290 TraceCheckUtils]: 68: Hoare triple {26679#(<= ~counter~0 7)} ~cond := #in~cond; {26679#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:30,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {26679#(<= ~counter~0 7)} assume !(0 == ~cond); {26679#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:30,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {26679#(<= ~counter~0 7)} assume true; {26679#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:30,554 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26679#(<= ~counter~0 7)} {26679#(<= ~counter~0 7)} #96#return; {26679#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:30,554 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-15 15:13:30,554 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-15 15:13:30,555 INFO L290 TraceCheckUtils]: 74: Hoare triple {26704#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,555 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-15 15:13:30,555 INFO L290 TraceCheckUtils]: 76: Hoare triple {26704#(<= ~counter~0 8)} ~cond := #in~cond; {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,556 INFO L290 TraceCheckUtils]: 77: Hoare triple {26704#(<= ~counter~0 8)} assume !(0 == ~cond); {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,556 INFO L290 TraceCheckUtils]: 78: Hoare triple {26704#(<= ~counter~0 8)} assume true; {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,557 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26704#(<= ~counter~0 8)} {26704#(<= ~counter~0 8)} #96#return; {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,557 INFO L290 TraceCheckUtils]: 80: Hoare triple {26704#(<= ~counter~0 8)} assume !(~r~0 > 0); {26704#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:30,557 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-15 15:13:30,558 INFO L290 TraceCheckUtils]: 82: Hoare triple {26729#(<= ~counter~0 9)} assume !(#t~post8 < 50);havoc #t~post8; {26729#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:30,558 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-15 15:13:30,558 INFO L290 TraceCheckUtils]: 84: Hoare triple {26736#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {26473#false} is VALID [2022-04-15 15:13:30,558 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-15 15:13:30,558 INFO L290 TraceCheckUtils]: 86: Hoare triple {26473#false} ~cond := #in~cond; {26473#false} is VALID [2022-04-15 15:13:30,558 INFO L290 TraceCheckUtils]: 87: Hoare triple {26473#false} assume 0 == ~cond; {26473#false} is VALID [2022-04-15 15:13:30,559 INFO L290 TraceCheckUtils]: 88: Hoare triple {26473#false} assume !false; {26473#false} is VALID [2022-04-15 15:13:30,559 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-15 15:13:30,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:31,063 INFO L290 TraceCheckUtils]: 88: Hoare triple {26473#false} assume !false; {26473#false} is VALID [2022-04-15 15:13:31,064 INFO L290 TraceCheckUtils]: 87: Hoare triple {26473#false} assume 0 == ~cond; {26473#false} is VALID [2022-04-15 15:13:31,064 INFO L290 TraceCheckUtils]: 86: Hoare triple {26473#false} ~cond := #in~cond; {26473#false} is VALID [2022-04-15 15:13:31,064 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-15 15:13:31,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {26764#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {26473#false} is VALID [2022-04-15 15:13:31,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {26768#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26764#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:13:31,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {26768#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {26768#(< ~counter~0 50)} is VALID [2022-04-15 15:13:31,067 INFO L290 TraceCheckUtils]: 81: Hoare triple {26775#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26768#(< ~counter~0 50)} is VALID [2022-04-15 15:13:31,067 INFO L290 TraceCheckUtils]: 80: Hoare triple {26775#(< ~counter~0 49)} assume !(~r~0 > 0); {26775#(< ~counter~0 49)} is VALID [2022-04-15 15:13:31,068 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26472#true} {26775#(< ~counter~0 49)} #96#return; {26775#(< ~counter~0 49)} is VALID [2022-04-15 15:13:31,068 INFO L290 TraceCheckUtils]: 78: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,068 INFO L290 TraceCheckUtils]: 77: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,068 INFO L272 TraceCheckUtils]: 75: Hoare triple {26775#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:31,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {26775#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {26775#(< ~counter~0 49)} is VALID [2022-04-15 15:13:31,069 INFO L290 TraceCheckUtils]: 73: Hoare triple {26800#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26775#(< ~counter~0 49)} is VALID [2022-04-15 15:13:31,069 INFO L290 TraceCheckUtils]: 72: Hoare triple {26800#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26800#(< ~counter~0 48)} is VALID [2022-04-15 15:13:31,070 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26472#true} {26800#(< ~counter~0 48)} #96#return; {26800#(< ~counter~0 48)} is VALID [2022-04-15 15:13:31,070 INFO L290 TraceCheckUtils]: 70: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,070 INFO L290 TraceCheckUtils]: 69: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,070 INFO L290 TraceCheckUtils]: 68: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,070 INFO L272 TraceCheckUtils]: 67: Hoare triple {26800#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:31,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {26800#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {26800#(< ~counter~0 48)} is VALID [2022-04-15 15:13:31,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {26825#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26800#(< ~counter~0 48)} is VALID [2022-04-15 15:13:31,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {26825#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26825#(< ~counter~0 47)} is VALID [2022-04-15 15:13:31,072 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26472#true} {26825#(< ~counter~0 47)} #96#return; {26825#(< ~counter~0 47)} is VALID [2022-04-15 15:13:31,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,072 INFO L272 TraceCheckUtils]: 59: Hoare triple {26825#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:31,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {26825#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {26825#(< ~counter~0 47)} is VALID [2022-04-15 15:13:31,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {26850#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26825#(< ~counter~0 47)} is VALID [2022-04-15 15:13:31,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {26850#(< ~counter~0 46)} assume !!(0 != ~r~0); {26850#(< ~counter~0 46)} is VALID [2022-04-15 15:13:31,074 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26472#true} {26850#(< ~counter~0 46)} #94#return; {26850#(< ~counter~0 46)} is VALID [2022-04-15 15:13:31,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,074 INFO L272 TraceCheckUtils]: 51: Hoare triple {26850#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:31,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {26850#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {26850#(< ~counter~0 46)} is VALID [2022-04-15 15:13:31,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {26875#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26850#(< ~counter~0 46)} is VALID [2022-04-15 15:13:31,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {26875#(< ~counter~0 45)} assume !(~r~0 < 0); {26875#(< ~counter~0 45)} is VALID [2022-04-15 15:13:31,075 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26472#true} {26875#(< ~counter~0 45)} #98#return; {26875#(< ~counter~0 45)} is VALID [2022-04-15 15:13:31,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,076 INFO L272 TraceCheckUtils]: 43: Hoare triple {26875#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:31,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {26875#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {26875#(< ~counter~0 45)} is VALID [2022-04-15 15:13:31,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {26900#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26875#(< ~counter~0 45)} is VALID [2022-04-15 15:13:31,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {26900#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26900#(< ~counter~0 44)} is VALID [2022-04-15 15:13:31,077 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26472#true} {26900#(< ~counter~0 44)} #98#return; {26900#(< ~counter~0 44)} is VALID [2022-04-15 15:13:31,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,078 INFO L272 TraceCheckUtils]: 35: Hoare triple {26900#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:31,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {26900#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {26900#(< ~counter~0 44)} is VALID [2022-04-15 15:13:31,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {26925#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26900#(< ~counter~0 44)} is VALID [2022-04-15 15:13:31,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {26925#(< ~counter~0 43)} assume !(~r~0 > 0); {26925#(< ~counter~0 43)} is VALID [2022-04-15 15:13:31,079 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26472#true} {26925#(< ~counter~0 43)} #96#return; {26925#(< ~counter~0 43)} is VALID [2022-04-15 15:13:31,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,079 INFO L272 TraceCheckUtils]: 27: Hoare triple {26925#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:31,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {26925#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {26925#(< ~counter~0 43)} is VALID [2022-04-15 15:13:31,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {26950#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26925#(< ~counter~0 43)} is VALID [2022-04-15 15:13:31,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {26950#(< ~counter~0 42)} assume !!(0 != ~r~0); {26950#(< ~counter~0 42)} is VALID [2022-04-15 15:13:31,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26472#true} {26950#(< ~counter~0 42)} #94#return; {26950#(< ~counter~0 42)} is VALID [2022-04-15 15:13:31,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,081 INFO L272 TraceCheckUtils]: 19: Hoare triple {26950#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:13:31,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {26950#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {26950#(< ~counter~0 42)} is VALID [2022-04-15 15:13:31,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {26975#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26950#(< ~counter~0 42)} is VALID [2022-04-15 15:13:31,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {26975#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26472#true} {26975#(< ~counter~0 41)} #92#return; {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {26975#(< ~counter~0 41)} call assume_abort_if_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-15 15:13:31,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26472#true} {26975#(< ~counter~0 41)} #90#return; {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {26472#true} assume true; {26472#true} is VALID [2022-04-15 15:13:31,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {26472#true} assume !(0 == ~cond); {26472#true} is VALID [2022-04-15 15:13:31,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {26472#true} ~cond := #in~cond; {26472#true} is VALID [2022-04-15 15:13:31,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {26975#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26472#true} is VALID [2022-04-15 15:13:31,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {26975#(< ~counter~0 41)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 41)} is VALID [2022-04-15 15:13:31,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {26975#(< ~counter~0 41)} call #t~ret9 := main(); {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26975#(< ~counter~0 41)} {26472#true} #102#return; {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {26975#(< ~counter~0 41)} assume true; {26975#(< ~counter~0 41)} is VALID [2022-04-15 15:13:31,085 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 41)} is VALID [2022-04-15 15:13:31,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {26472#true} call ULTIMATE.init(); {26472#true} is VALID [2022-04-15 15:13:31,086 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-15 15:13:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:31,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936748300] [2022-04-15 15:13:31,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:31,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264153320] [2022-04-15 15:13:31,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264153320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:31,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:31,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:13:31,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:31,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856123965] [2022-04-15 15:13:31,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856123965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:31,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:31,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:13:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007913175] [2022-04-15 15:13:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:31,087 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-15 15:13:31,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:31,088 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-15 15:13:31,177 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-15 15:13:31,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:13:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:31,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:13:31,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:13:31,178 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-15 15:13:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:32,302 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-15 15:13:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:13:32,302 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-15 15:13:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:32,302 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-15 15:13:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:13:32,304 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-15 15:13:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:13:32,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:13:32,481 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-15 15:13:32,491 INFO L225 Difference]: With dead ends: 362 [2022-04-15 15:13:32,491 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 15:13:32,491 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-15 15:13:32,492 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-15 15:13:32,493 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-15 15:13:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 15:13:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-15 15:13:32,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:33,000 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-15 15:13:33,000 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-15 15:13:33,000 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-15 15:13:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:33,009 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-15 15:13:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-15 15:13:33,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:33,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:33,010 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-15 15:13:33,010 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-15 15:13:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:33,019 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-15 15:13:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-15 15:13:33,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:33,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:33,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:33,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:33,021 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-15 15:13:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-15 15:13:33,030 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-15 15:13:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:33,031 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-15 15:13:33,031 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-15 15:13:33,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-15 15:13:33,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-15 15:13:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 15:13:33,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:33,976 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-15 15:13:33,983 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-15 15:13:34,183 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-15 15:13:34,183 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-15 15:13:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [425432690] [2022-04-15 15:13:34,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-15 15:13:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:34,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043749472] [2022-04-15 15:13:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:34,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:34,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968716386] [2022-04-15 15:13:34,195 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:13:34,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:34,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:34,197 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-15 15:13:34,197 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-15 15:13:34,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:13:34,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:34,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:13:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:34,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:34,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {29163#true} call ULTIMATE.init(); {29163#true} is VALID [2022-04-15 15:13:34,775 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-15 15:13:34,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29171#(<= ~counter~0 0)} {29163#true} #102#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {29171#(<= ~counter~0 0)} call #t~ret9 := main(); {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,776 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-15 15:13:34,777 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-15 15:13:34,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {29171#(<= ~counter~0 0)} ~cond := #in~cond; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {29171#(<= ~counter~0 0)} assume !(0 == ~cond); {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29171#(<= ~counter~0 0)} {29171#(<= ~counter~0 0)} #90#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,778 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-15 15:13:34,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {29171#(<= ~counter~0 0)} ~cond := #in~cond; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {29171#(<= ~counter~0 0)} assume !(0 == ~cond); {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {29171#(<= ~counter~0 0)} assume true; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,779 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29171#(<= ~counter~0 0)} {29171#(<= ~counter~0 0)} #92#return; {29171#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:34,780 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-15 15:13:34,781 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-15 15:13:34,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {29220#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,781 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-15 15:13:34,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {29220#(<= ~counter~0 1)} ~cond := #in~cond; {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {29220#(<= ~counter~0 1)} assume !(0 == ~cond); {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {29220#(<= ~counter~0 1)} assume true; {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,783 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29220#(<= ~counter~0 1)} {29220#(<= ~counter~0 1)} #94#return; {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {29220#(<= ~counter~0 1)} assume !!(0 != ~r~0); {29220#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:34,783 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-15 15:13:34,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {29245#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,784 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-15 15:13:34,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {29245#(<= ~counter~0 2)} ~cond := #in~cond; {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {29245#(<= ~counter~0 2)} assume !(0 == ~cond); {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {29245#(<= ~counter~0 2)} assume true; {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,786 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29245#(<= ~counter~0 2)} {29245#(<= ~counter~0 2)} #96#return; {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {29245#(<= ~counter~0 2)} assume !(~r~0 > 0); {29245#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:34,786 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-15 15:13:34,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {29270#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {29270#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,787 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-15 15:13:34,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {29270#(<= ~counter~0 3)} ~cond := #in~cond; {29270#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {29270#(<= ~counter~0 3)} assume !(0 == ~cond); {29270#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {29270#(<= ~counter~0 3)} assume true; {29270#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,789 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29270#(<= ~counter~0 3)} {29270#(<= ~counter~0 3)} #98#return; {29270#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:34,789 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-15 15:13:34,789 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-15 15:13:34,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {29295#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,791 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-15 15:13:34,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {29295#(<= ~counter~0 4)} ~cond := #in~cond; {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {29295#(<= ~counter~0 4)} assume !(0 == ~cond); {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {29295#(<= ~counter~0 4)} assume true; {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,792 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29295#(<= ~counter~0 4)} {29295#(<= ~counter~0 4)} #98#return; {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {29295#(<= ~counter~0 4)} assume !(~r~0 < 0); {29295#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:34,800 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-15 15:13:34,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {29320#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,801 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-15 15:13:34,801 INFO L290 TraceCheckUtils]: 52: Hoare triple {29320#(<= ~counter~0 5)} ~cond := #in~cond; {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {29320#(<= ~counter~0 5)} assume !(0 == ~cond); {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {29320#(<= ~counter~0 5)} assume true; {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,802 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29320#(<= ~counter~0 5)} {29320#(<= ~counter~0 5)} #94#return; {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,803 INFO L290 TraceCheckUtils]: 56: Hoare triple {29320#(<= ~counter~0 5)} assume !!(0 != ~r~0); {29320#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:34,803 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-15 15:13:34,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {29345#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {29345#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,804 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-15 15:13:34,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {29345#(<= ~counter~0 6)} ~cond := #in~cond; {29345#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {29345#(<= ~counter~0 6)} assume !(0 == ~cond); {29345#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {29345#(<= ~counter~0 6)} assume true; {29345#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,806 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29345#(<= ~counter~0 6)} {29345#(<= ~counter~0 6)} #96#return; {29345#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:34,807 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-15 15:13:34,807 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-15 15:13:34,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {29370#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {29370#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:34,808 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-15 15:13:34,808 INFO L290 TraceCheckUtils]: 68: Hoare triple {29370#(<= ~counter~0 7)} ~cond := #in~cond; {29370#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:34,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {29370#(<= ~counter~0 7)} assume !(0 == ~cond); {29370#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:34,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {29370#(<= ~counter~0 7)} assume true; {29370#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:34,809 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29370#(<= ~counter~0 7)} {29370#(<= ~counter~0 7)} #96#return; {29370#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:34,810 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-15 15:13:34,810 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-15 15:13:34,810 INFO L290 TraceCheckUtils]: 74: Hoare triple {29395#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {29395#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:34,811 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-15 15:13:34,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {29395#(<= ~counter~0 8)} ~cond := #in~cond; {29395#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:34,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {29395#(<= ~counter~0 8)} assume !(0 == ~cond); {29395#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:34,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {29395#(<= ~counter~0 8)} assume true; {29395#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:34,812 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29395#(<= ~counter~0 8)} {29395#(<= ~counter~0 8)} #96#return; {29395#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:34,813 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-15 15:13:34,813 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-15 15:13:34,813 INFO L290 TraceCheckUtils]: 82: Hoare triple {29420#(<= |main_#t~post7| 8)} assume !(#t~post7 < 50);havoc #t~post7; {29164#false} is VALID [2022-04-15 15:13:34,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {29164#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29164#false} is VALID [2022-04-15 15:13:34,813 INFO L290 TraceCheckUtils]: 84: Hoare triple {29164#false} assume !(#t~post8 < 50);havoc #t~post8; {29164#false} is VALID [2022-04-15 15:13:34,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {29164#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29164#false} is VALID [2022-04-15 15:13:34,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {29164#false} assume !(#t~post6 < 50);havoc #t~post6; {29164#false} is VALID [2022-04-15 15:13:34,814 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-15 15:13:34,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {29164#false} ~cond := #in~cond; {29164#false} is VALID [2022-04-15 15:13:34,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {29164#false} assume 0 == ~cond; {29164#false} is VALID [2022-04-15 15:13:34,814 INFO L290 TraceCheckUtils]: 90: Hoare triple {29164#false} assume !false; {29164#false} is VALID [2022-04-15 15:13:34,814 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-15 15:13:34,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:35,310 INFO L290 TraceCheckUtils]: 90: Hoare triple {29164#false} assume !false; {29164#false} is VALID [2022-04-15 15:13:35,311 INFO L290 TraceCheckUtils]: 89: Hoare triple {29164#false} assume 0 == ~cond; {29164#false} is VALID [2022-04-15 15:13:35,311 INFO L290 TraceCheckUtils]: 88: Hoare triple {29164#false} ~cond := #in~cond; {29164#false} is VALID [2022-04-15 15:13:35,311 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-15 15:13:35,311 INFO L290 TraceCheckUtils]: 86: Hoare triple {29164#false} assume !(#t~post6 < 50);havoc #t~post6; {29164#false} is VALID [2022-04-15 15:13:35,311 INFO L290 TraceCheckUtils]: 85: Hoare triple {29164#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29164#false} is VALID [2022-04-15 15:13:35,311 INFO L290 TraceCheckUtils]: 84: Hoare triple {29164#false} assume !(#t~post8 < 50);havoc #t~post8; {29164#false} is VALID [2022-04-15 15:13:35,311 INFO L290 TraceCheckUtils]: 83: Hoare triple {29164#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29164#false} is VALID [2022-04-15 15:13:35,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {29472#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {29164#false} is VALID [2022-04-15 15:13:35,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {29476#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29472#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:13:35,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {29476#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29476#(< ~counter~0 50)} is VALID [2022-04-15 15:13:35,313 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29163#true} {29476#(< ~counter~0 50)} #96#return; {29476#(< ~counter~0 50)} is VALID [2022-04-15 15:13:35,314 INFO L290 TraceCheckUtils]: 78: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,314 INFO L290 TraceCheckUtils]: 77: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,314 INFO L272 TraceCheckUtils]: 75: Hoare triple {29476#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:35,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {29476#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {29476#(< ~counter~0 50)} is VALID [2022-04-15 15:13:35,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {29501#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29476#(< ~counter~0 50)} is VALID [2022-04-15 15:13:35,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {29501#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29501#(< ~counter~0 49)} is VALID [2022-04-15 15:13:35,316 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29163#true} {29501#(< ~counter~0 49)} #96#return; {29501#(< ~counter~0 49)} is VALID [2022-04-15 15:13:35,317 INFO L290 TraceCheckUtils]: 70: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,317 INFO L290 TraceCheckUtils]: 69: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,317 INFO L290 TraceCheckUtils]: 68: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,317 INFO L272 TraceCheckUtils]: 67: Hoare triple {29501#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:35,317 INFO L290 TraceCheckUtils]: 66: Hoare triple {29501#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {29501#(< ~counter~0 49)} is VALID [2022-04-15 15:13:35,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {29526#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29501#(< ~counter~0 49)} is VALID [2022-04-15 15:13:35,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {29526#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29526#(< ~counter~0 48)} is VALID [2022-04-15 15:13:35,319 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29163#true} {29526#(< ~counter~0 48)} #96#return; {29526#(< ~counter~0 48)} is VALID [2022-04-15 15:13:35,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,320 INFO L272 TraceCheckUtils]: 59: Hoare triple {29526#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:35,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {29526#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {29526#(< ~counter~0 48)} is VALID [2022-04-15 15:13:35,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {29551#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29526#(< ~counter~0 48)} is VALID [2022-04-15 15:13:35,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {29551#(< ~counter~0 47)} assume !!(0 != ~r~0); {29551#(< ~counter~0 47)} is VALID [2022-04-15 15:13:35,322 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29163#true} {29551#(< ~counter~0 47)} #94#return; {29551#(< ~counter~0 47)} is VALID [2022-04-15 15:13:35,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,323 INFO L272 TraceCheckUtils]: 51: Hoare triple {29551#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:35,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {29551#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {29551#(< ~counter~0 47)} is VALID [2022-04-15 15:13:35,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {29576#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29551#(< ~counter~0 47)} is VALID [2022-04-15 15:13:35,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {29576#(< ~counter~0 46)} assume !(~r~0 < 0); {29576#(< ~counter~0 46)} is VALID [2022-04-15 15:13:35,325 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29163#true} {29576#(< ~counter~0 46)} #98#return; {29576#(< ~counter~0 46)} is VALID [2022-04-15 15:13:35,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,325 INFO L272 TraceCheckUtils]: 43: Hoare triple {29576#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:35,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {29576#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {29576#(< ~counter~0 46)} is VALID [2022-04-15 15:13:35,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {29601#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29576#(< ~counter~0 46)} is VALID [2022-04-15 15:13:35,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {29601#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29601#(< ~counter~0 45)} is VALID [2022-04-15 15:13:35,328 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29163#true} {29601#(< ~counter~0 45)} #98#return; {29601#(< ~counter~0 45)} is VALID [2022-04-15 15:13:35,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,328 INFO L272 TraceCheckUtils]: 35: Hoare triple {29601#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:35,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {29601#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {29601#(< ~counter~0 45)} is VALID [2022-04-15 15:13:35,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {29626#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29601#(< ~counter~0 45)} is VALID [2022-04-15 15:13:35,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {29626#(< ~counter~0 44)} assume !(~r~0 > 0); {29626#(< ~counter~0 44)} is VALID [2022-04-15 15:13:35,331 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29163#true} {29626#(< ~counter~0 44)} #96#return; {29626#(< ~counter~0 44)} is VALID [2022-04-15 15:13:35,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,331 INFO L272 TraceCheckUtils]: 27: Hoare triple {29626#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:35,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {29626#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {29626#(< ~counter~0 44)} is VALID [2022-04-15 15:13:35,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {29651#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29626#(< ~counter~0 44)} is VALID [2022-04-15 15:13:35,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {29651#(< ~counter~0 43)} assume !!(0 != ~r~0); {29651#(< ~counter~0 43)} is VALID [2022-04-15 15:13:35,333 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29163#true} {29651#(< ~counter~0 43)} #94#return; {29651#(< ~counter~0 43)} is VALID [2022-04-15 15:13:35,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {29651#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:35,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {29651#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {29651#(< ~counter~0 43)} is VALID [2022-04-15 15:13:35,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {29676#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29651#(< ~counter~0 43)} is VALID [2022-04-15 15:13:35,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {29676#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,336 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29163#true} {29676#(< ~counter~0 42)} #92#return; {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,336 INFO L272 TraceCheckUtils]: 11: Hoare triple {29676#(< ~counter~0 42)} call assume_abort_if_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-15 15:13:35,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29163#true} {29676#(< ~counter~0 42)} #90#return; {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {29163#true} assume true; {29163#true} is VALID [2022-04-15 15:13:35,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {29163#true} assume !(0 == ~cond); {29163#true} is VALID [2022-04-15 15:13:35,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {29163#true} ~cond := #in~cond; {29163#true} is VALID [2022-04-15 15:13:35,337 INFO L272 TraceCheckUtils]: 6: Hoare triple {29676#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {29163#true} is VALID [2022-04-15 15:13:35,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {29676#(< ~counter~0 42)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 42)} is VALID [2022-04-15 15:13:35,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {29676#(< ~counter~0 42)} call #t~ret9 := main(); {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29676#(< ~counter~0 42)} {29163#true} #102#return; {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {29676#(< ~counter~0 42)} assume true; {29676#(< ~counter~0 42)} is VALID [2022-04-15 15:13:35,339 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 42)} is VALID [2022-04-15 15:13:35,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {29163#true} call ULTIMATE.init(); {29163#true} is VALID [2022-04-15 15:13:35,340 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-15 15:13:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:35,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043749472] [2022-04-15 15:13:35,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:35,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968716386] [2022-04-15 15:13:35,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968716386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:35,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:35,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:13:35,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:35,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [425432690] [2022-04-15 15:13:35,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [425432690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:35,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:35,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:13:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152004877] [2022-04-15 15:13:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:35,342 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-15 15:13:35,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:35,342 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-15 15:13:35,425 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-15 15:13:35,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:13:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:13:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:13:35,426 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-15 15:13:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:36,469 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-15 15:13:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:13:36,470 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-15 15:13:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:36,470 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-15 15:13:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:13:36,472 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-15 15:13:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:13:36,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:13:36,634 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-15 15:13:36,640 INFO L225 Difference]: With dead ends: 427 [2022-04-15 15:13:36,640 INFO L226 Difference]: Without dead ends: 342 [2022-04-15 15:13:36,641 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-15 15:13:36,641 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-15 15:13:36,641 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-15 15:13:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-15 15:13:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-15 15:13:37,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:37,143 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-15 15:13:37,144 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-15 15:13:37,144 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-15 15:13:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:37,152 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-15 15:13:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 15:13:37,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:37,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:37,154 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-15 15:13:37,154 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-15 15:13:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:37,162 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-15 15:13:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 15:13:37,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:37,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:37,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:37,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:37,165 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-15 15:13:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-15 15:13:37,174 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-15 15:13:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:37,175 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-15 15:13:37,175 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-15 15:13:37,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-15 15:13:38,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 15:13:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 15:13:38,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:38,142 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-15 15:13:38,148 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-15 15:13:38,343 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-15 15:13:38,343 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-15 15:13:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272743259] [2022-04-15 15:13:38,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-15 15:13:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212405816] [2022-04-15 15:13:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:38,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:38,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033230629] [2022-04-15 15:13:38,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:38,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:38,367 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-15 15:13:38,388 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-15 15:13:38,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:38,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:38,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:13:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:38,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:38,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {31966#true} call ULTIMATE.init(); {31966#true} is VALID [2022-04-15 15:13:38,912 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-15 15:13:38,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31974#(<= ~counter~0 0)} {31966#true} #102#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {31974#(<= ~counter~0 0)} call #t~ret9 := main(); {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,913 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-15 15:13:38,914 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-15 15:13:38,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {31974#(<= ~counter~0 0)} ~cond := #in~cond; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {31974#(<= ~counter~0 0)} assume !(0 == ~cond); {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31974#(<= ~counter~0 0)} {31974#(<= ~counter~0 0)} #90#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,915 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-15 15:13:38,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {31974#(<= ~counter~0 0)} ~cond := #in~cond; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {31974#(<= ~counter~0 0)} assume !(0 == ~cond); {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {31974#(<= ~counter~0 0)} assume true; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,916 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31974#(<= ~counter~0 0)} {31974#(<= ~counter~0 0)} #92#return; {31974#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:38,917 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-15 15:13:38,918 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-15 15:13:38,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {32023#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,918 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-15 15:13:38,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {32023#(<= ~counter~0 1)} ~cond := #in~cond; {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {32023#(<= ~counter~0 1)} assume !(0 == ~cond); {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {32023#(<= ~counter~0 1)} assume true; {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,920 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32023#(<= ~counter~0 1)} {32023#(<= ~counter~0 1)} #94#return; {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {32023#(<= ~counter~0 1)} assume !!(0 != ~r~0); {32023#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:38,920 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-15 15:13:38,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {32048#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,921 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-15 15:13:38,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {32048#(<= ~counter~0 2)} ~cond := #in~cond; {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {32048#(<= ~counter~0 2)} assume !(0 == ~cond); {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {32048#(<= ~counter~0 2)} assume true; {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,923 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32048#(<= ~counter~0 2)} {32048#(<= ~counter~0 2)} #96#return; {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {32048#(<= ~counter~0 2)} assume !(~r~0 > 0); {32048#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:38,923 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-15 15:13:38,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {32073#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {32073#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:38,924 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-15 15:13:38,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {32073#(<= ~counter~0 3)} ~cond := #in~cond; {32073#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:38,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {32073#(<= ~counter~0 3)} assume !(0 == ~cond); {32073#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:38,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {32073#(<= ~counter~0 3)} assume true; {32073#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:38,925 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32073#(<= ~counter~0 3)} {32073#(<= ~counter~0 3)} #98#return; {32073#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:38,926 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-15 15:13:38,926 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-15 15:13:38,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {32098#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,927 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-15 15:13:38,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {32098#(<= ~counter~0 4)} ~cond := #in~cond; {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {32098#(<= ~counter~0 4)} assume !(0 == ~cond); {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {32098#(<= ~counter~0 4)} assume true; {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,928 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32098#(<= ~counter~0 4)} {32098#(<= ~counter~0 4)} #98#return; {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {32098#(<= ~counter~0 4)} assume !(~r~0 < 0); {32098#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:38,929 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-15 15:13:38,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {32123#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,930 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-15 15:13:38,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {32123#(<= ~counter~0 5)} ~cond := #in~cond; {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {32123#(<= ~counter~0 5)} assume !(0 == ~cond); {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,931 INFO L290 TraceCheckUtils]: 54: Hoare triple {32123#(<= ~counter~0 5)} assume true; {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,931 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32123#(<= ~counter~0 5)} {32123#(<= ~counter~0 5)} #94#return; {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,932 INFO L290 TraceCheckUtils]: 56: Hoare triple {32123#(<= ~counter~0 5)} assume !!(0 != ~r~0); {32123#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:38,932 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-15 15:13:38,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {32148#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {32148#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:38,933 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-15 15:13:38,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {32148#(<= ~counter~0 6)} ~cond := #in~cond; {32148#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:38,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {32148#(<= ~counter~0 6)} assume !(0 == ~cond); {32148#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:38,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {32148#(<= ~counter~0 6)} assume true; {32148#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:38,934 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32148#(<= ~counter~0 6)} {32148#(<= ~counter~0 6)} #96#return; {32148#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:38,934 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-15 15:13:38,935 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-15 15:13:38,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {32173#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {32173#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:38,936 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-15 15:13:38,936 INFO L290 TraceCheckUtils]: 68: Hoare triple {32173#(<= ~counter~0 7)} ~cond := #in~cond; {32173#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:38,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {32173#(<= ~counter~0 7)} assume !(0 == ~cond); {32173#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:38,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {32173#(<= ~counter~0 7)} assume true; {32173#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:38,937 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32173#(<= ~counter~0 7)} {32173#(<= ~counter~0 7)} #96#return; {32173#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:38,937 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-15 15:13:38,938 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-15 15:13:38,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {32198#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,939 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-15 15:13:38,939 INFO L290 TraceCheckUtils]: 76: Hoare triple {32198#(<= ~counter~0 8)} ~cond := #in~cond; {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {32198#(<= ~counter~0 8)} assume !(0 == ~cond); {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {32198#(<= ~counter~0 8)} assume true; {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,940 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32198#(<= ~counter~0 8)} {32198#(<= ~counter~0 8)} #96#return; {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,940 INFO L290 TraceCheckUtils]: 80: Hoare triple {32198#(<= ~counter~0 8)} assume !(~r~0 > 0); {32198#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:38,941 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-15 15:13:38,941 INFO L290 TraceCheckUtils]: 82: Hoare triple {32223#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {32223#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:38,942 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-15 15:13:38,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {32223#(<= ~counter~0 9)} ~cond := #in~cond; {32223#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:38,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {32223#(<= ~counter~0 9)} assume !(0 == ~cond); {32223#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:38,942 INFO L290 TraceCheckUtils]: 86: Hoare triple {32223#(<= ~counter~0 9)} assume true; {32223#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:38,943 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32223#(<= ~counter~0 9)} {32223#(<= ~counter~0 9)} #98#return; {32223#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:38,943 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-15 15:13:38,944 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-15 15:13:38,944 INFO L290 TraceCheckUtils]: 90: Hoare triple {32248#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {31967#false} is VALID [2022-04-15 15:13:38,944 INFO L290 TraceCheckUtils]: 91: Hoare triple {31967#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31967#false} is VALID [2022-04-15 15:13:38,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {31967#false} assume !(#t~post6 < 50);havoc #t~post6; {31967#false} is VALID [2022-04-15 15:13:38,944 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-15 15:13:38,944 INFO L290 TraceCheckUtils]: 94: Hoare triple {31967#false} ~cond := #in~cond; {31967#false} is VALID [2022-04-15 15:13:38,944 INFO L290 TraceCheckUtils]: 95: Hoare triple {31967#false} assume 0 == ~cond; {31967#false} is VALID [2022-04-15 15:13:38,944 INFO L290 TraceCheckUtils]: 96: Hoare triple {31967#false} assume !false; {31967#false} is VALID [2022-04-15 15:13:38,945 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-15 15:13:38,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:39,449 INFO L290 TraceCheckUtils]: 96: Hoare triple {31967#false} assume !false; {31967#false} is VALID [2022-04-15 15:13:39,450 INFO L290 TraceCheckUtils]: 95: Hoare triple {31967#false} assume 0 == ~cond; {31967#false} is VALID [2022-04-15 15:13:39,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {31967#false} ~cond := #in~cond; {31967#false} is VALID [2022-04-15 15:13:39,450 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-15 15:13:39,450 INFO L290 TraceCheckUtils]: 92: Hoare triple {31967#false} assume !(#t~post6 < 50);havoc #t~post6; {31967#false} is VALID [2022-04-15 15:13:39,450 INFO L290 TraceCheckUtils]: 91: Hoare triple {31967#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31967#false} is VALID [2022-04-15 15:13:39,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {32288#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {31967#false} is VALID [2022-04-15 15:13:39,450 INFO L290 TraceCheckUtils]: 89: Hoare triple {32292#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32288#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:13:39,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {32292#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32292#(< ~counter~0 50)} is VALID [2022-04-15 15:13:39,451 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31966#true} {32292#(< ~counter~0 50)} #98#return; {32292#(< ~counter~0 50)} is VALID [2022-04-15 15:13:39,451 INFO L290 TraceCheckUtils]: 86: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,451 INFO L290 TraceCheckUtils]: 84: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,452 INFO L272 TraceCheckUtils]: 83: Hoare triple {32292#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:39,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {32292#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {32292#(< ~counter~0 50)} is VALID [2022-04-15 15:13:39,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {32317#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32292#(< ~counter~0 50)} is VALID [2022-04-15 15:13:39,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {32317#(< ~counter~0 49)} assume !(~r~0 > 0); {32317#(< ~counter~0 49)} is VALID [2022-04-15 15:13:39,453 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31966#true} {32317#(< ~counter~0 49)} #96#return; {32317#(< ~counter~0 49)} is VALID [2022-04-15 15:13:39,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,454 INFO L272 TraceCheckUtils]: 75: Hoare triple {32317#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:39,454 INFO L290 TraceCheckUtils]: 74: Hoare triple {32317#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {32317#(< ~counter~0 49)} is VALID [2022-04-15 15:13:39,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {32342#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32317#(< ~counter~0 49)} is VALID [2022-04-15 15:13:39,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {32342#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32342#(< ~counter~0 48)} is VALID [2022-04-15 15:13:39,455 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31966#true} {32342#(< ~counter~0 48)} #96#return; {32342#(< ~counter~0 48)} is VALID [2022-04-15 15:13:39,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,455 INFO L272 TraceCheckUtils]: 67: Hoare triple {32342#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:39,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {32342#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {32342#(< ~counter~0 48)} is VALID [2022-04-15 15:13:39,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {32367#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32342#(< ~counter~0 48)} is VALID [2022-04-15 15:13:39,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {32367#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32367#(< ~counter~0 47)} is VALID [2022-04-15 15:13:39,457 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31966#true} {32367#(< ~counter~0 47)} #96#return; {32367#(< ~counter~0 47)} is VALID [2022-04-15 15:13:39,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,457 INFO L272 TraceCheckUtils]: 59: Hoare triple {32367#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:39,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {32367#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {32367#(< ~counter~0 47)} is VALID [2022-04-15 15:13:39,458 INFO L290 TraceCheckUtils]: 57: Hoare triple {32392#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32367#(< ~counter~0 47)} is VALID [2022-04-15 15:13:39,458 INFO L290 TraceCheckUtils]: 56: Hoare triple {32392#(< ~counter~0 46)} assume !!(0 != ~r~0); {32392#(< ~counter~0 46)} is VALID [2022-04-15 15:13:39,459 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31966#true} {32392#(< ~counter~0 46)} #94#return; {32392#(< ~counter~0 46)} is VALID [2022-04-15 15:13:39,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,459 INFO L272 TraceCheckUtils]: 51: Hoare triple {32392#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:39,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {32392#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {32392#(< ~counter~0 46)} is VALID [2022-04-15 15:13:39,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {32417#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32392#(< ~counter~0 46)} is VALID [2022-04-15 15:13:39,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {32417#(< ~counter~0 45)} assume !(~r~0 < 0); {32417#(< ~counter~0 45)} is VALID [2022-04-15 15:13:39,461 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31966#true} {32417#(< ~counter~0 45)} #98#return; {32417#(< ~counter~0 45)} is VALID [2022-04-15 15:13:39,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,461 INFO L272 TraceCheckUtils]: 43: Hoare triple {32417#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:39,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {32417#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {32417#(< ~counter~0 45)} is VALID [2022-04-15 15:13:39,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {32442#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32417#(< ~counter~0 45)} is VALID [2022-04-15 15:13:39,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {32442#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32442#(< ~counter~0 44)} is VALID [2022-04-15 15:13:39,462 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31966#true} {32442#(< ~counter~0 44)} #98#return; {32442#(< ~counter~0 44)} is VALID [2022-04-15 15:13:39,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,463 INFO L272 TraceCheckUtils]: 35: Hoare triple {32442#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:39,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {32442#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {32442#(< ~counter~0 44)} is VALID [2022-04-15 15:13:39,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {32467#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32442#(< ~counter~0 44)} is VALID [2022-04-15 15:13:39,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {32467#(< ~counter~0 43)} assume !(~r~0 > 0); {32467#(< ~counter~0 43)} is VALID [2022-04-15 15:13:39,464 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31966#true} {32467#(< ~counter~0 43)} #96#return; {32467#(< ~counter~0 43)} is VALID [2022-04-15 15:13:39,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,465 INFO L272 TraceCheckUtils]: 27: Hoare triple {32467#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:39,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {32467#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {32467#(< ~counter~0 43)} is VALID [2022-04-15 15:13:39,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {32492#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32467#(< ~counter~0 43)} is VALID [2022-04-15 15:13:39,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {32492#(< ~counter~0 42)} assume !!(0 != ~r~0); {32492#(< ~counter~0 42)} is VALID [2022-04-15 15:13:39,466 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31966#true} {32492#(< ~counter~0 42)} #94#return; {32492#(< ~counter~0 42)} is VALID [2022-04-15 15:13:39,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,466 INFO L272 TraceCheckUtils]: 19: Hoare triple {32492#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:13:39,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {32492#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {32492#(< ~counter~0 42)} is VALID [2022-04-15 15:13:39,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {32517#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32492#(< ~counter~0 42)} is VALID [2022-04-15 15:13:39,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {32517#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,468 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31966#true} {32517#(< ~counter~0 41)} #92#return; {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,468 INFO L272 TraceCheckUtils]: 11: Hoare triple {32517#(< ~counter~0 41)} call assume_abort_if_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-15 15:13:39,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31966#true} {32517#(< ~counter~0 41)} #90#return; {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {31966#true} assume true; {31966#true} is VALID [2022-04-15 15:13:39,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {31966#true} assume !(0 == ~cond); {31966#true} is VALID [2022-04-15 15:13:39,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {31966#true} ~cond := #in~cond; {31966#true} is VALID [2022-04-15 15:13:39,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {32517#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31966#true} is VALID [2022-04-15 15:13:39,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {32517#(< ~counter~0 41)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 41)} is VALID [2022-04-15 15:13:39,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {32517#(< ~counter~0 41)} call #t~ret9 := main(); {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32517#(< ~counter~0 41)} {31966#true} #102#return; {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {32517#(< ~counter~0 41)} assume true; {32517#(< ~counter~0 41)} is VALID [2022-04-15 15:13:39,470 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 41)} is VALID [2022-04-15 15:13:39,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {31966#true} call ULTIMATE.init(); {31966#true} is VALID [2022-04-15 15:13:39,471 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-15 15:13:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212405816] [2022-04-15 15:13:39,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033230629] [2022-04-15 15:13:39,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033230629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:39,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:39,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:13:39,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272743259] [2022-04-15 15:13:39,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272743259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:39,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:39,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:13:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71088998] [2022-04-15 15:13:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:39,472 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-15 15:13:39,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:39,472 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-15 15:13:39,535 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-15 15:13:39,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:13:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:13:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:13:39,536 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-15 15:13:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:40,706 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-15 15:13:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 15:13:40,706 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-15 15:13:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:40,707 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-15 15:13:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:13:40,709 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-15 15:13:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:13:40,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 15:13:40,911 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-15 15:13:40,920 INFO L225 Difference]: With dead ends: 467 [2022-04-15 15:13:40,920 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 15:13:40,921 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-15 15:13:40,922 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-15 15:13:40,922 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-15 15:13:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 15:13:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-15 15:13:41,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:41,430 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-15 15:13:41,431 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-15 15:13:41,431 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-15 15:13:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:41,439 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-15 15:13:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-15 15:13:41,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:41,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:41,441 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-15 15:13:41,441 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-15 15:13:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:41,450 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-15 15:13:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-15 15:13:41,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:41,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:41,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:41,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:41,452 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-15 15:13:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-15 15:13:41,466 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-15 15:13:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:41,467 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-15 15:13:41,467 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-15 15:13:41,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-15 15:13:44,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 456 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-15 15:13:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:13:44,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:44,063 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-15 15:13:44,079 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-15 15:13:44,263 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-15 15:13:44,263 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-15 15:13:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:44,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658689976] [2022-04-15 15:13:44,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-15 15:13:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:44,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202255620] [2022-04-15 15:13:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:44,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:44,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622655220] [2022-04-15 15:13:44,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:44,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:44,277 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-15 15:13:44,285 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-15 15:13:44,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:44,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:44,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:13:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:44,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:44,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {34911#true} call ULTIMATE.init(); {34911#true} is VALID [2022-04-15 15:13:44,608 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-15 15:13:44,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34911#true} {34911#true} #102#return; {34911#true} is VALID [2022-04-15 15:13:44,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {34911#true} call #t~ret9 := main(); {34911#true} is VALID [2022-04-15 15:13:44,608 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-15 15:13:44,608 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-15 15:13:44,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34911#true} {34911#true} #90#return; {34911#true} is VALID [2022-04-15 15:13:44,608 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-15 15:13:44,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34911#true} {34911#true} #92#return; {34911#true} is VALID [2022-04-15 15:13:44,609 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-15 15:13:44,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {34911#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {34911#true} assume !!(#t~post6 < 50);havoc #t~post6; {34911#true} is VALID [2022-04-15 15:13:44,609 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-15 15:13:44,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34911#true} {34911#true} #94#return; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {34911#true} assume !!(0 != ~r~0); {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {34911#true} assume !!(#t~post7 < 50);havoc #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,610 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-15 15:13:44,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {34911#true} assume !(~r~0 > 0); {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {34911#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {34911#true} assume !!(#t~post8 < 50);havoc #t~post8; {34911#true} is VALID [2022-04-15 15:13:44,610 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-15 15:13:44,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,610 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34911#true} {34911#true} #98#return; {34911#true} is VALID [2022-04-15 15:13:44,610 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-15 15:13:44,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {34911#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {34911#true} assume !!(#t~post8 < 50);havoc #t~post8; {34911#true} is VALID [2022-04-15 15:13:44,611 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-15 15:13:44,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34911#true} {34911#true} #98#return; {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {34911#true} assume !(~r~0 < 0); {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {34911#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34911#true} is VALID [2022-04-15 15:13:44,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {34911#true} assume !!(#t~post6 < 50);havoc #t~post6; {34911#true} is VALID [2022-04-15 15:13:44,611 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-15 15:13:44,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34911#true} {34911#true} #94#return; {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {34911#true} assume !!(0 != ~r~0); {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 57: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {34911#true} assume !!(#t~post7 < 50);havoc #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,612 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-15 15:13:44,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,613 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-15 15:13:44,613 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-15 15:13:44,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {34911#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {34911#true} assume !!(#t~post7 < 50);havoc #t~post7; {34911#true} is VALID [2022-04-15 15:13:44,613 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-15 15:13:44,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,613 INFO L290 TraceCheckUtils]: 69: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,614 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34911#true} {34911#true} #96#return; {34911#true} is VALID [2022-04-15 15:13:44,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {34911#true} assume !(~r~0 > 0); {35132#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:13:44,615 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-15 15:13:44,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {35132#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {35132#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:13:44,616 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-15 15:13:44,616 INFO L290 TraceCheckUtils]: 76: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,616 INFO L290 TraceCheckUtils]: 77: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,617 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-15 15:13:44,617 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-15 15:13:44,618 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-15 15:13:44,618 INFO L290 TraceCheckUtils]: 82: Hoare triple {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {35157#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:13:44,618 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-15 15:13:44,618 INFO L290 TraceCheckUtils]: 84: Hoare triple {34911#true} ~cond := #in~cond; {34911#true} is VALID [2022-04-15 15:13:44,618 INFO L290 TraceCheckUtils]: 85: Hoare triple {34911#true} assume !(0 == ~cond); {34911#true} is VALID [2022-04-15 15:13:44,619 INFO L290 TraceCheckUtils]: 86: Hoare triple {34911#true} assume true; {34911#true} is VALID [2022-04-15 15:13:44,619 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-15 15:13:44,620 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-15 15:13:44,620 INFO L290 TraceCheckUtils]: 89: Hoare triple {34912#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34912#false} is VALID [2022-04-15 15:13:44,620 INFO L290 TraceCheckUtils]: 90: Hoare triple {34912#false} assume !(#t~post7 < 50);havoc #t~post7; {34912#false} is VALID [2022-04-15 15:13:44,620 INFO L290 TraceCheckUtils]: 91: Hoare triple {34912#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34912#false} is VALID [2022-04-15 15:13:44,620 INFO L290 TraceCheckUtils]: 92: Hoare triple {34912#false} assume !(#t~post8 < 50);havoc #t~post8; {34912#false} is VALID [2022-04-15 15:13:44,620 INFO L290 TraceCheckUtils]: 93: Hoare triple {34912#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34912#false} is VALID [2022-04-15 15:13:44,620 INFO L290 TraceCheckUtils]: 94: Hoare triple {34912#false} assume !(#t~post6 < 50);havoc #t~post6; {34912#false} is VALID [2022-04-15 15:13:44,620 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-15 15:13:44,620 INFO L290 TraceCheckUtils]: 96: Hoare triple {34912#false} ~cond := #in~cond; {34912#false} is VALID [2022-04-15 15:13:44,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {34912#false} assume 0 == ~cond; {34912#false} is VALID [2022-04-15 15:13:44,621 INFO L290 TraceCheckUtils]: 98: Hoare triple {34912#false} assume !false; {34912#false} is VALID [2022-04-15 15:13:44,621 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-15 15:13:44,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:13:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202255620] [2022-04-15 15:13:44,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622655220] [2022-04-15 15:13:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622655220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:44,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:44,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:13:44,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658689976] [2022-04-15 15:13:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658689976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:44,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:44,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:13:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766029088] [2022-04-15 15:13:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:44,623 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-15 15:13:44,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:44,623 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-15 15:13:44,672 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-15 15:13:44,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:13:44,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:44,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:13:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:13:44,673 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-15 15:13:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:45,423 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-15 15:13:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:13:45,423 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-15 15:13:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:45,423 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-15 15:13:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:13:45,424 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-15 15:13:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:13:45,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:13:45,490 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-15 15:13:45,498 INFO L225 Difference]: With dead ends: 504 [2022-04-15 15:13:45,498 INFO L226 Difference]: Without dead ends: 362 [2022-04-15 15:13:45,499 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-15 15:13:45,499 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-15 15:13:45,499 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-15 15:13:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-15 15:13:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-15 15:13:46,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:46,039 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-15 15:13:46,040 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-15 15:13:46,040 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-15 15:13:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:46,049 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-15 15:13:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-15 15:13:46,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:46,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:46,050 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-15 15:13:46,051 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-15 15:13:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:46,059 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-15 15:13:46,059 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-15 15:13:46,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:46,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:46,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:46,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:46,061 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-15 15:13:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-15 15:13:46,071 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-15 15:13:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:46,072 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-15 15:13:46,072 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-15 15:13:46,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-15 15:13:47,614 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-15 15:13:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-15 15:13:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:13:47,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:47,615 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-15 15:13:47,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 15:13:47,816 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-15 15:13:47,816 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-15 15:13:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:47,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1911978620] [2022-04-15 15:13:47,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-15 15:13:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151918505] [2022-04-15 15:13:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:47,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:47,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929877497] [2022-04-15 15:13:47,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:47,843 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-15 15:13:47,845 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-15 15:13:47,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:47,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:47,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:13:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:48,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:48,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {37647#true} call ULTIMATE.init(); {37647#true} is VALID [2022-04-15 15:13:48,482 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-15 15:13:48,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37655#(<= ~counter~0 0)} {37647#true} #102#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {37655#(<= ~counter~0 0)} call #t~ret9 := main(); {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,484 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-15 15:13:48,484 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-15 15:13:48,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {37655#(<= ~counter~0 0)} ~cond := #in~cond; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {37655#(<= ~counter~0 0)} assume !(0 == ~cond); {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37655#(<= ~counter~0 0)} {37655#(<= ~counter~0 0)} #90#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,486 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-15 15:13:48,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {37655#(<= ~counter~0 0)} ~cond := #in~cond; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {37655#(<= ~counter~0 0)} assume !(0 == ~cond); {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {37655#(<= ~counter~0 0)} assume true; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,487 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37655#(<= ~counter~0 0)} {37655#(<= ~counter~0 0)} #92#return; {37655#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:48,487 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-15 15:13:48,488 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-15 15:13:48,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {37704#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,489 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-15 15:13:48,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {37704#(<= ~counter~0 1)} ~cond := #in~cond; {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {37704#(<= ~counter~0 1)} assume !(0 == ~cond); {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {37704#(<= ~counter~0 1)} assume true; {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,490 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37704#(<= ~counter~0 1)} {37704#(<= ~counter~0 1)} #94#return; {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {37704#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37704#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:48,491 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-15 15:13:48,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {37729#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,492 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-15 15:13:48,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {37729#(<= ~counter~0 2)} ~cond := #in~cond; {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {37729#(<= ~counter~0 2)} assume !(0 == ~cond); {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {37729#(<= ~counter~0 2)} assume true; {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,493 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37729#(<= ~counter~0 2)} {37729#(<= ~counter~0 2)} #96#return; {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {37729#(<= ~counter~0 2)} assume !(~r~0 > 0); {37729#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:48,494 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-15 15:13:48,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {37754#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {37754#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,495 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-15 15:13:48,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {37754#(<= ~counter~0 3)} ~cond := #in~cond; {37754#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {37754#(<= ~counter~0 3)} assume !(0 == ~cond); {37754#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {37754#(<= ~counter~0 3)} assume true; {37754#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,496 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37754#(<= ~counter~0 3)} {37754#(<= ~counter~0 3)} #98#return; {37754#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:48,496 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-15 15:13:48,497 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-15 15:13:48,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {37779#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,498 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-15 15:13:48,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {37779#(<= ~counter~0 4)} ~cond := #in~cond; {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {37779#(<= ~counter~0 4)} assume !(0 == ~cond); {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,498 INFO L290 TraceCheckUtils]: 46: Hoare triple {37779#(<= ~counter~0 4)} assume true; {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,499 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37779#(<= ~counter~0 4)} {37779#(<= ~counter~0 4)} #98#return; {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {37779#(<= ~counter~0 4)} assume !(~r~0 < 0); {37779#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:48,500 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-15 15:13:48,500 INFO L290 TraceCheckUtils]: 50: Hoare triple {37804#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,500 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-15 15:13:48,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {37804#(<= ~counter~0 5)} ~cond := #in~cond; {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {37804#(<= ~counter~0 5)} assume !(0 == ~cond); {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {37804#(<= ~counter~0 5)} assume true; {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,502 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37804#(<= ~counter~0 5)} {37804#(<= ~counter~0 5)} #94#return; {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {37804#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37804#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:48,503 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-15 15:13:48,503 INFO L290 TraceCheckUtils]: 58: Hoare triple {37829#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {37829#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,503 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-15 15:13:48,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {37829#(<= ~counter~0 6)} ~cond := #in~cond; {37829#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {37829#(<= ~counter~0 6)} assume !(0 == ~cond); {37829#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,504 INFO L290 TraceCheckUtils]: 62: Hoare triple {37829#(<= ~counter~0 6)} assume true; {37829#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,505 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37829#(<= ~counter~0 6)} {37829#(<= ~counter~0 6)} #96#return; {37829#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:48,505 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-15 15:13:48,505 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-15 15:13:48,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {37854#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {37854#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:48,506 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-15 15:13:48,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {37854#(<= ~counter~0 7)} ~cond := #in~cond; {37854#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:48,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {37854#(<= ~counter~0 7)} assume !(0 == ~cond); {37854#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:48,507 INFO L290 TraceCheckUtils]: 70: Hoare triple {37854#(<= ~counter~0 7)} assume true; {37854#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:48,507 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37854#(<= ~counter~0 7)} {37854#(<= ~counter~0 7)} #96#return; {37854#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:48,508 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-15 15:13:48,508 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-15 15:13:48,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {37879#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {37879#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:48,509 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-15 15:13:48,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {37879#(<= ~counter~0 8)} ~cond := #in~cond; {37879#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:48,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {37879#(<= ~counter~0 8)} assume !(0 == ~cond); {37879#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:48,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {37879#(<= ~counter~0 8)} assume true; {37879#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:48,510 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37879#(<= ~counter~0 8)} {37879#(<= ~counter~0 8)} #96#return; {37879#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:48,511 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-15 15:13:48,511 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-15 15:13:48,511 INFO L290 TraceCheckUtils]: 82: Hoare triple {37904#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {37904#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:48,512 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-15 15:13:48,512 INFO L290 TraceCheckUtils]: 84: Hoare triple {37904#(<= ~counter~0 9)} ~cond := #in~cond; {37904#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:48,512 INFO L290 TraceCheckUtils]: 85: Hoare triple {37904#(<= ~counter~0 9)} assume !(0 == ~cond); {37904#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:48,513 INFO L290 TraceCheckUtils]: 86: Hoare triple {37904#(<= ~counter~0 9)} assume true; {37904#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:48,513 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37904#(<= ~counter~0 9)} {37904#(<= ~counter~0 9)} #96#return; {37904#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:48,514 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-15 15:13:48,514 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-15 15:13:48,515 INFO L290 TraceCheckUtils]: 90: Hoare triple {37929#(<= |main_#t~post7| 9)} assume !(#t~post7 < 50);havoc #t~post7; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 91: Hoare triple {37648#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 92: Hoare triple {37648#false} assume !(#t~post8 < 50);havoc #t~post8; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 93: Hoare triple {37648#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 94: Hoare triple {37648#false} assume !(#t~post6 < 50);havoc #t~post6; {37648#false} is VALID [2022-04-15 15:13:48,515 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-15 15:13:48,515 INFO L290 TraceCheckUtils]: 96: Hoare triple {37648#false} ~cond := #in~cond; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 97: Hoare triple {37648#false} assume 0 == ~cond; {37648#false} is VALID [2022-04-15 15:13:48,515 INFO L290 TraceCheckUtils]: 98: Hoare triple {37648#false} assume !false; {37648#false} is VALID [2022-04-15 15:13:48,515 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-15 15:13:48,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:49,020 INFO L290 TraceCheckUtils]: 98: Hoare triple {37648#false} assume !false; {37648#false} is VALID [2022-04-15 15:13:49,020 INFO L290 TraceCheckUtils]: 97: Hoare triple {37648#false} assume 0 == ~cond; {37648#false} is VALID [2022-04-15 15:13:49,020 INFO L290 TraceCheckUtils]: 96: Hoare triple {37648#false} ~cond := #in~cond; {37648#false} is VALID [2022-04-15 15:13:49,021 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-15 15:13:49,021 INFO L290 TraceCheckUtils]: 94: Hoare triple {37648#false} assume !(#t~post6 < 50);havoc #t~post6; {37648#false} is VALID [2022-04-15 15:13:49,021 INFO L290 TraceCheckUtils]: 93: Hoare triple {37648#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37648#false} is VALID [2022-04-15 15:13:49,021 INFO L290 TraceCheckUtils]: 92: Hoare triple {37648#false} assume !(#t~post8 < 50);havoc #t~post8; {37648#false} is VALID [2022-04-15 15:13:49,021 INFO L290 TraceCheckUtils]: 91: Hoare triple {37648#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37648#false} is VALID [2022-04-15 15:13:49,023 INFO L290 TraceCheckUtils]: 90: Hoare triple {37981#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {37648#false} is VALID [2022-04-15 15:13:49,023 INFO L290 TraceCheckUtils]: 89: Hoare triple {37985#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37981#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:13:49,023 INFO L290 TraceCheckUtils]: 88: Hoare triple {37985#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37985#(< ~counter~0 50)} is VALID [2022-04-15 15:13:49,024 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37647#true} {37985#(< ~counter~0 50)} #96#return; {37985#(< ~counter~0 50)} is VALID [2022-04-15 15:13:49,024 INFO L290 TraceCheckUtils]: 86: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,024 INFO L290 TraceCheckUtils]: 85: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,024 INFO L290 TraceCheckUtils]: 84: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,024 INFO L272 TraceCheckUtils]: 83: Hoare triple {37985#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:49,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {37985#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {37985#(< ~counter~0 50)} is VALID [2022-04-15 15:13:49,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {38010#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37985#(< ~counter~0 50)} is VALID [2022-04-15 15:13:49,026 INFO L290 TraceCheckUtils]: 80: Hoare triple {38010#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38010#(< ~counter~0 49)} is VALID [2022-04-15 15:13:49,026 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37647#true} {38010#(< ~counter~0 49)} #96#return; {38010#(< ~counter~0 49)} is VALID [2022-04-15 15:13:49,026 INFO L290 TraceCheckUtils]: 78: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,027 INFO L272 TraceCheckUtils]: 75: Hoare triple {38010#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:49,027 INFO L290 TraceCheckUtils]: 74: Hoare triple {38010#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {38010#(< ~counter~0 49)} is VALID [2022-04-15 15:13:49,027 INFO L290 TraceCheckUtils]: 73: Hoare triple {38035#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38010#(< ~counter~0 49)} is VALID [2022-04-15 15:13:49,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {38035#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38035#(< ~counter~0 48)} is VALID [2022-04-15 15:13:49,028 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37647#true} {38035#(< ~counter~0 48)} #96#return; {38035#(< ~counter~0 48)} is VALID [2022-04-15 15:13:49,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,028 INFO L290 TraceCheckUtils]: 69: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,028 INFO L290 TraceCheckUtils]: 68: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,028 INFO L272 TraceCheckUtils]: 67: Hoare triple {38035#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:49,029 INFO L290 TraceCheckUtils]: 66: Hoare triple {38035#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {38035#(< ~counter~0 48)} is VALID [2022-04-15 15:13:49,029 INFO L290 TraceCheckUtils]: 65: Hoare triple {38060#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38035#(< ~counter~0 48)} is VALID [2022-04-15 15:13:49,029 INFO L290 TraceCheckUtils]: 64: Hoare triple {38060#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38060#(< ~counter~0 47)} is VALID [2022-04-15 15:13:49,030 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37647#true} {38060#(< ~counter~0 47)} #96#return; {38060#(< ~counter~0 47)} is VALID [2022-04-15 15:13:49,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,030 INFO L272 TraceCheckUtils]: 59: Hoare triple {38060#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:49,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {38060#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {38060#(< ~counter~0 47)} is VALID [2022-04-15 15:13:49,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {38085#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38060#(< ~counter~0 47)} is VALID [2022-04-15 15:13:49,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {38085#(< ~counter~0 46)} assume !!(0 != ~r~0); {38085#(< ~counter~0 46)} is VALID [2022-04-15 15:13:49,032 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37647#true} {38085#(< ~counter~0 46)} #94#return; {38085#(< ~counter~0 46)} is VALID [2022-04-15 15:13:49,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,032 INFO L272 TraceCheckUtils]: 51: Hoare triple {38085#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:49,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {38085#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {38085#(< ~counter~0 46)} is VALID [2022-04-15 15:13:49,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {38110#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38085#(< ~counter~0 46)} is VALID [2022-04-15 15:13:49,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {38110#(< ~counter~0 45)} assume !(~r~0 < 0); {38110#(< ~counter~0 45)} is VALID [2022-04-15 15:13:49,034 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37647#true} {38110#(< ~counter~0 45)} #98#return; {38110#(< ~counter~0 45)} is VALID [2022-04-15 15:13:49,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,034 INFO L272 TraceCheckUtils]: 43: Hoare triple {38110#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:49,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {38110#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {38110#(< ~counter~0 45)} is VALID [2022-04-15 15:13:49,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {38135#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38110#(< ~counter~0 45)} is VALID [2022-04-15 15:13:49,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {38135#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38135#(< ~counter~0 44)} is VALID [2022-04-15 15:13:49,036 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37647#true} {38135#(< ~counter~0 44)} #98#return; {38135#(< ~counter~0 44)} is VALID [2022-04-15 15:13:49,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,036 INFO L272 TraceCheckUtils]: 35: Hoare triple {38135#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:49,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {38135#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {38135#(< ~counter~0 44)} is VALID [2022-04-15 15:13:49,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {38160#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38135#(< ~counter~0 44)} is VALID [2022-04-15 15:13:49,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {38160#(< ~counter~0 43)} assume !(~r~0 > 0); {38160#(< ~counter~0 43)} is VALID [2022-04-15 15:13:49,038 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37647#true} {38160#(< ~counter~0 43)} #96#return; {38160#(< ~counter~0 43)} is VALID [2022-04-15 15:13:49,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,038 INFO L272 TraceCheckUtils]: 27: Hoare triple {38160#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:49,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {38160#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {38160#(< ~counter~0 43)} is VALID [2022-04-15 15:13:49,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {38185#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38160#(< ~counter~0 43)} is VALID [2022-04-15 15:13:49,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {38185#(< ~counter~0 42)} assume !!(0 != ~r~0); {38185#(< ~counter~0 42)} is VALID [2022-04-15 15:13:49,039 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37647#true} {38185#(< ~counter~0 42)} #94#return; {38185#(< ~counter~0 42)} is VALID [2022-04-15 15:13:49,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,040 INFO L272 TraceCheckUtils]: 19: Hoare triple {38185#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:13:49,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {38185#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {38185#(< ~counter~0 42)} is VALID [2022-04-15 15:13:49,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {38210#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38185#(< ~counter~0 42)} is VALID [2022-04-15 15:13:49,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {38210#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37647#true} {38210#(< ~counter~0 41)} #92#return; {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,041 INFO L272 TraceCheckUtils]: 11: Hoare triple {38210#(< ~counter~0 41)} call assume_abort_if_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-15 15:13:49,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37647#true} {38210#(< ~counter~0 41)} #90#return; {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {37647#true} assume true; {37647#true} is VALID [2022-04-15 15:13:49,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {37647#true} assume !(0 == ~cond); {37647#true} is VALID [2022-04-15 15:13:49,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {37647#true} ~cond := #in~cond; {37647#true} is VALID [2022-04-15 15:13:49,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {38210#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37647#true} is VALID [2022-04-15 15:13:49,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {38210#(< ~counter~0 41)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 41)} is VALID [2022-04-15 15:13:49,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {38210#(< ~counter~0 41)} call #t~ret9 := main(); {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38210#(< ~counter~0 41)} {37647#true} #102#return; {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {38210#(< ~counter~0 41)} assume true; {38210#(< ~counter~0 41)} is VALID [2022-04-15 15:13:49,044 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 41)} is VALID [2022-04-15 15:13:49,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {37647#true} call ULTIMATE.init(); {37647#true} is VALID [2022-04-15 15:13:49,044 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-15 15:13:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:49,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151918505] [2022-04-15 15:13:49,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:49,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929877497] [2022-04-15 15:13:49,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929877497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:49,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:49,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:13:49,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:49,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1911978620] [2022-04-15 15:13:49,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1911978620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:49,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:49,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:13:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362532558] [2022-04-15 15:13:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:49,046 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-15 15:13:49,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:49,046 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-15 15:13:49,115 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-15 15:13:49,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:13:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:13:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:13:49,116 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-15 15:13:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:50,260 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-15 15:13:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:13:50,260 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-15 15:13:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:50,260 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-15 15:13:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:13:50,263 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-15 15:13:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:13:50,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-15 15:13:50,463 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-15 15:13:50,472 INFO L225 Difference]: With dead ends: 471 [2022-04-15 15:13:50,472 INFO L226 Difference]: Without dead ends: 364 [2022-04-15 15:13:50,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:13:50,474 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-15 15:13:50,474 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-15 15:13:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-15 15:13:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-15 15:13:51,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:51,198 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-15 15:13:51,199 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-15 15:13:51,199 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-15 15:13:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:51,208 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-15 15:13:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 15:13:51,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:51,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:51,209 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-15 15:13:51,209 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-15 15:13:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:51,218 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-15 15:13:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 15:13:51,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:51,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:51,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:51,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:51,219 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-15 15:13:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-15 15:13:51,230 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-15 15:13:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:51,230 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-15 15:13:51,230 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-15 15:13:51,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-15 15:13:53,811 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-15 15:13:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 15:13:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 15:13:53,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:53,812 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-15 15:13:53,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 15:13:54,012 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-15 15:13:54,013 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-15 15:13:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:54,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666668284] [2022-04-15 15:13:54,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-15 15:13:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012704585] [2022-04-15 15:13:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:54,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:54,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240253391] [2022-04-15 15:13:54,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:54,030 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-15 15:13:54,031 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-15 15:13:54,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:54,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:54,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:54,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:54,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {40678#true} call ULTIMATE.init(); {40678#true} is VALID [2022-04-15 15:13:54,658 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-15 15:13:54,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40686#(<= ~counter~0 0)} {40678#true} #102#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {40686#(<= ~counter~0 0)} call #t~ret9 := main(); {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,659 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-15 15:13:54,660 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-15 15:13:54,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {40686#(<= ~counter~0 0)} ~cond := #in~cond; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {40686#(<= ~counter~0 0)} assume !(0 == ~cond); {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40686#(<= ~counter~0 0)} {40686#(<= ~counter~0 0)} #90#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,662 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-15 15:13:54,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {40686#(<= ~counter~0 0)} ~cond := #in~cond; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {40686#(<= ~counter~0 0)} assume !(0 == ~cond); {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {40686#(<= ~counter~0 0)} assume true; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,663 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40686#(<= ~counter~0 0)} {40686#(<= ~counter~0 0)} #92#return; {40686#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:54,663 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-15 15:13:54,664 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-15 15:13:54,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {40735#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,665 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-15 15:13:54,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {40735#(<= ~counter~0 1)} ~cond := #in~cond; {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {40735#(<= ~counter~0 1)} assume !(0 == ~cond); {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {40735#(<= ~counter~0 1)} assume true; {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,666 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40735#(<= ~counter~0 1)} {40735#(<= ~counter~0 1)} #94#return; {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {40735#(<= ~counter~0 1)} assume !!(0 != ~r~0); {40735#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:54,667 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-15 15:13:54,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {40760#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,668 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-15 15:13:54,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {40760#(<= ~counter~0 2)} ~cond := #in~cond; {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {40760#(<= ~counter~0 2)} assume !(0 == ~cond); {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {40760#(<= ~counter~0 2)} assume true; {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,669 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40760#(<= ~counter~0 2)} {40760#(<= ~counter~0 2)} #96#return; {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {40760#(<= ~counter~0 2)} assume !(~r~0 > 0); {40760#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:54,670 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-15 15:13:54,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {40785#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {40785#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:54,671 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-15 15:13:54,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {40785#(<= ~counter~0 3)} ~cond := #in~cond; {40785#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:54,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {40785#(<= ~counter~0 3)} assume !(0 == ~cond); {40785#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:54,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {40785#(<= ~counter~0 3)} assume true; {40785#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:54,672 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40785#(<= ~counter~0 3)} {40785#(<= ~counter~0 3)} #98#return; {40785#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:54,672 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-15 15:13:54,673 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-15 15:13:54,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {40810#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,674 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-15 15:13:54,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {40810#(<= ~counter~0 4)} ~cond := #in~cond; {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {40810#(<= ~counter~0 4)} assume !(0 == ~cond); {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {40810#(<= ~counter~0 4)} assume true; {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,675 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40810#(<= ~counter~0 4)} {40810#(<= ~counter~0 4)} #98#return; {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {40810#(<= ~counter~0 4)} assume !(~r~0 < 0); {40810#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:54,676 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-15 15:13:54,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {40835#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,677 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-15 15:13:54,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {40835#(<= ~counter~0 5)} ~cond := #in~cond; {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {40835#(<= ~counter~0 5)} assume !(0 == ~cond); {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,677 INFO L290 TraceCheckUtils]: 54: Hoare triple {40835#(<= ~counter~0 5)} assume true; {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,678 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40835#(<= ~counter~0 5)} {40835#(<= ~counter~0 5)} #94#return; {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {40835#(<= ~counter~0 5)} assume !!(0 != ~r~0); {40835#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:54,679 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-15 15:13:54,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {40860#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {40860#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:54,679 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-15 15:13:54,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {40860#(<= ~counter~0 6)} ~cond := #in~cond; {40860#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:54,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {40860#(<= ~counter~0 6)} assume !(0 == ~cond); {40860#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:54,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {40860#(<= ~counter~0 6)} assume true; {40860#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:54,681 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40860#(<= ~counter~0 6)} {40860#(<= ~counter~0 6)} #96#return; {40860#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:54,681 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-15 15:13:54,682 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-15 15:13:54,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {40885#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {40885#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:54,682 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-15 15:13:54,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {40885#(<= ~counter~0 7)} ~cond := #in~cond; {40885#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:54,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {40885#(<= ~counter~0 7)} assume !(0 == ~cond); {40885#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:54,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {40885#(<= ~counter~0 7)} assume true; {40885#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:54,684 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40885#(<= ~counter~0 7)} {40885#(<= ~counter~0 7)} #96#return; {40885#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:54,684 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-15 15:13:54,685 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-15 15:13:54,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {40910#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,685 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-15 15:13:54,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {40910#(<= ~counter~0 8)} ~cond := #in~cond; {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {40910#(<= ~counter~0 8)} assume !(0 == ~cond); {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {40910#(<= ~counter~0 8)} assume true; {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,687 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40910#(<= ~counter~0 8)} {40910#(<= ~counter~0 8)} #96#return; {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,687 INFO L290 TraceCheckUtils]: 80: Hoare triple {40910#(<= ~counter~0 8)} assume !(~r~0 > 0); {40910#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:54,687 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-15 15:13:54,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {40935#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {40935#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:54,688 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-15 15:13:54,689 INFO L290 TraceCheckUtils]: 84: Hoare triple {40935#(<= ~counter~0 9)} ~cond := #in~cond; {40935#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:54,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {40935#(<= ~counter~0 9)} assume !(0 == ~cond); {40935#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:54,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {40935#(<= ~counter~0 9)} assume true; {40935#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:54,690 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40935#(<= ~counter~0 9)} {40935#(<= ~counter~0 9)} #98#return; {40935#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:54,690 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-15 15:13:54,690 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-15 15:13:54,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {40960#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,691 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-15 15:13:54,691 INFO L290 TraceCheckUtils]: 92: Hoare triple {40960#(<= ~counter~0 10)} ~cond := #in~cond; {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {40960#(<= ~counter~0 10)} assume !(0 == ~cond); {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,692 INFO L290 TraceCheckUtils]: 94: Hoare triple {40960#(<= ~counter~0 10)} assume true; {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,692 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40960#(<= ~counter~0 10)} {40960#(<= ~counter~0 10)} #98#return; {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,693 INFO L290 TraceCheckUtils]: 96: Hoare triple {40960#(<= ~counter~0 10)} assume !(~r~0 < 0); {40960#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:54,693 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-15 15:13:54,693 INFO L290 TraceCheckUtils]: 98: Hoare triple {40985#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {40679#false} is VALID [2022-04-15 15:13:54,694 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-15 15:13:54,694 INFO L290 TraceCheckUtils]: 100: Hoare triple {40679#false} ~cond := #in~cond; {40679#false} is VALID [2022-04-15 15:13:54,694 INFO L290 TraceCheckUtils]: 101: Hoare triple {40679#false} assume 0 == ~cond; {40679#false} is VALID [2022-04-15 15:13:54,694 INFO L290 TraceCheckUtils]: 102: Hoare triple {40679#false} assume !false; {40679#false} is VALID [2022-04-15 15:13:54,694 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-15 15:13:54,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:55,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {40679#false} assume !false; {40679#false} is VALID [2022-04-15 15:13:55,261 INFO L290 TraceCheckUtils]: 101: Hoare triple {40679#false} assume 0 == ~cond; {40679#false} is VALID [2022-04-15 15:13:55,261 INFO L290 TraceCheckUtils]: 100: Hoare triple {40679#false} ~cond := #in~cond; {40679#false} is VALID [2022-04-15 15:13:55,261 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-15 15:13:55,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {41013#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {40679#false} is VALID [2022-04-15 15:13:55,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {41017#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41013#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:13:55,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {41017#(< ~counter~0 50)} assume !(~r~0 < 0); {41017#(< ~counter~0 50)} is VALID [2022-04-15 15:13:55,262 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {40678#true} {41017#(< ~counter~0 50)} #98#return; {41017#(< ~counter~0 50)} is VALID [2022-04-15 15:13:55,262 INFO L290 TraceCheckUtils]: 94: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,262 INFO L272 TraceCheckUtils]: 91: Hoare triple {41017#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:13:55,263 INFO L290 TraceCheckUtils]: 90: Hoare triple {41017#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {41017#(< ~counter~0 50)} is VALID [2022-04-15 15:13:55,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {41042#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41017#(< ~counter~0 50)} is VALID [2022-04-15 15:13:55,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {41042#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41042#(< ~counter~0 49)} is VALID [2022-04-15 15:13:55,264 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {40678#true} {41042#(< ~counter~0 49)} #98#return; {41042#(< ~counter~0 49)} is VALID [2022-04-15 15:13:55,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,265 INFO L272 TraceCheckUtils]: 83: Hoare triple {41042#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:13:55,265 INFO L290 TraceCheckUtils]: 82: Hoare triple {41042#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {41042#(< ~counter~0 49)} is VALID [2022-04-15 15:13:55,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {41067#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41042#(< ~counter~0 49)} is VALID [2022-04-15 15:13:55,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {41067#(< ~counter~0 48)} assume !(~r~0 > 0); {41067#(< ~counter~0 48)} is VALID [2022-04-15 15:13:55,266 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {40678#true} {41067#(< ~counter~0 48)} #96#return; {41067#(< ~counter~0 48)} is VALID [2022-04-15 15:13:55,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,267 INFO L290 TraceCheckUtils]: 76: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,267 INFO L272 TraceCheckUtils]: 75: Hoare triple {41067#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:13:55,267 INFO L290 TraceCheckUtils]: 74: Hoare triple {41067#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {41067#(< ~counter~0 48)} is VALID [2022-04-15 15:13:55,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {41092#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41067#(< ~counter~0 48)} is VALID [2022-04-15 15:13:55,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {41092#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41092#(< ~counter~0 47)} is VALID [2022-04-15 15:13:55,269 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {40678#true} {41092#(< ~counter~0 47)} #96#return; {41092#(< ~counter~0 47)} is VALID [2022-04-15 15:13:55,269 INFO L290 TraceCheckUtils]: 70: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,269 INFO L272 TraceCheckUtils]: 67: Hoare triple {41092#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:13:55,270 INFO L290 TraceCheckUtils]: 66: Hoare triple {41092#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {41092#(< ~counter~0 47)} is VALID [2022-04-15 15:13:55,270 INFO L290 TraceCheckUtils]: 65: Hoare triple {41117#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41092#(< ~counter~0 47)} is VALID [2022-04-15 15:13:55,271 INFO L290 TraceCheckUtils]: 64: Hoare triple {41117#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41117#(< ~counter~0 46)} is VALID [2022-04-15 15:13:55,271 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {40678#true} {41117#(< ~counter~0 46)} #96#return; {41117#(< ~counter~0 46)} is VALID [2022-04-15 15:13:55,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,272 INFO L290 TraceCheckUtils]: 61: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,272 INFO L290 TraceCheckUtils]: 60: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,272 INFO L272 TraceCheckUtils]: 59: Hoare triple {41117#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:13:55,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {41117#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {41117#(< ~counter~0 46)} is VALID [2022-04-15 15:13:55,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {41142#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41117#(< ~counter~0 46)} is VALID [2022-04-15 15:13:55,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {41142#(< ~counter~0 45)} assume !!(0 != ~r~0); {41142#(< ~counter~0 45)} is VALID [2022-04-15 15:13:55,274 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {40678#true} {41142#(< ~counter~0 45)} #94#return; {41142#(< ~counter~0 45)} is VALID [2022-04-15 15:13:55,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,274 INFO L272 TraceCheckUtils]: 51: Hoare triple {41142#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:13:55,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {41142#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {41142#(< ~counter~0 45)} is VALID [2022-04-15 15:13:55,275 INFO L290 TraceCheckUtils]: 49: Hoare triple {41167#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41142#(< ~counter~0 45)} is VALID [2022-04-15 15:13:55,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {41167#(< ~counter~0 44)} assume !(~r~0 < 0); {41167#(< ~counter~0 44)} is VALID [2022-04-15 15:13:55,276 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {40678#true} {41167#(< ~counter~0 44)} #98#return; {41167#(< ~counter~0 44)} is VALID [2022-04-15 15:13:55,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,276 INFO L272 TraceCheckUtils]: 43: Hoare triple {41167#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:13:55,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {41167#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {41167#(< ~counter~0 44)} is VALID [2022-04-15 15:13:55,277 INFO L290 TraceCheckUtils]: 41: Hoare triple {41192#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41167#(< ~counter~0 44)} is VALID [2022-04-15 15:13:55,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {41192#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41192#(< ~counter~0 43)} is VALID [2022-04-15 15:13:55,278 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {40678#true} {41192#(< ~counter~0 43)} #98#return; {41192#(< ~counter~0 43)} is VALID [2022-04-15 15:13:55,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,279 INFO L272 TraceCheckUtils]: 35: Hoare triple {41192#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:13:55,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {41192#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {41192#(< ~counter~0 43)} is VALID [2022-04-15 15:13:55,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {41217#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41192#(< ~counter~0 43)} is VALID [2022-04-15 15:13:55,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {41217#(< ~counter~0 42)} assume !(~r~0 > 0); {41217#(< ~counter~0 42)} is VALID [2022-04-15 15:13:55,281 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {40678#true} {41217#(< ~counter~0 42)} #96#return; {41217#(< ~counter~0 42)} is VALID [2022-04-15 15:13:55,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,281 INFO L272 TraceCheckUtils]: 27: Hoare triple {41217#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:13:55,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {41217#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {41217#(< ~counter~0 42)} is VALID [2022-04-15 15:13:55,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {41242#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41217#(< ~counter~0 42)} is VALID [2022-04-15 15:13:55,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {41242#(< ~counter~0 41)} assume !!(0 != ~r~0); {41242#(< ~counter~0 41)} is VALID [2022-04-15 15:13:55,283 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {40678#true} {41242#(< ~counter~0 41)} #94#return; {41242#(< ~counter~0 41)} is VALID [2022-04-15 15:13:55,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,283 INFO L272 TraceCheckUtils]: 19: Hoare triple {41242#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:13:55,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {41242#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {41242#(< ~counter~0 41)} is VALID [2022-04-15 15:13:55,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {41267#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41242#(< ~counter~0 41)} is VALID [2022-04-15 15:13:55,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {41267#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {40678#true} {41267#(< ~counter~0 40)} #92#return; {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {41267#(< ~counter~0 40)} call assume_abort_if_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-15 15:13:55,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40678#true} {41267#(< ~counter~0 40)} #90#return; {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {40678#true} assume true; {40678#true} is VALID [2022-04-15 15:13:55,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {40678#true} assume !(0 == ~cond); {40678#true} is VALID [2022-04-15 15:13:55,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {40678#true} ~cond := #in~cond; {40678#true} is VALID [2022-04-15 15:13:55,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {41267#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40678#true} is VALID [2022-04-15 15:13:55,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {41267#(< ~counter~0 40)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 40)} is VALID [2022-04-15 15:13:55,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {41267#(< ~counter~0 40)} call #t~ret9 := main(); {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41267#(< ~counter~0 40)} {40678#true} #102#return; {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {41267#(< ~counter~0 40)} assume true; {41267#(< ~counter~0 40)} is VALID [2022-04-15 15:13:55,288 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 40)} is VALID [2022-04-15 15:13:55,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {40678#true} call ULTIMATE.init(); {40678#true} is VALID [2022-04-15 15:13:55,289 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-15 15:13:55,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:55,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012704585] [2022-04-15 15:13:55,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:55,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240253391] [2022-04-15 15:13:55,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240253391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:55,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:55,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:13:55,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666668284] [2022-04-15 15:13:55,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666668284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:55,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:55,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:13:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810971126] [2022-04-15 15:13:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:55,292 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-15 15:13:55,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:55,293 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-15 15:13:55,365 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-15 15:13:55,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:13:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:13:55,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:13:55,366 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-15 15:13:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:56,667 INFO L93 Difference]: Finished difference Result 407 states and 538 transitions. [2022-04-15 15:13:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:13:56,667 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-15 15:13:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:56,667 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-15 15:13:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:13:56,670 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-15 15:13:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:13:56,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-15 15:13:56,849 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-15 15:13:56,859 INFO L225 Difference]: With dead ends: 407 [2022-04-15 15:13:56,859 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 15:13:56,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 15:13:56,860 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 170 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:56,860 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.2s Time] [2022-04-15 15:13:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 15:13:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2022-04-15 15:13:57,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:57,447 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-15 15:13:57,447 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-15 15:13:57,448 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-15 15:13:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:57,454 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-15 15:13:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-15 15:13:57,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:57,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:57,455 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-15 15:13:57,456 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-15 15:13:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:57,465 INFO L93 Difference]: Finished difference Result 396 states and 523 transitions. [2022-04-15 15:13:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 523 transitions. [2022-04-15 15:13:57,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:57,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:57,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:57,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:57,467 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-15 15:13:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 501 transitions. [2022-04-15 15:13:57,478 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 501 transitions. Word has length 103 [2022-04-15 15:13:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:57,479 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 501 transitions. [2022-04-15 15:13:57,479 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-15 15:13:57,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 501 transitions. [2022-04-15 15:13:58,686 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-15 15:13:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 501 transitions. [2022-04-15 15:13:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:13:58,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:58,687 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-15 15:13:58,703 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-15 15:13:58,891 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-15 15:13:58,891 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:58,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-15 15:13:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812947413] [2022-04-15 15:13:58,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-15 15:13:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:58,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984762863] [2022-04-15 15:13:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:58,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820448955] [2022-04-15 15:13:58,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:58,905 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-15 15:13:58,906 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-15 15:13:58,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:58,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:58,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:13:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:58,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:59,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {43695#true} call ULTIMATE.init(); {43695#true} is VALID [2022-04-15 15:13:59,797 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-15 15:13:59,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43695#true} {43695#true} #102#return; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {43695#true} call #t~ret9 := main(); {43695#true} is VALID [2022-04-15 15:13:59,798 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-15 15:13:59,798 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-15 15:13:59,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43695#true} {43695#true} #90#return; {43695#true} is VALID [2022-04-15 15:13:59,798 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-15 15:13:59,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43695#true} {43695#true} #92#return; {43695#true} is VALID [2022-04-15 15:13:59,798 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-15 15:13:59,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {43695#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43695#true} is VALID [2022-04-15 15:13:59,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {43695#true} assume !!(#t~post6 < 50);havoc #t~post6; {43695#true} is VALID [2022-04-15 15:13:59,799 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-15 15:13:59,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43695#true} {43695#true} #94#return; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#true} assume !!(0 != ~r~0); {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {43695#true} assume !!(#t~post7 < 50);havoc #t~post7; {43695#true} is VALID [2022-04-15 15:13:59,799 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-15 15:13:59,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43695#true} {43695#true} #96#return; {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {43695#true} assume !(~r~0 > 0); {43695#true} is VALID [2022-04-15 15:13:59,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {43695#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43695#true} is VALID [2022-04-15 15:13:59,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {43695#true} assume !!(#t~post8 < 50);havoc #t~post8; {43695#true} is VALID [2022-04-15 15:13:59,800 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-15 15:13:59,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,800 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43695#true} {43695#true} #98#return; {43695#true} is VALID [2022-04-15 15:13:59,801 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-15 15:13:59,801 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-15 15:13:59,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:13:59,802 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-15 15:13:59,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,802 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-15 15:13:59,803 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-15 15:13:59,803 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-15 15:13:59,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:13:59,803 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-15 15:13:59,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,804 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-15 15:13:59,804 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-15 15:13:59,805 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-15 15:13:59,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {43820#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {43820#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:13:59,805 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-15 15:13:59,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,806 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-15 15:13:59,806 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-15 15:13:59,807 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-15 15:13:59,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {43893#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:13:59,807 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-15 15:13:59,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,807 INFO L290 TraceCheckUtils]: 69: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,808 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-15 15:13:59,808 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-15 15:13:59,808 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-15 15:13:59,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:59,809 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-15 15:13:59,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,809 INFO L290 TraceCheckUtils]: 78: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,809 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-15 15:13:59,810 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-15 15:13:59,810 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-15 15:13:59,810 INFO L290 TraceCheckUtils]: 82: Hoare triple {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {43918#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:59,810 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-15 15:13:59,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,811 INFO L290 TraceCheckUtils]: 86: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,811 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-15 15:13:59,812 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-15 15:13:59,812 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-15 15:13:59,812 INFO L290 TraceCheckUtils]: 90: Hoare triple {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {43967#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:13:59,812 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-15 15:13:59,812 INFO L290 TraceCheckUtils]: 92: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:13:59,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:13:59,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:13:59,813 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-15 15:13:59,814 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-15 15:13:59,814 INFO L290 TraceCheckUtils]: 97: Hoare triple {43696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43696#false} is VALID [2022-04-15 15:13:59,814 INFO L290 TraceCheckUtils]: 98: Hoare triple {43696#false} assume !(#t~post8 < 50);havoc #t~post8; {43696#false} is VALID [2022-04-15 15:13:59,814 INFO L290 TraceCheckUtils]: 99: Hoare triple {43696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43696#false} is VALID [2022-04-15 15:13:59,814 INFO L290 TraceCheckUtils]: 100: Hoare triple {43696#false} assume !(#t~post6 < 50);havoc #t~post6; {43696#false} is VALID [2022-04-15 15:13:59,814 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-15 15:13:59,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {43696#false} ~cond := #in~cond; {43696#false} is VALID [2022-04-15 15:13:59,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {43696#false} assume 0 == ~cond; {43696#false} is VALID [2022-04-15 15:13:59,814 INFO L290 TraceCheckUtils]: 104: Hoare triple {43696#false} assume !false; {43696#false} is VALID [2022-04-15 15:13:59,815 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-15 15:13:59,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:00,255 INFO L290 TraceCheckUtils]: 104: Hoare triple {43696#false} assume !false; {43696#false} is VALID [2022-04-15 15:14:00,256 INFO L290 TraceCheckUtils]: 103: Hoare triple {43696#false} assume 0 == ~cond; {43696#false} is VALID [2022-04-15 15:14:00,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {43696#false} ~cond := #in~cond; {43696#false} is VALID [2022-04-15 15:14:00,256 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-15 15:14:00,256 INFO L290 TraceCheckUtils]: 100: Hoare triple {43696#false} assume !(#t~post6 < 50);havoc #t~post6; {43696#false} is VALID [2022-04-15 15:14:00,256 INFO L290 TraceCheckUtils]: 99: Hoare triple {43696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43696#false} is VALID [2022-04-15 15:14:00,256 INFO L290 TraceCheckUtils]: 98: Hoare triple {43696#false} assume !(#t~post8 < 50);havoc #t~post8; {43696#false} is VALID [2022-04-15 15:14:00,256 INFO L290 TraceCheckUtils]: 97: Hoare triple {43696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43696#false} is VALID [2022-04-15 15:14:00,257 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-15 15:14:00,257 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-15 15:14:00,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,258 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-15 15:14:00,258 INFO L290 TraceCheckUtils]: 90: Hoare triple {44040#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {44040#(not (< main_~r~0 0))} is VALID [2022-04-15 15:14:00,259 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-15 15:14:00,259 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-15 15:14:00,260 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-15 15:14:00,260 INFO L290 TraceCheckUtils]: 86: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,260 INFO L290 TraceCheckUtils]: 85: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,260 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-15 15:14:00,261 INFO L290 TraceCheckUtils]: 82: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:14:00,261 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-15 15:14:00,261 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-15 15:14:00,262 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-15 15:14:00,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,262 INFO L290 TraceCheckUtils]: 76: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,262 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-15 15:14:00,263 INFO L290 TraceCheckUtils]: 74: Hoare triple {44065#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {44065#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:14:00,263 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-15 15:14:00,264 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-15 15:14:00,264 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-15 15:14:00,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,264 INFO L290 TraceCheckUtils]: 69: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,264 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-15 15:14:00,265 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 < 50);havoc #t~post7; {44114#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:14:00,265 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-15 15:14:00,266 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-15 15:14:00,266 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-15 15:14:00,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,267 INFO L290 TraceCheckUtils]: 60: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,267 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-15 15:14:00,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:14:00,267 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-15 15:14:00,268 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-15 15:14:00,268 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-15 15:14:00,268 INFO L290 TraceCheckUtils]: 54: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,268 INFO L290 TraceCheckUtils]: 53: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,268 INFO L290 TraceCheckUtils]: 52: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,268 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-15 15:14:00,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:14:00,269 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-15 15:14:00,269 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-15 15:14:00,270 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-15 15:14:00,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,270 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-15 15:14:00,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {44139#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {44139#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:14:00,270 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-15 15:14:00,271 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-15 15:14:00,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {43695#true} {43695#true} #98#return; {43695#true} is VALID [2022-04-15 15:14:00,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,271 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-15 15:14:00,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {43695#true} assume !!(#t~post8 < 50);havoc #t~post8; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {43695#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {43695#true} assume !(~r~0 > 0); {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {43695#true} {43695#true} #96#return; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 30: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 29: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,272 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-15 15:14:00,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {43695#true} assume !!(#t~post7 < 50);havoc #t~post7; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {43695#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {43695#true} assume !!(0 != ~r~0); {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43695#true} {43695#true} #94#return; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,272 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-15 15:14:00,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {43695#true} assume !!(#t~post6 < 50);havoc #t~post6; {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {43695#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43695#true} is VALID [2022-04-15 15:14:00,273 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-15 15:14:00,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43695#true} {43695#true} #92#return; {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,273 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-15 15:14:00,273 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43695#true} {43695#true} #90#return; {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {43695#true} assume !(0 == ~cond); {43695#true} is VALID [2022-04-15 15:14:00,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {43695#true} ~cond := #in~cond; {43695#true} is VALID [2022-04-15 15:14:00,273 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-15 15:14:00,273 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-15 15:14:00,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {43695#true} call #t~ret9 := main(); {43695#true} is VALID [2022-04-15 15:14:00,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43695#true} {43695#true} #102#return; {43695#true} is VALID [2022-04-15 15:14:00,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {43695#true} assume true; {43695#true} is VALID [2022-04-15 15:14:00,274 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-15 15:14:00,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {43695#true} call ULTIMATE.init(); {43695#true} is VALID [2022-04-15 15:14:00,274 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-15 15:14:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984762863] [2022-04-15 15:14:00,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:00,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820448955] [2022-04-15 15:14:00,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820448955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:00,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:00,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:14:00,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:00,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812947413] [2022-04-15 15:14:00,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812947413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:00,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:00,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:14:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144636970] [2022-04-15 15:14:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:00,276 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-15 15:14:00,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:00,276 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-15 15:14:00,350 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-15 15:14:00,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:14:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:00,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:14:00,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:14:00,351 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-15 15:14:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:02,029 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2022-04-15 15:14:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:14:02,029 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-15 15:14:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:02,030 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-15 15:14:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:14:02,031 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-15 15:14:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:14:02,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-15 15:14:02,168 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-15 15:14:02,191 INFO L225 Difference]: With dead ends: 649 [2022-04-15 15:14:02,191 INFO L226 Difference]: Without dead ends: 588 [2022-04-15 15:14:02,192 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-15 15:14:02,192 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-15 15:14:02,192 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-15 15:14:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-15 15:14:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 504. [2022-04-15 15:14:03,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:03,182 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-15 15:14:03,182 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-15 15:14:03,183 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-15 15:14:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:03,204 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-15 15:14:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-15 15:14:03,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:03,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:03,206 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-15 15:14:03,207 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-15 15:14:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:03,227 INFO L93 Difference]: Finished difference Result 588 states and 816 transitions. [2022-04-15 15:14:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2022-04-15 15:14:03,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:03,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:03,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:03,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:03,230 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-15 15:14:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 695 transitions. [2022-04-15 15:14:03,251 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 695 transitions. Word has length 105 [2022-04-15 15:14:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:03,251 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 695 transitions. [2022-04-15 15:14:03,251 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-15 15:14:03,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 695 transitions. [2022-04-15 15:14:05,133 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-15 15:14:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 695 transitions. [2022-04-15 15:14:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:14:05,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:05,134 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-15 15:14:05,150 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-15 15:14:05,334 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-15 15:14:05,335 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-15 15:14:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:05,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659000807] [2022-04-15 15:14:05,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-15 15:14:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:05,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225311745] [2022-04-15 15:14:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:05,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:05,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495013768] [2022-04-15 15:14:05,347 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:14:05,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:05,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:05,348 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-15 15:14:05,367 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-15 15:14:05,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:14:05,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:05,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:14:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:05,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:05,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {47822#true} call ULTIMATE.init(); {47822#true} is VALID [2022-04-15 15:14:05,981 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-15 15:14:05,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47830#(<= ~counter~0 0)} {47822#true} #102#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {47830#(<= ~counter~0 0)} call #t~ret9 := main(); {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,982 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-15 15:14:05,983 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-15 15:14:05,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {47830#(<= ~counter~0 0)} ~cond := #in~cond; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {47830#(<= ~counter~0 0)} assume !(0 == ~cond); {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47830#(<= ~counter~0 0)} {47830#(<= ~counter~0 0)} #90#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,984 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-15 15:14:05,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {47830#(<= ~counter~0 0)} ~cond := #in~cond; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {47830#(<= ~counter~0 0)} assume !(0 == ~cond); {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {47830#(<= ~counter~0 0)} assume true; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,986 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47830#(<= ~counter~0 0)} {47830#(<= ~counter~0 0)} #92#return; {47830#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:05,986 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-15 15:14:05,987 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-15 15:14:05,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {47879#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,988 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-15 15:14:05,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {47879#(<= ~counter~0 1)} ~cond := #in~cond; {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {47879#(<= ~counter~0 1)} assume !(0 == ~cond); {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {47879#(<= ~counter~0 1)} assume true; {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,989 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47879#(<= ~counter~0 1)} {47879#(<= ~counter~0 1)} #94#return; {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {47879#(<= ~counter~0 1)} assume !!(0 != ~r~0); {47879#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:05,990 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-15 15:14:05,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {47904#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,991 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-15 15:14:05,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {47904#(<= ~counter~0 2)} ~cond := #in~cond; {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {47904#(<= ~counter~0 2)} assume !(0 == ~cond); {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {47904#(<= ~counter~0 2)} assume true; {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,992 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47904#(<= ~counter~0 2)} {47904#(<= ~counter~0 2)} #96#return; {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {47904#(<= ~counter~0 2)} assume !(~r~0 > 0); {47904#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:05,993 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-15 15:14:05,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {47929#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {47929#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:05,994 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-15 15:14:05,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {47929#(<= ~counter~0 3)} ~cond := #in~cond; {47929#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:05,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {47929#(<= ~counter~0 3)} assume !(0 == ~cond); {47929#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:05,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {47929#(<= ~counter~0 3)} assume true; {47929#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:05,995 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47929#(<= ~counter~0 3)} {47929#(<= ~counter~0 3)} #98#return; {47929#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:05,995 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-15 15:14:05,996 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-15 15:14:05,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {47954#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,997 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-15 15:14:05,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {47954#(<= ~counter~0 4)} ~cond := #in~cond; {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {47954#(<= ~counter~0 4)} assume !(0 == ~cond); {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {47954#(<= ~counter~0 4)} assume true; {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,998 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47954#(<= ~counter~0 4)} {47954#(<= ~counter~0 4)} #98#return; {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,998 INFO L290 TraceCheckUtils]: 48: Hoare triple {47954#(<= ~counter~0 4)} assume !(~r~0 < 0); {47954#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:05,999 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-15 15:14:05,999 INFO L290 TraceCheckUtils]: 50: Hoare triple {47979#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,000 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-15 15:14:06,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {47979#(<= ~counter~0 5)} ~cond := #in~cond; {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {47979#(<= ~counter~0 5)} assume !(0 == ~cond); {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {47979#(<= ~counter~0 5)} assume true; {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,001 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47979#(<= ~counter~0 5)} {47979#(<= ~counter~0 5)} #94#return; {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,001 INFO L290 TraceCheckUtils]: 56: Hoare triple {47979#(<= ~counter~0 5)} assume !!(0 != ~r~0); {47979#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:06,002 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-15 15:14:06,002 INFO L290 TraceCheckUtils]: 58: Hoare triple {48004#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {48004#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:06,003 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-15 15:14:06,003 INFO L290 TraceCheckUtils]: 60: Hoare triple {48004#(<= ~counter~0 6)} ~cond := #in~cond; {48004#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:06,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {48004#(<= ~counter~0 6)} assume !(0 == ~cond); {48004#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:06,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {48004#(<= ~counter~0 6)} assume true; {48004#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:06,004 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48004#(<= ~counter~0 6)} {48004#(<= ~counter~0 6)} #96#return; {48004#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:06,004 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-15 15:14:06,005 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-15 15:14:06,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {48029#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {48029#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:06,006 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-15 15:14:06,006 INFO L290 TraceCheckUtils]: 68: Hoare triple {48029#(<= ~counter~0 7)} ~cond := #in~cond; {48029#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:06,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {48029#(<= ~counter~0 7)} assume !(0 == ~cond); {48029#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:06,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {48029#(<= ~counter~0 7)} assume true; {48029#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:06,007 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48029#(<= ~counter~0 7)} {48029#(<= ~counter~0 7)} #96#return; {48029#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:06,007 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-15 15:14:06,008 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-15 15:14:06,008 INFO L290 TraceCheckUtils]: 74: Hoare triple {48054#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {48054#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:06,009 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-15 15:14:06,009 INFO L290 TraceCheckUtils]: 76: Hoare triple {48054#(<= ~counter~0 8)} ~cond := #in~cond; {48054#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:06,009 INFO L290 TraceCheckUtils]: 77: Hoare triple {48054#(<= ~counter~0 8)} assume !(0 == ~cond); {48054#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:06,009 INFO L290 TraceCheckUtils]: 78: Hoare triple {48054#(<= ~counter~0 8)} assume true; {48054#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:06,010 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48054#(<= ~counter~0 8)} {48054#(<= ~counter~0 8)} #96#return; {48054#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:06,010 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-15 15:14:06,011 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-15 15:14:06,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {48079#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,012 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-15 15:14:06,012 INFO L290 TraceCheckUtils]: 84: Hoare triple {48079#(<= ~counter~0 9)} ~cond := #in~cond; {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,012 INFO L290 TraceCheckUtils]: 85: Hoare triple {48079#(<= ~counter~0 9)} assume !(0 == ~cond); {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,012 INFO L290 TraceCheckUtils]: 86: Hoare triple {48079#(<= ~counter~0 9)} assume true; {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,013 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48079#(<= ~counter~0 9)} {48079#(<= ~counter~0 9)} #96#return; {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,013 INFO L290 TraceCheckUtils]: 88: Hoare triple {48079#(<= ~counter~0 9)} assume !(~r~0 > 0); {48079#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:06,014 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-15 15:14:06,014 INFO L290 TraceCheckUtils]: 90: Hoare triple {48104#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {48104#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:06,015 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-15 15:14:06,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {48104#(<= ~counter~0 10)} ~cond := #in~cond; {48104#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:06,015 INFO L290 TraceCheckUtils]: 93: Hoare triple {48104#(<= ~counter~0 10)} assume !(0 == ~cond); {48104#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:06,015 INFO L290 TraceCheckUtils]: 94: Hoare triple {48104#(<= ~counter~0 10)} assume true; {48104#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:06,016 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48104#(<= ~counter~0 10)} {48104#(<= ~counter~0 10)} #98#return; {48104#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:06,016 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-15 15:14:06,017 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-15 15:14:06,017 INFO L290 TraceCheckUtils]: 98: Hoare triple {48129#(<= |main_#t~post8| 10)} assume !(#t~post8 < 50);havoc #t~post8; {47823#false} is VALID [2022-04-15 15:14:06,017 INFO L290 TraceCheckUtils]: 99: Hoare triple {47823#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47823#false} is VALID [2022-04-15 15:14:06,017 INFO L290 TraceCheckUtils]: 100: Hoare triple {47823#false} assume !(#t~post6 < 50);havoc #t~post6; {47823#false} is VALID [2022-04-15 15:14:06,017 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-15 15:14:06,017 INFO L290 TraceCheckUtils]: 102: Hoare triple {47823#false} ~cond := #in~cond; {47823#false} is VALID [2022-04-15 15:14:06,017 INFO L290 TraceCheckUtils]: 103: Hoare triple {47823#false} assume 0 == ~cond; {47823#false} is VALID [2022-04-15 15:14:06,017 INFO L290 TraceCheckUtils]: 104: Hoare triple {47823#false} assume !false; {47823#false} is VALID [2022-04-15 15:14:06,018 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-15 15:14:06,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:06,590 INFO L290 TraceCheckUtils]: 104: Hoare triple {47823#false} assume !false; {47823#false} is VALID [2022-04-15 15:14:06,590 INFO L290 TraceCheckUtils]: 103: Hoare triple {47823#false} assume 0 == ~cond; {47823#false} is VALID [2022-04-15 15:14:06,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {47823#false} ~cond := #in~cond; {47823#false} is VALID [2022-04-15 15:14:06,590 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-15 15:14:06,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {47823#false} assume !(#t~post6 < 50);havoc #t~post6; {47823#false} is VALID [2022-04-15 15:14:06,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {47823#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {47823#false} is VALID [2022-04-15 15:14:06,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {48169#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {47823#false} is VALID [2022-04-15 15:14:06,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {48173#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48169#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:14:06,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {48173#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48173#(< ~counter~0 50)} is VALID [2022-04-15 15:14:06,591 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {47822#true} {48173#(< ~counter~0 50)} #98#return; {48173#(< ~counter~0 50)} is VALID [2022-04-15 15:14:06,592 INFO L290 TraceCheckUtils]: 94: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,592 INFO L272 TraceCheckUtils]: 91: Hoare triple {48173#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:06,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {48173#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {48173#(< ~counter~0 50)} is VALID [2022-04-15 15:14:06,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {48198#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48173#(< ~counter~0 50)} is VALID [2022-04-15 15:14:06,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {48198#(< ~counter~0 49)} assume !(~r~0 > 0); {48198#(< ~counter~0 49)} is VALID [2022-04-15 15:14:06,594 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {47822#true} {48198#(< ~counter~0 49)} #96#return; {48198#(< ~counter~0 49)} is VALID [2022-04-15 15:14:06,594 INFO L290 TraceCheckUtils]: 86: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,594 INFO L290 TraceCheckUtils]: 85: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,594 INFO L272 TraceCheckUtils]: 83: Hoare triple {48198#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:06,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {48198#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {48198#(< ~counter~0 49)} is VALID [2022-04-15 15:14:06,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {48223#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48198#(< ~counter~0 49)} is VALID [2022-04-15 15:14:06,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {48223#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48223#(< ~counter~0 48)} is VALID [2022-04-15 15:14:06,596 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {47822#true} {48223#(< ~counter~0 48)} #96#return; {48223#(< ~counter~0 48)} is VALID [2022-04-15 15:14:06,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,596 INFO L272 TraceCheckUtils]: 75: Hoare triple {48223#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:06,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {48223#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {48223#(< ~counter~0 48)} is VALID [2022-04-15 15:14:06,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {48248#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48223#(< ~counter~0 48)} is VALID [2022-04-15 15:14:06,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {48248#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48248#(< ~counter~0 47)} is VALID [2022-04-15 15:14:06,598 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {47822#true} {48248#(< ~counter~0 47)} #96#return; {48248#(< ~counter~0 47)} is VALID [2022-04-15 15:14:06,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,598 INFO L272 TraceCheckUtils]: 67: Hoare triple {48248#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:06,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {48248#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {48248#(< ~counter~0 47)} is VALID [2022-04-15 15:14:06,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {48273#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48248#(< ~counter~0 47)} is VALID [2022-04-15 15:14:06,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {48273#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48273#(< ~counter~0 46)} is VALID [2022-04-15 15:14:06,600 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {47822#true} {48273#(< ~counter~0 46)} #96#return; {48273#(< ~counter~0 46)} is VALID [2022-04-15 15:14:06,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,600 INFO L272 TraceCheckUtils]: 59: Hoare triple {48273#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:06,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {48273#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {48273#(< ~counter~0 46)} is VALID [2022-04-15 15:14:06,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {48298#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48273#(< ~counter~0 46)} is VALID [2022-04-15 15:14:06,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {48298#(< ~counter~0 45)} assume !!(0 != ~r~0); {48298#(< ~counter~0 45)} is VALID [2022-04-15 15:14:06,602 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {47822#true} {48298#(< ~counter~0 45)} #94#return; {48298#(< ~counter~0 45)} is VALID [2022-04-15 15:14:06,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,602 INFO L272 TraceCheckUtils]: 51: Hoare triple {48298#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:06,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {48298#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {48298#(< ~counter~0 45)} is VALID [2022-04-15 15:14:06,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {48323#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48298#(< ~counter~0 45)} is VALID [2022-04-15 15:14:06,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {48323#(< ~counter~0 44)} assume !(~r~0 < 0); {48323#(< ~counter~0 44)} is VALID [2022-04-15 15:14:06,604 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {47822#true} {48323#(< ~counter~0 44)} #98#return; {48323#(< ~counter~0 44)} is VALID [2022-04-15 15:14:06,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,604 INFO L272 TraceCheckUtils]: 43: Hoare triple {48323#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:06,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {48323#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {48323#(< ~counter~0 44)} is VALID [2022-04-15 15:14:06,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {48348#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48323#(< ~counter~0 44)} is VALID [2022-04-15 15:14:06,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {48348#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48348#(< ~counter~0 43)} is VALID [2022-04-15 15:14:06,606 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {47822#true} {48348#(< ~counter~0 43)} #98#return; {48348#(< ~counter~0 43)} is VALID [2022-04-15 15:14:06,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,606 INFO L272 TraceCheckUtils]: 35: Hoare triple {48348#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:06,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {48348#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {48348#(< ~counter~0 43)} is VALID [2022-04-15 15:14:06,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {48373#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48348#(< ~counter~0 43)} is VALID [2022-04-15 15:14:06,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {48373#(< ~counter~0 42)} assume !(~r~0 > 0); {48373#(< ~counter~0 42)} is VALID [2022-04-15 15:14:06,608 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {47822#true} {48373#(< ~counter~0 42)} #96#return; {48373#(< ~counter~0 42)} is VALID [2022-04-15 15:14:06,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {48373#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:06,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {48373#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {48373#(< ~counter~0 42)} is VALID [2022-04-15 15:14:06,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {48398#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48373#(< ~counter~0 42)} is VALID [2022-04-15 15:14:06,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {48398#(< ~counter~0 41)} assume !!(0 != ~r~0); {48398#(< ~counter~0 41)} is VALID [2022-04-15 15:14:06,610 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {47822#true} {48398#(< ~counter~0 41)} #94#return; {48398#(< ~counter~0 41)} is VALID [2022-04-15 15:14:06,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,610 INFO L272 TraceCheckUtils]: 19: Hoare triple {48398#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:06,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {48398#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {48398#(< ~counter~0 41)} is VALID [2022-04-15 15:14:06,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {48423#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48398#(< ~counter~0 41)} is VALID [2022-04-15 15:14:06,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {48423#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {47822#true} {48423#(< ~counter~0 40)} #92#return; {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L272 TraceCheckUtils]: 11: Hoare triple {48423#(< ~counter~0 40)} call assume_abort_if_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-15 15:14:06,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {47822#true} {48423#(< ~counter~0 40)} #90#return; {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {47822#true} assume true; {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {47822#true} assume !(0 == ~cond); {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {47822#true} ~cond := #in~cond; {47822#true} is VALID [2022-04-15 15:14:06,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {48423#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {47822#true} is VALID [2022-04-15 15:14:06,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {48423#(< ~counter~0 40)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 40)} is VALID [2022-04-15 15:14:06,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {48423#(< ~counter~0 40)} call #t~ret9 := main(); {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48423#(< ~counter~0 40)} {47822#true} #102#return; {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {48423#(< ~counter~0 40)} assume true; {48423#(< ~counter~0 40)} is VALID [2022-04-15 15:14:06,614 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 40)} is VALID [2022-04-15 15:14:06,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {47822#true} call ULTIMATE.init(); {47822#true} is VALID [2022-04-15 15:14:06,614 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-15 15:14:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225311745] [2022-04-15 15:14:06,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495013768] [2022-04-15 15:14:06,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495013768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:06,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:06,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:14:06,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659000807] [2022-04-15 15:14:06,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659000807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:06,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:06,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:14:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70976123] [2022-04-15 15:14:06,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:06,616 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-15 15:14:06,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:06,616 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-15 15:14:06,692 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-15 15:14:06,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:14:06,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:06,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:14:06,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:14:06,693 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-15 15:14:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:08,461 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2022-04-15 15:14:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 15:14:08,461 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-15 15:14:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:08,461 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-15 15:14:08,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:14:08,463 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-15 15:14:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:14:08,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-15 15:14:08,640 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-15 15:14:08,653 INFO L225 Difference]: With dead ends: 753 [2022-04-15 15:14:08,653 INFO L226 Difference]: Without dead ends: 532 [2022-04-15 15:14:08,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:14:08,654 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-15 15:14:08,654 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-15 15:14:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-15 15:14:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 522. [2022-04-15 15:14:09,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:09,718 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-15 15:14:09,718 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-15 15:14:09,718 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-15 15:14:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:09,732 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-15 15:14:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-15 15:14:09,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:09,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:09,733 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-15 15:14:09,733 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-15 15:14:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:09,749 INFO L93 Difference]: Finished difference Result 532 states and 727 transitions. [2022-04-15 15:14:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 727 transitions. [2022-04-15 15:14:09,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:09,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:09,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:09,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:09,752 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-15 15:14:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2022-04-15 15:14:09,774 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 105 [2022-04-15 15:14:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:09,774 INFO L478 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2022-04-15 15:14:09,774 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-15 15:14:09,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 522 states and 717 transitions. [2022-04-15 15:14:11,094 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-15 15:14:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2022-04-15 15:14:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 15:14:11,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:11,095 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-15 15:14:11,112 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-15 15:14:11,299 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-15 15:14:11,299 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-15 15:14:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:11,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [77661421] [2022-04-15 15:14:11,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-15 15:14:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:11,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586739682] [2022-04-15 15:14:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:11,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:11,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118146677] [2022-04-15 15:14:11,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:14:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:11,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:11,317 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-15 15:14:11,317 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-15 15:14:11,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:14:11,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:11,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:14:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:11,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:11,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {52107#true} call ULTIMATE.init(); {52107#true} is VALID [2022-04-15 15:14:11,957 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-15 15:14:11,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52115#(<= ~counter~0 0)} {52107#true} #102#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {52115#(<= ~counter~0 0)} call #t~ret9 := main(); {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,958 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-15 15:14:11,958 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-15 15:14:11,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {52115#(<= ~counter~0 0)} ~cond := #in~cond; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {52115#(<= ~counter~0 0)} assume !(0 == ~cond); {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,960 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52115#(<= ~counter~0 0)} {52115#(<= ~counter~0 0)} #90#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,960 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-15 15:14:11,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {52115#(<= ~counter~0 0)} ~cond := #in~cond; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {52115#(<= ~counter~0 0)} assume !(0 == ~cond); {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {52115#(<= ~counter~0 0)} assume true; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52115#(<= ~counter~0 0)} {52115#(<= ~counter~0 0)} #92#return; {52115#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:11,961 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-15 15:14:11,963 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-15 15:14:11,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {52164#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,963 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-15 15:14:11,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {52164#(<= ~counter~0 1)} ~cond := #in~cond; {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {52164#(<= ~counter~0 1)} assume !(0 == ~cond); {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {52164#(<= ~counter~0 1)} assume true; {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,965 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52164#(<= ~counter~0 1)} {52164#(<= ~counter~0 1)} #94#return; {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {52164#(<= ~counter~0 1)} assume !!(0 != ~r~0); {52164#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:11,966 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-15 15:14:11,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {52189#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,966 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-15 15:14:11,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {52189#(<= ~counter~0 2)} ~cond := #in~cond; {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {52189#(<= ~counter~0 2)} assume !(0 == ~cond); {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {52189#(<= ~counter~0 2)} assume true; {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,968 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52189#(<= ~counter~0 2)} {52189#(<= ~counter~0 2)} #96#return; {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {52189#(<= ~counter~0 2)} assume !(~r~0 > 0); {52189#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:11,969 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-15 15:14:11,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {52214#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {52214#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:11,969 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-15 15:14:11,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {52214#(<= ~counter~0 3)} ~cond := #in~cond; {52214#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:11,970 INFO L290 TraceCheckUtils]: 37: Hoare triple {52214#(<= ~counter~0 3)} assume !(0 == ~cond); {52214#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:11,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {52214#(<= ~counter~0 3)} assume true; {52214#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:11,971 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52214#(<= ~counter~0 3)} {52214#(<= ~counter~0 3)} #98#return; {52214#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:11,971 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-15 15:14:11,972 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-15 15:14:11,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {52239#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,972 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-15 15:14:11,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {52239#(<= ~counter~0 4)} ~cond := #in~cond; {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {52239#(<= ~counter~0 4)} assume !(0 == ~cond); {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {52239#(<= ~counter~0 4)} assume true; {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,974 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52239#(<= ~counter~0 4)} {52239#(<= ~counter~0 4)} #98#return; {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {52239#(<= ~counter~0 4)} assume !(~r~0 < 0); {52239#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:11,975 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-15 15:14:11,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {52264#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,975 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-15 15:14:11,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {52264#(<= ~counter~0 5)} ~cond := #in~cond; {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {52264#(<= ~counter~0 5)} assume !(0 == ~cond); {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {52264#(<= ~counter~0 5)} assume true; {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,977 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52264#(<= ~counter~0 5)} {52264#(<= ~counter~0 5)} #94#return; {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {52264#(<= ~counter~0 5)} assume !!(0 != ~r~0); {52264#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:11,978 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-15 15:14:11,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {52289#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {52289#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:11,978 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-15 15:14:11,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {52289#(<= ~counter~0 6)} ~cond := #in~cond; {52289#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:11,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {52289#(<= ~counter~0 6)} assume !(0 == ~cond); {52289#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:11,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {52289#(<= ~counter~0 6)} assume true; {52289#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:11,980 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52289#(<= ~counter~0 6)} {52289#(<= ~counter~0 6)} #96#return; {52289#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:11,980 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-15 15:14:11,980 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-15 15:14:11,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {52314#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {52314#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:11,981 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-15 15:14:11,981 INFO L290 TraceCheckUtils]: 68: Hoare triple {52314#(<= ~counter~0 7)} ~cond := #in~cond; {52314#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:11,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {52314#(<= ~counter~0 7)} assume !(0 == ~cond); {52314#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:11,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {52314#(<= ~counter~0 7)} assume true; {52314#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:11,983 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52314#(<= ~counter~0 7)} {52314#(<= ~counter~0 7)} #96#return; {52314#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:11,983 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-15 15:14:11,983 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-15 15:14:11,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {52339#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {52339#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:11,984 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-15 15:14:11,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {52339#(<= ~counter~0 8)} ~cond := #in~cond; {52339#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:11,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {52339#(<= ~counter~0 8)} assume !(0 == ~cond); {52339#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:11,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {52339#(<= ~counter~0 8)} assume true; {52339#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:11,985 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52339#(<= ~counter~0 8)} {52339#(<= ~counter~0 8)} #96#return; {52339#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:11,986 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-15 15:14:11,986 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-15 15:14:11,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {52364#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {52364#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:11,987 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-15 15:14:11,987 INFO L290 TraceCheckUtils]: 84: Hoare triple {52364#(<= ~counter~0 9)} ~cond := #in~cond; {52364#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:11,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {52364#(<= ~counter~0 9)} assume !(0 == ~cond); {52364#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:11,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {52364#(<= ~counter~0 9)} assume true; {52364#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:11,988 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52364#(<= ~counter~0 9)} {52364#(<= ~counter~0 9)} #96#return; {52364#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:11,989 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-15 15:14:11,989 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-15 15:14:11,990 INFO L290 TraceCheckUtils]: 90: Hoare triple {52389#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {52389#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:11,990 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-15 15:14:11,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {52389#(<= ~counter~0 10)} ~cond := #in~cond; {52389#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:11,991 INFO L290 TraceCheckUtils]: 93: Hoare triple {52389#(<= ~counter~0 10)} assume !(0 == ~cond); {52389#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:11,991 INFO L290 TraceCheckUtils]: 94: Hoare triple {52389#(<= ~counter~0 10)} assume true; {52389#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:11,991 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {52389#(<= ~counter~0 10)} {52389#(<= ~counter~0 10)} #96#return; {52389#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:11,992 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-15 15:14:11,992 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-15 15:14:11,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {52414#(<= |main_#t~post7| 10)} assume !(#t~post7 < 50);havoc #t~post7; {52108#false} is VALID [2022-04-15 15:14:11,992 INFO L290 TraceCheckUtils]: 99: Hoare triple {52108#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52108#false} is VALID [2022-04-15 15:14:11,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {52108#false} assume !(#t~post8 < 50);havoc #t~post8; {52108#false} is VALID [2022-04-15 15:14:11,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {52108#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52108#false} is VALID [2022-04-15 15:14:11,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {52108#false} assume !(#t~post6 < 50);havoc #t~post6; {52108#false} is VALID [2022-04-15 15:14:11,993 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-15 15:14:11,993 INFO L290 TraceCheckUtils]: 104: Hoare triple {52108#false} ~cond := #in~cond; {52108#false} is VALID [2022-04-15 15:14:11,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {52108#false} assume 0 == ~cond; {52108#false} is VALID [2022-04-15 15:14:11,993 INFO L290 TraceCheckUtils]: 106: Hoare triple {52108#false} assume !false; {52108#false} is VALID [2022-04-15 15:14:11,993 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-15 15:14:11,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 106: Hoare triple {52108#false} assume !false; {52108#false} is VALID [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 105: Hoare triple {52108#false} assume 0 == ~cond; {52108#false} is VALID [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 104: Hoare triple {52108#false} ~cond := #in~cond; {52108#false} is VALID [2022-04-15 15:14:12,583 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-15 15:14:12,583 INFO L290 TraceCheckUtils]: 102: Hoare triple {52108#false} assume !(#t~post6 < 50);havoc #t~post6; {52108#false} is VALID [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 101: Hoare triple {52108#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52108#false} is VALID [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 100: Hoare triple {52108#false} assume !(#t~post8 < 50);havoc #t~post8; {52108#false} is VALID [2022-04-15 15:14:12,583 INFO L290 TraceCheckUtils]: 99: Hoare triple {52108#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52108#false} is VALID [2022-04-15 15:14:12,584 INFO L290 TraceCheckUtils]: 98: Hoare triple {52466#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {52108#false} is VALID [2022-04-15 15:14:12,584 INFO L290 TraceCheckUtils]: 97: Hoare triple {52470#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52466#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:14:12,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {52470#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52470#(< ~counter~0 50)} is VALID [2022-04-15 15:14:12,585 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {52107#true} {52470#(< ~counter~0 50)} #96#return; {52470#(< ~counter~0 50)} is VALID [2022-04-15 15:14:12,585 INFO L290 TraceCheckUtils]: 94: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,585 INFO L290 TraceCheckUtils]: 92: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,585 INFO L272 TraceCheckUtils]: 91: Hoare triple {52470#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:12,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {52470#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {52470#(< ~counter~0 50)} is VALID [2022-04-15 15:14:12,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {52495#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52470#(< ~counter~0 50)} is VALID [2022-04-15 15:14:12,587 INFO L290 TraceCheckUtils]: 88: Hoare triple {52495#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52495#(< ~counter~0 49)} is VALID [2022-04-15 15:14:12,587 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52107#true} {52495#(< ~counter~0 49)} #96#return; {52495#(< ~counter~0 49)} is VALID [2022-04-15 15:14:12,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,588 INFO L272 TraceCheckUtils]: 83: Hoare triple {52495#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:12,588 INFO L290 TraceCheckUtils]: 82: Hoare triple {52495#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {52495#(< ~counter~0 49)} is VALID [2022-04-15 15:14:12,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {52520#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52495#(< ~counter~0 49)} is VALID [2022-04-15 15:14:12,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {52520#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52520#(< ~counter~0 48)} is VALID [2022-04-15 15:14:12,589 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52107#true} {52520#(< ~counter~0 48)} #96#return; {52520#(< ~counter~0 48)} is VALID [2022-04-15 15:14:12,589 INFO L290 TraceCheckUtils]: 78: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,590 INFO L272 TraceCheckUtils]: 75: Hoare triple {52520#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:12,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {52520#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {52520#(< ~counter~0 48)} is VALID [2022-04-15 15:14:12,591 INFO L290 TraceCheckUtils]: 73: Hoare triple {52545#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52520#(< ~counter~0 48)} is VALID [2022-04-15 15:14:12,591 INFO L290 TraceCheckUtils]: 72: Hoare triple {52545#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52545#(< ~counter~0 47)} is VALID [2022-04-15 15:14:12,591 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52107#true} {52545#(< ~counter~0 47)} #96#return; {52545#(< ~counter~0 47)} is VALID [2022-04-15 15:14:12,591 INFO L290 TraceCheckUtils]: 70: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,591 INFO L290 TraceCheckUtils]: 69: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,592 INFO L272 TraceCheckUtils]: 67: Hoare triple {52545#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:12,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {52545#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {52545#(< ~counter~0 47)} is VALID [2022-04-15 15:14:12,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {52570#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52545#(< ~counter~0 47)} is VALID [2022-04-15 15:14:12,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {52570#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52570#(< ~counter~0 46)} is VALID [2022-04-15 15:14:12,593 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52107#true} {52570#(< ~counter~0 46)} #96#return; {52570#(< ~counter~0 46)} is VALID [2022-04-15 15:14:12,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,594 INFO L272 TraceCheckUtils]: 59: Hoare triple {52570#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:12,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {52570#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {52570#(< ~counter~0 46)} is VALID [2022-04-15 15:14:12,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {52595#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52570#(< ~counter~0 46)} is VALID [2022-04-15 15:14:12,595 INFO L290 TraceCheckUtils]: 56: Hoare triple {52595#(< ~counter~0 45)} assume !!(0 != ~r~0); {52595#(< ~counter~0 45)} is VALID [2022-04-15 15:14:12,595 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52107#true} {52595#(< ~counter~0 45)} #94#return; {52595#(< ~counter~0 45)} is VALID [2022-04-15 15:14:12,595 INFO L290 TraceCheckUtils]: 54: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,596 INFO L272 TraceCheckUtils]: 51: Hoare triple {52595#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:12,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {52595#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {52595#(< ~counter~0 45)} is VALID [2022-04-15 15:14:12,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {52620#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52595#(< ~counter~0 45)} is VALID [2022-04-15 15:14:12,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {52620#(< ~counter~0 44)} assume !(~r~0 < 0); {52620#(< ~counter~0 44)} is VALID [2022-04-15 15:14:12,597 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52107#true} {52620#(< ~counter~0 44)} #98#return; {52620#(< ~counter~0 44)} is VALID [2022-04-15 15:14:12,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,597 INFO L272 TraceCheckUtils]: 43: Hoare triple {52620#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:12,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {52620#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {52620#(< ~counter~0 44)} is VALID [2022-04-15 15:14:12,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {52645#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52620#(< ~counter~0 44)} is VALID [2022-04-15 15:14:12,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {52645#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52645#(< ~counter~0 43)} is VALID [2022-04-15 15:14:12,599 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52107#true} {52645#(< ~counter~0 43)} #98#return; {52645#(< ~counter~0 43)} is VALID [2022-04-15 15:14:12,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,599 INFO L272 TraceCheckUtils]: 35: Hoare triple {52645#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:12,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {52645#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {52645#(< ~counter~0 43)} is VALID [2022-04-15 15:14:12,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {52670#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52645#(< ~counter~0 43)} is VALID [2022-04-15 15:14:12,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {52670#(< ~counter~0 42)} assume !(~r~0 > 0); {52670#(< ~counter~0 42)} is VALID [2022-04-15 15:14:12,601 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52107#true} {52670#(< ~counter~0 42)} #96#return; {52670#(< ~counter~0 42)} is VALID [2022-04-15 15:14:12,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,601 INFO L272 TraceCheckUtils]: 27: Hoare triple {52670#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:12,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {52670#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {52670#(< ~counter~0 42)} is VALID [2022-04-15 15:14:12,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {52695#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52670#(< ~counter~0 42)} is VALID [2022-04-15 15:14:12,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {52695#(< ~counter~0 41)} assume !!(0 != ~r~0); {52695#(< ~counter~0 41)} is VALID [2022-04-15 15:14:12,603 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52107#true} {52695#(< ~counter~0 41)} #94#return; {52695#(< ~counter~0 41)} is VALID [2022-04-15 15:14:12,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,603 INFO L272 TraceCheckUtils]: 19: Hoare triple {52695#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:12,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {52695#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {52695#(< ~counter~0 41)} is VALID [2022-04-15 15:14:12,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {52720#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52695#(< ~counter~0 41)} is VALID [2022-04-15 15:14:12,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {52720#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,605 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52107#true} {52720#(< ~counter~0 40)} #92#return; {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {52720#(< ~counter~0 40)} call assume_abort_if_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-15 15:14:12,606 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52107#true} {52720#(< ~counter~0 40)} #90#return; {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {52107#true} assume true; {52107#true} is VALID [2022-04-15 15:14:12,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {52107#true} assume !(0 == ~cond); {52107#true} is VALID [2022-04-15 15:14:12,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {52107#true} ~cond := #in~cond; {52107#true} is VALID [2022-04-15 15:14:12,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {52720#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {52107#true} is VALID [2022-04-15 15:14:12,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {52720#(< ~counter~0 40)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 40)} is VALID [2022-04-15 15:14:12,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {52720#(< ~counter~0 40)} call #t~ret9 := main(); {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52720#(< ~counter~0 40)} {52107#true} #102#return; {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {52720#(< ~counter~0 40)} assume true; {52720#(< ~counter~0 40)} is VALID [2022-04-15 15:14:12,608 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 40)} is VALID [2022-04-15 15:14:12,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {52107#true} call ULTIMATE.init(); {52107#true} is VALID [2022-04-15 15:14:12,608 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-15 15:14:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586739682] [2022-04-15 15:14:12,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118146677] [2022-04-15 15:14:12,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118146677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:12,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:14:12,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:12,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [77661421] [2022-04-15 15:14:12,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [77661421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:12,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:12,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:14:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890816361] [2022-04-15 15:14:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:12,609 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-15 15:14:12,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:12,610 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-15 15:14:12,689 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-15 15:14:12,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:14:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:14:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:14:12,690 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-15 15:14:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:14,478 INFO L93 Difference]: Finished difference Result 735 states and 1041 transitions. [2022-04-15 15:14:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:14:14,478 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-15 15:14:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:14,479 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-15 15:14:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:14:14,480 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-15 15:14:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:14:14,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-15 15:14:14,667 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-15 15:14:14,682 INFO L225 Difference]: With dead ends: 735 [2022-04-15 15:14:14,682 INFO L226 Difference]: Without dead ends: 538 [2022-04-15 15:14:14,683 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-15 15:14:14,683 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-15 15:14:14,683 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-15 15:14:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-15 15:14:15,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-04-15 15:14:15,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:15,824 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-15 15:14:15,824 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-15 15:14:15,825 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-15 15:14:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:15,842 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-15 15:14:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-15 15:14:15,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:15,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:15,843 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-15 15:14:15,844 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-15 15:14:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:15,861 INFO L93 Difference]: Finished difference Result 538 states and 733 transitions. [2022-04-15 15:14:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-15 15:14:15,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:15,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:15,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:15,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:15,862 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-15 15:14:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 733 transitions. [2022-04-15 15:14:15,884 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 733 transitions. Word has length 107 [2022-04-15 15:14:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:15,884 INFO L478 AbstractCegarLoop]: Abstraction has 538 states and 733 transitions. [2022-04-15 15:14:15,884 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-15 15:14:15,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 538 states and 733 transitions. [2022-04-15 15:14:17,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 733 edges. 733 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 733 transitions. [2022-04-15 15:14:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 15:14:17,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:17,441 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-15 15:14:17,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:17,641 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-15 15:14:17,641 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-15 15:14:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:17,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703274681] [2022-04-15 15:14:17,642 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-15 15:14:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367746617] [2022-04-15 15:14:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:17,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:17,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253908416] [2022-04-15 15:14:17,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:14:17,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:17,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:17,654 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-15 15:14:17,655 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-15 15:14:17,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:14:17,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:17,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:14:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:17,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:18,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {56414#true} call ULTIMATE.init(); {56414#true} is VALID [2022-04-15 15:14:18,394 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-15 15:14:18,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56422#(<= ~counter~0 0)} {56414#true} #102#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {56422#(<= ~counter~0 0)} call #t~ret9 := main(); {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,395 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-15 15:14:18,396 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-15 15:14:18,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {56422#(<= ~counter~0 0)} ~cond := #in~cond; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {56422#(<= ~counter~0 0)} assume !(0 == ~cond); {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56422#(<= ~counter~0 0)} {56422#(<= ~counter~0 0)} #90#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,397 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-15 15:14:18,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {56422#(<= ~counter~0 0)} ~cond := #in~cond; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {56422#(<= ~counter~0 0)} assume !(0 == ~cond); {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {56422#(<= ~counter~0 0)} assume true; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56422#(<= ~counter~0 0)} {56422#(<= ~counter~0 0)} #92#return; {56422#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:18,399 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-15 15:14:18,400 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-15 15:14:18,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {56471#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,401 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-15 15:14:18,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {56471#(<= ~counter~0 1)} ~cond := #in~cond; {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {56471#(<= ~counter~0 1)} assume !(0 == ~cond); {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {56471#(<= ~counter~0 1)} assume true; {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,402 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56471#(<= ~counter~0 1)} {56471#(<= ~counter~0 1)} #94#return; {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {56471#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56471#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:18,403 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-15 15:14:18,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {56496#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,404 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-15 15:14:18,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {56496#(<= ~counter~0 2)} ~cond := #in~cond; {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {56496#(<= ~counter~0 2)} assume !(0 == ~cond); {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {56496#(<= ~counter~0 2)} assume true; {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,405 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56496#(<= ~counter~0 2)} {56496#(<= ~counter~0 2)} #96#return; {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {56496#(<= ~counter~0 2)} assume !(~r~0 > 0); {56496#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:18,406 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-15 15:14:18,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {56521#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {56521#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:18,407 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-15 15:14:18,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {56521#(<= ~counter~0 3)} ~cond := #in~cond; {56521#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:18,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {56521#(<= ~counter~0 3)} assume !(0 == ~cond); {56521#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:18,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {56521#(<= ~counter~0 3)} assume true; {56521#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:18,408 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56521#(<= ~counter~0 3)} {56521#(<= ~counter~0 3)} #98#return; {56521#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:18,408 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-15 15:14:18,409 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-15 15:14:18,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {56546#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,410 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-15 15:14:18,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {56546#(<= ~counter~0 4)} ~cond := #in~cond; {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {56546#(<= ~counter~0 4)} assume !(0 == ~cond); {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {56546#(<= ~counter~0 4)} assume true; {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,411 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56546#(<= ~counter~0 4)} {56546#(<= ~counter~0 4)} #98#return; {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {56546#(<= ~counter~0 4)} assume !(~r~0 < 0); {56546#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:18,412 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-15 15:14:18,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {56571#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,413 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-15 15:14:18,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {56571#(<= ~counter~0 5)} ~cond := #in~cond; {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {56571#(<= ~counter~0 5)} assume !(0 == ~cond); {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {56571#(<= ~counter~0 5)} assume true; {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,414 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56571#(<= ~counter~0 5)} {56571#(<= ~counter~0 5)} #94#return; {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {56571#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56571#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:18,415 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-15 15:14:18,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {56596#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {56596#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:18,416 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-15 15:14:18,416 INFO L290 TraceCheckUtils]: 60: Hoare triple {56596#(<= ~counter~0 6)} ~cond := #in~cond; {56596#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:18,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {56596#(<= ~counter~0 6)} assume !(0 == ~cond); {56596#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:18,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {56596#(<= ~counter~0 6)} assume true; {56596#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:18,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56596#(<= ~counter~0 6)} {56596#(<= ~counter~0 6)} #96#return; {56596#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:18,417 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-15 15:14:18,418 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-15 15:14:18,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {56621#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {56621#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:18,418 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-15 15:14:18,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {56621#(<= ~counter~0 7)} ~cond := #in~cond; {56621#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:18,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {56621#(<= ~counter~0 7)} assume !(0 == ~cond); {56621#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:18,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {56621#(<= ~counter~0 7)} assume true; {56621#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:18,420 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56621#(<= ~counter~0 7)} {56621#(<= ~counter~0 7)} #96#return; {56621#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:18,420 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-15 15:14:18,421 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-15 15:14:18,421 INFO L290 TraceCheckUtils]: 74: Hoare triple {56646#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {56646#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:18,421 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-15 15:14:18,422 INFO L290 TraceCheckUtils]: 76: Hoare triple {56646#(<= ~counter~0 8)} ~cond := #in~cond; {56646#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:18,422 INFO L290 TraceCheckUtils]: 77: Hoare triple {56646#(<= ~counter~0 8)} assume !(0 == ~cond); {56646#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:18,422 INFO L290 TraceCheckUtils]: 78: Hoare triple {56646#(<= ~counter~0 8)} assume true; {56646#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:18,423 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56646#(<= ~counter~0 8)} {56646#(<= ~counter~0 8)} #96#return; {56646#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:18,423 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-15 15:14:18,424 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-15 15:14:18,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {56671#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,424 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-15 15:14:18,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {56671#(<= ~counter~0 9)} ~cond := #in~cond; {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,425 INFO L290 TraceCheckUtils]: 85: Hoare triple {56671#(<= ~counter~0 9)} assume !(0 == ~cond); {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,425 INFO L290 TraceCheckUtils]: 86: Hoare triple {56671#(<= ~counter~0 9)} assume true; {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,426 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56671#(<= ~counter~0 9)} {56671#(<= ~counter~0 9)} #96#return; {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {56671#(<= ~counter~0 9)} assume !(~r~0 > 0); {56671#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:18,426 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-15 15:14:18,427 INFO L290 TraceCheckUtils]: 90: Hoare triple {56696#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {56696#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:18,427 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-15 15:14:18,427 INFO L290 TraceCheckUtils]: 92: Hoare triple {56696#(<= ~counter~0 10)} ~cond := #in~cond; {56696#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:18,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {56696#(<= ~counter~0 10)} assume !(0 == ~cond); {56696#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:18,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {56696#(<= ~counter~0 10)} assume true; {56696#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:18,428 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56696#(<= ~counter~0 10)} {56696#(<= ~counter~0 10)} #98#return; {56696#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:18,429 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-15 15:14:18,429 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-15 15:14:18,430 INFO L290 TraceCheckUtils]: 98: Hoare triple {56721#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,430 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-15 15:14:18,430 INFO L290 TraceCheckUtils]: 100: Hoare triple {56721#(<= ~counter~0 11)} ~cond := #in~cond; {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,431 INFO L290 TraceCheckUtils]: 101: Hoare triple {56721#(<= ~counter~0 11)} assume !(0 == ~cond); {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,431 INFO L290 TraceCheckUtils]: 102: Hoare triple {56721#(<= ~counter~0 11)} assume true; {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,431 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56721#(<= ~counter~0 11)} {56721#(<= ~counter~0 11)} #98#return; {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,432 INFO L290 TraceCheckUtils]: 104: Hoare triple {56721#(<= ~counter~0 11)} assume !(~r~0 < 0); {56721#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:18,432 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-15 15:14:18,432 INFO L290 TraceCheckUtils]: 106: Hoare triple {56746#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {56415#false} is VALID [2022-04-15 15:14:18,432 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-15 15:14:18,432 INFO L290 TraceCheckUtils]: 108: Hoare triple {56415#false} ~cond := #in~cond; {56415#false} is VALID [2022-04-15 15:14:18,433 INFO L290 TraceCheckUtils]: 109: Hoare triple {56415#false} assume 0 == ~cond; {56415#false} is VALID [2022-04-15 15:14:18,433 INFO L290 TraceCheckUtils]: 110: Hoare triple {56415#false} assume !false; {56415#false} is VALID [2022-04-15 15:14:18,433 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-15 15:14:18,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:19,099 INFO L290 TraceCheckUtils]: 110: Hoare triple {56415#false} assume !false; {56415#false} is VALID [2022-04-15 15:14:19,099 INFO L290 TraceCheckUtils]: 109: Hoare triple {56415#false} assume 0 == ~cond; {56415#false} is VALID [2022-04-15 15:14:19,099 INFO L290 TraceCheckUtils]: 108: Hoare triple {56415#false} ~cond := #in~cond; {56415#false} is VALID [2022-04-15 15:14:19,099 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-15 15:14:19,099 INFO L290 TraceCheckUtils]: 106: Hoare triple {56774#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {56415#false} is VALID [2022-04-15 15:14:19,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {56778#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56774#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:14:19,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {56778#(< ~counter~0 50)} assume !(~r~0 < 0); {56778#(< ~counter~0 50)} is VALID [2022-04-15 15:14:19,101 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {56414#true} {56778#(< ~counter~0 50)} #98#return; {56778#(< ~counter~0 50)} is VALID [2022-04-15 15:14:19,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,101 INFO L290 TraceCheckUtils]: 100: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,101 INFO L272 TraceCheckUtils]: 99: Hoare triple {56778#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:19,101 INFO L290 TraceCheckUtils]: 98: Hoare triple {56778#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {56778#(< ~counter~0 50)} is VALID [2022-04-15 15:14:19,102 INFO L290 TraceCheckUtils]: 97: Hoare triple {56803#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56778#(< ~counter~0 50)} is VALID [2022-04-15 15:14:19,103 INFO L290 TraceCheckUtils]: 96: Hoare triple {56803#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56803#(< ~counter~0 49)} is VALID [2022-04-15 15:14:19,103 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56414#true} {56803#(< ~counter~0 49)} #98#return; {56803#(< ~counter~0 49)} is VALID [2022-04-15 15:14:19,103 INFO L290 TraceCheckUtils]: 94: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,103 INFO L290 TraceCheckUtils]: 93: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,103 INFO L290 TraceCheckUtils]: 92: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,103 INFO L272 TraceCheckUtils]: 91: Hoare triple {56803#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:19,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {56803#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {56803#(< ~counter~0 49)} is VALID [2022-04-15 15:14:19,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {56828#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56803#(< ~counter~0 49)} is VALID [2022-04-15 15:14:19,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {56828#(< ~counter~0 48)} assume !(~r~0 > 0); {56828#(< ~counter~0 48)} is VALID [2022-04-15 15:14:19,105 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56414#true} {56828#(< ~counter~0 48)} #96#return; {56828#(< ~counter~0 48)} is VALID [2022-04-15 15:14:19,105 INFO L290 TraceCheckUtils]: 86: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,105 INFO L290 TraceCheckUtils]: 85: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,105 INFO L272 TraceCheckUtils]: 83: Hoare triple {56828#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:19,106 INFO L290 TraceCheckUtils]: 82: Hoare triple {56828#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {56828#(< ~counter~0 48)} is VALID [2022-04-15 15:14:19,106 INFO L290 TraceCheckUtils]: 81: Hoare triple {56853#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56828#(< ~counter~0 48)} is VALID [2022-04-15 15:14:19,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {56853#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56853#(< ~counter~0 47)} is VALID [2022-04-15 15:14:19,107 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56414#true} {56853#(< ~counter~0 47)} #96#return; {56853#(< ~counter~0 47)} is VALID [2022-04-15 15:14:19,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,107 INFO L290 TraceCheckUtils]: 77: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,107 INFO L272 TraceCheckUtils]: 75: Hoare triple {56853#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:19,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {56853#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {56853#(< ~counter~0 47)} is VALID [2022-04-15 15:14:19,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {56878#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56853#(< ~counter~0 47)} is VALID [2022-04-15 15:14:19,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {56878#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56878#(< ~counter~0 46)} is VALID [2022-04-15 15:14:19,109 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56414#true} {56878#(< ~counter~0 46)} #96#return; {56878#(< ~counter~0 46)} is VALID [2022-04-15 15:14:19,109 INFO L290 TraceCheckUtils]: 70: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,109 INFO L272 TraceCheckUtils]: 67: Hoare triple {56878#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:19,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {56878#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {56878#(< ~counter~0 46)} is VALID [2022-04-15 15:14:19,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {56903#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56878#(< ~counter~0 46)} is VALID [2022-04-15 15:14:19,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {56903#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56903#(< ~counter~0 45)} is VALID [2022-04-15 15:14:19,111 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56414#true} {56903#(< ~counter~0 45)} #96#return; {56903#(< ~counter~0 45)} is VALID [2022-04-15 15:14:19,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,111 INFO L272 TraceCheckUtils]: 59: Hoare triple {56903#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:19,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {56903#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {56903#(< ~counter~0 45)} is VALID [2022-04-15 15:14:19,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {56928#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56903#(< ~counter~0 45)} is VALID [2022-04-15 15:14:19,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {56928#(< ~counter~0 44)} assume !!(0 != ~r~0); {56928#(< ~counter~0 44)} is VALID [2022-04-15 15:14:19,113 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56414#true} {56928#(< ~counter~0 44)} #94#return; {56928#(< ~counter~0 44)} is VALID [2022-04-15 15:14:19,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,113 INFO L272 TraceCheckUtils]: 51: Hoare triple {56928#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:19,113 INFO L290 TraceCheckUtils]: 50: Hoare triple {56928#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {56928#(< ~counter~0 44)} is VALID [2022-04-15 15:14:19,114 INFO L290 TraceCheckUtils]: 49: Hoare triple {56953#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56928#(< ~counter~0 44)} is VALID [2022-04-15 15:14:19,114 INFO L290 TraceCheckUtils]: 48: Hoare triple {56953#(< ~counter~0 43)} assume !(~r~0 < 0); {56953#(< ~counter~0 43)} is VALID [2022-04-15 15:14:19,115 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56414#true} {56953#(< ~counter~0 43)} #98#return; {56953#(< ~counter~0 43)} is VALID [2022-04-15 15:14:19,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,115 INFO L272 TraceCheckUtils]: 43: Hoare triple {56953#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:19,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {56953#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {56953#(< ~counter~0 43)} is VALID [2022-04-15 15:14:19,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {56978#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56953#(< ~counter~0 43)} is VALID [2022-04-15 15:14:19,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {56978#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56978#(< ~counter~0 42)} is VALID [2022-04-15 15:14:19,117 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56414#true} {56978#(< ~counter~0 42)} #98#return; {56978#(< ~counter~0 42)} is VALID [2022-04-15 15:14:19,117 INFO L290 TraceCheckUtils]: 38: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,117 INFO L272 TraceCheckUtils]: 35: Hoare triple {56978#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:19,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {56978#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {56978#(< ~counter~0 42)} is VALID [2022-04-15 15:14:19,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {57003#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56978#(< ~counter~0 42)} is VALID [2022-04-15 15:14:19,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {57003#(< ~counter~0 41)} assume !(~r~0 > 0); {57003#(< ~counter~0 41)} is VALID [2022-04-15 15:14:19,119 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56414#true} {57003#(< ~counter~0 41)} #96#return; {57003#(< ~counter~0 41)} is VALID [2022-04-15 15:14:19,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,119 INFO L272 TraceCheckUtils]: 27: Hoare triple {57003#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:19,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {57003#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {57003#(< ~counter~0 41)} is VALID [2022-04-15 15:14:19,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {57028#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57003#(< ~counter~0 41)} is VALID [2022-04-15 15:14:19,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {57028#(< ~counter~0 40)} assume !!(0 != ~r~0); {57028#(< ~counter~0 40)} is VALID [2022-04-15 15:14:19,121 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56414#true} {57028#(< ~counter~0 40)} #94#return; {57028#(< ~counter~0 40)} is VALID [2022-04-15 15:14:19,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {57028#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:14:19,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {57028#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {57028#(< ~counter~0 40)} is VALID [2022-04-15 15:14:19,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {57053#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57028#(< ~counter~0 40)} is VALID [2022-04-15 15:14:19,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {57053#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,123 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56414#true} {57053#(< ~counter~0 39)} #92#return; {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,123 INFO L272 TraceCheckUtils]: 11: Hoare triple {57053#(< ~counter~0 39)} call assume_abort_if_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-15 15:14:19,124 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56414#true} {57053#(< ~counter~0 39)} #90#return; {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {56414#true} assume true; {56414#true} is VALID [2022-04-15 15:14:19,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {56414#true} assume !(0 == ~cond); {56414#true} is VALID [2022-04-15 15:14:19,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {56414#true} ~cond := #in~cond; {56414#true} is VALID [2022-04-15 15:14:19,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {57053#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56414#true} is VALID [2022-04-15 15:14:19,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {57053#(< ~counter~0 39)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 39)} is VALID [2022-04-15 15:14:19,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {57053#(< ~counter~0 39)} call #t~ret9 := main(); {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57053#(< ~counter~0 39)} {56414#true} #102#return; {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {57053#(< ~counter~0 39)} assume true; {57053#(< ~counter~0 39)} is VALID [2022-04-15 15:14:19,128 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 39)} is VALID [2022-04-15 15:14:19,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {56414#true} call ULTIMATE.init(); {56414#true} is VALID [2022-04-15 15:14:19,128 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-15 15:14:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367746617] [2022-04-15 15:14:19,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253908416] [2022-04-15 15:14:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253908416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:19,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:14:19,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703274681] [2022-04-15 15:14:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703274681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:19,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:14:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057642207] [2022-04-15 15:14:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:19,130 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-15 15:14:19,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:19,130 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-15 15:14:19,209 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-15 15:14:19,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:14:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:14:19,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:14:19,210 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-15 15:14:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:21,188 INFO L93 Difference]: Finished difference Result 593 states and 810 transitions. [2022-04-15 15:14:21,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:14:21,189 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-15 15:14:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:21,189 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-15 15:14:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:14:21,190 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-15 15:14:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:14:21,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-15 15:14:21,370 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-15 15:14:21,388 INFO L225 Difference]: With dead ends: 593 [2022-04-15 15:14:21,388 INFO L226 Difference]: Without dead ends: 582 [2022-04-15 15:14:21,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=525, Invalid=735, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:14:21,389 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 129 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:21,389 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.2s Time] [2022-04-15 15:14:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-04-15 15:14:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 560. [2022-04-15 15:14:22,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:22,526 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-15 15:14:22,527 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-15 15:14:22,527 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-15 15:14:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:22,546 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-15 15:14:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-15 15:14:22,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:22,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:22,548 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-15 15:14:22,549 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-15 15:14:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:22,568 INFO L93 Difference]: Finished difference Result 582 states and 794 transitions. [2022-04-15 15:14:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2022-04-15 15:14:22,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:22,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:22,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:22,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:22,570 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-15 15:14:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-15 15:14:22,586 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 111 [2022-04-15 15:14:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:22,586 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-15 15:14:22,586 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-15 15:14:22,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-15 15:14:24,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 768 edges. 768 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-15 15:14:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:14:24,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:24,696 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-15 15:14:24,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:24,896 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-15 15:14:24,896 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-15 15:14:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:24,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148377338] [2022-04-15 15:14:24,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-15 15:14:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:24,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968128376] [2022-04-15 15:14:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:24,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:24,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:24,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181973610] [2022-04-15 15:14:24,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:24,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:24,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:24,910 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-15 15:14:24,910 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-15 15:14:24,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:24,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:24,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:14:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:24,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:25,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {60593#true} call ULTIMATE.init(); {60593#true} is VALID [2022-04-15 15:14:25,901 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-15 15:14:25,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60593#true} {60593#true} #102#return; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {60593#true} call #t~ret9 := main(); {60593#true} is VALID [2022-04-15 15:14:25,902 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-15 15:14:25,902 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-15 15:14:25,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60593#true} {60593#true} #90#return; {60593#true} is VALID [2022-04-15 15:14:25,902 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-15 15:14:25,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60593#true} {60593#true} #92#return; {60593#true} is VALID [2022-04-15 15:14:25,903 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-15 15:14:25,903 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-15 15:14:25,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,903 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-15 15:14:25,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,904 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #94#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,905 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-15 15:14:25,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,905 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-15 15:14:25,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,905 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #96#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {60646#(<= 1 main_~v~0)} assume !(~r~0 > 0); {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,906 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-15 15:14:25,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {60646#(<= 1 main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,906 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-15 15:14:25,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,907 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60593#true} {60646#(<= 1 main_~v~0)} #98#return; {60646#(<= 1 main_~v~0)} is VALID [2022-04-15 15:14:25,909 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-15 15:14:25,909 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-15 15:14:25,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 50);havoc #t~post8; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:14:25,909 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-15 15:14:25,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,910 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-15 15:14:25,910 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-15 15:14:25,911 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-15 15:14:25,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 50);havoc #t~post6; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:14:25,911 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-15 15:14:25,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,912 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-15 15:14:25,912 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-15 15:14:25,913 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-15 15:14:25,913 INFO L290 TraceCheckUtils]: 58: Hoare triple {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 50);havoc #t~post7; {60719#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:14:25,913 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-15 15:14:25,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,913 INFO L290 TraceCheckUtils]: 61: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,914 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-15 15:14:25,915 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-15 15:14:25,915 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-15 15:14:25,915 INFO L290 TraceCheckUtils]: 66: Hoare triple {60792#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60792#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:14:25,915 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-15 15:14:25,915 INFO L290 TraceCheckUtils]: 68: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,916 INFO L290 TraceCheckUtils]: 69: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,916 INFO L290 TraceCheckUtils]: 70: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,916 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-15 15:14:25,917 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-15 15:14:25,917 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-15 15:14:25,917 INFO L290 TraceCheckUtils]: 74: Hoare triple {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {60817#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:14:25,917 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-15 15:14:25,917 INFO L290 TraceCheckUtils]: 76: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,917 INFO L290 TraceCheckUtils]: 77: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,917 INFO L290 TraceCheckUtils]: 78: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,918 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-15 15:14:25,918 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-15 15:14:25,919 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-15 15:14:25,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:14:25,919 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-15 15:14:25,919 INFO L290 TraceCheckUtils]: 84: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,920 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-15 15:14:25,920 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-15 15:14:25,921 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-15 15:14:25,921 INFO L290 TraceCheckUtils]: 90: Hoare triple {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {60842#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:14:25,921 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-15 15:14:25,921 INFO L290 TraceCheckUtils]: 92: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,921 INFO L290 TraceCheckUtils]: 93: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,921 INFO L290 TraceCheckUtils]: 94: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,922 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-15 15:14:25,923 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-15 15:14:25,923 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-15 15:14:25,924 INFO L290 TraceCheckUtils]: 98: Hoare triple {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {60891#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:14:25,924 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-15 15:14:25,924 INFO L290 TraceCheckUtils]: 100: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:25,924 INFO L290 TraceCheckUtils]: 101: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:25,924 INFO L290 TraceCheckUtils]: 102: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:25,924 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-15 15:14:25,925 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-15 15:14:25,925 INFO L290 TraceCheckUtils]: 105: Hoare triple {60594#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60594#false} is VALID [2022-04-15 15:14:25,925 INFO L290 TraceCheckUtils]: 106: Hoare triple {60594#false} assume !(#t~post8 < 50);havoc #t~post8; {60594#false} is VALID [2022-04-15 15:14:25,925 INFO L290 TraceCheckUtils]: 107: Hoare triple {60594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60594#false} is VALID [2022-04-15 15:14:25,925 INFO L290 TraceCheckUtils]: 108: Hoare triple {60594#false} assume !(#t~post6 < 50);havoc #t~post6; {60594#false} is VALID [2022-04-15 15:14:25,925 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-15 15:14:25,925 INFO L290 TraceCheckUtils]: 110: Hoare triple {60594#false} ~cond := #in~cond; {60594#false} is VALID [2022-04-15 15:14:25,926 INFO L290 TraceCheckUtils]: 111: Hoare triple {60594#false} assume 0 == ~cond; {60594#false} is VALID [2022-04-15 15:14:25,926 INFO L290 TraceCheckUtils]: 112: Hoare triple {60594#false} assume !false; {60594#false} is VALID [2022-04-15 15:14:25,926 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-15 15:14:25,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 112: Hoare triple {60594#false} assume !false; {60594#false} is VALID [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 111: Hoare triple {60594#false} assume 0 == ~cond; {60594#false} is VALID [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {60594#false} ~cond := #in~cond; {60594#false} is VALID [2022-04-15 15:14:26,397 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-15 15:14:26,397 INFO L290 TraceCheckUtils]: 108: Hoare triple {60594#false} assume !(#t~post6 < 50);havoc #t~post6; {60594#false} is VALID [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 107: Hoare triple {60594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60594#false} is VALID [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 106: Hoare triple {60594#false} assume !(#t~post8 < 50);havoc #t~post8; {60594#false} is VALID [2022-04-15 15:14:26,397 INFO L290 TraceCheckUtils]: 105: Hoare triple {60594#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60594#false} is VALID [2022-04-15 15:14:26,398 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-15 15:14:26,399 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-15 15:14:26,399 INFO L290 TraceCheckUtils]: 102: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,399 INFO L290 TraceCheckUtils]: 101: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,399 INFO L290 TraceCheckUtils]: 100: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,399 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-15 15:14:26,399 INFO L290 TraceCheckUtils]: 98: Hoare triple {60964#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {60964#(not (< main_~r~0 0))} is VALID [2022-04-15 15:14:26,400 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-15 15:14:26,400 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-15 15:14:26,401 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-15 15:14:26,401 INFO L290 TraceCheckUtils]: 94: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,401 INFO L290 TraceCheckUtils]: 93: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,401 INFO L290 TraceCheckUtils]: 92: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,401 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-15 15:14:26,401 INFO L290 TraceCheckUtils]: 90: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:14:26,401 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-15 15:14:26,402 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-15 15:14:26,402 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-15 15:14:26,402 INFO L290 TraceCheckUtils]: 86: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,402 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-15 15:14:26,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {60989#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {60989#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:14:26,403 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-15 15:14:26,404 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-15 15:14:26,404 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-15 15:14:26,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,404 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-15 15:14:26,405 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 < 50);havoc #t~post7; {61038#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:14:26,405 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-15 15:14:26,406 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-15 15:14:26,407 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-15 15:14:26,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,407 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-15 15:14:26,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {61063#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {61063#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:14:26,408 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-15 15:14:26,408 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-15 15:14:26,409 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-15 15:14:26,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,409 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-15 15:14:26,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:14:26,409 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-15 15:14:26,410 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-15 15:14:26,410 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-15 15:14:26,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,410 INFO L290 TraceCheckUtils]: 53: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,410 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-15 15:14:26,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:14:26,411 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-15 15:14:26,411 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-15 15:14:26,412 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-15 15:14:26,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,412 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-15 15:14:26,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {61088#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:14:26,413 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-15 15:14:26,413 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-15 15:14:26,414 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-15 15:14:26,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,414 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-15 15:14:26,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:14:26,415 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-15 15:14:26,415 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-15 15:14:26,415 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-15 15:14:26,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,416 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-15 15:14:26,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:14:26,416 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-15 15:14:26,417 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-15 15:14:26,417 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-15 15:14:26,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,417 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-15 15:14:26,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {61161#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 50);havoc #t~post6; {61161#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:14:26,418 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-15 15:14:26,418 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-15 15:14:26,418 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60593#true} {60593#true} #92#return; {60593#true} is VALID [2022-04-15 15:14:26,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,419 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-15 15:14:26,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60593#true} {60593#true} #90#return; {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {60593#true} assume !(0 == ~cond); {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {60593#true} ~cond := #in~cond; {60593#true} is VALID [2022-04-15 15:14:26,419 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-15 15:14:26,419 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-15 15:14:26,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {60593#true} call #t~ret9 := main(); {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60593#true} {60593#true} #102#return; {60593#true} is VALID [2022-04-15 15:14:26,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {60593#true} assume true; {60593#true} is VALID [2022-04-15 15:14:26,419 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-15 15:14:26,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {60593#true} call ULTIMATE.init(); {60593#true} is VALID [2022-04-15 15:14:26,420 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-15 15:14:26,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:26,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968128376] [2022-04-15 15:14:26,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:26,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181973610] [2022-04-15 15:14:26,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181973610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:26,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:26,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:14:26,420 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148377338] [2022-04-15 15:14:26,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148377338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:26,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:26,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:14:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8068000] [2022-04-15 15:14:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:26,421 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-15 15:14:26,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:26,421 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-15 15:14:26,489 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-15 15:14:26,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:14:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:14:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:14:26,490 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-15 15:14:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:29,741 INFO L93 Difference]: Finished difference Result 862 states and 1224 transitions. [2022-04-15 15:14:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:14:29,742 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-15 15:14:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:29,742 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-15 15:14:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:14:29,743 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-15 15:14:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:14:29,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-15 15:14:29,913 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-15 15:14:29,940 INFO L225 Difference]: With dead ends: 862 [2022-04-15 15:14:29,940 INFO L226 Difference]: Without dead ends: 711 [2022-04-15 15:14:29,940 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-15 15:14:29,941 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-15 15:14:29,941 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-15 15:14:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-04-15 15:14:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 560. [2022-04-15 15:14:31,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:31,527 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-15 15:14:31,528 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-15 15:14:31,528 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-15 15:14:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:31,547 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-15 15:14:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-15 15:14:31,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:31,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:31,548 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-15 15:14:31,548 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-15 15:14:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:31,570 INFO L93 Difference]: Finished difference Result 711 states and 989 transitions. [2022-04-15 15:14:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 989 transitions. [2022-04-15 15:14:31,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:31,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:31,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:31,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:31,572 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-15 15:14:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 768 transitions. [2022-04-15 15:14:31,587 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 768 transitions. Word has length 113 [2022-04-15 15:14:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:31,588 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 768 transitions. [2022-04-15 15:14:31,588 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-15 15:14:31,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 560 states and 768 transitions. [2022-04-15 15:14:34,760 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-15 15:14:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 768 transitions. [2022-04-15 15:14:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:14:34,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:34,761 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-15 15:14:34,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:34,962 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-15 15:14:34,962 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-15 15:14:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686547381] [2022-04-15 15:14:34,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-15 15:14:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343882889] [2022-04-15 15:14:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:34,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:34,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849362331] [2022-04-15 15:14:34,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:14:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:34,977 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-15 15:14:34,980 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-15 15:14:35,359 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:14:35,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:35,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:14:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:35,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:35,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {65560#true} call ULTIMATE.init(); {65560#true} is VALID [2022-04-15 15:14:35,953 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-15 15:14:35,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65568#(<= ~counter~0 0)} {65560#true} #102#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {65568#(<= ~counter~0 0)} call #t~ret9 := main(); {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,954 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-15 15:14:35,954 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-15 15:14:35,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {65568#(<= ~counter~0 0)} ~cond := #in~cond; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {65568#(<= ~counter~0 0)} assume !(0 == ~cond); {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65568#(<= ~counter~0 0)} {65568#(<= ~counter~0 0)} #90#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,956 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-15 15:14:35,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {65568#(<= ~counter~0 0)} ~cond := #in~cond; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {65568#(<= ~counter~0 0)} assume !(0 == ~cond); {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {65568#(<= ~counter~0 0)} assume true; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65568#(<= ~counter~0 0)} {65568#(<= ~counter~0 0)} #92#return; {65568#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:35,957 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-15 15:14:35,959 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-15 15:14:35,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {65617#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,960 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-15 15:14:35,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {65617#(<= ~counter~0 1)} ~cond := #in~cond; {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {65617#(<= ~counter~0 1)} assume !(0 == ~cond); {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {65617#(<= ~counter~0 1)} assume true; {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,961 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65617#(<= ~counter~0 1)} {65617#(<= ~counter~0 1)} #94#return; {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {65617#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65617#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:35,962 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-15 15:14:35,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {65642#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,963 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-15 15:14:35,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {65642#(<= ~counter~0 2)} ~cond := #in~cond; {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {65642#(<= ~counter~0 2)} assume !(0 == ~cond); {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {65642#(<= ~counter~0 2)} assume true; {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,964 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65642#(<= ~counter~0 2)} {65642#(<= ~counter~0 2)} #96#return; {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {65642#(<= ~counter~0 2)} assume !(~r~0 > 0); {65642#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:35,965 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-15 15:14:35,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {65667#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {65667#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,966 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-15 15:14:35,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {65667#(<= ~counter~0 3)} ~cond := #in~cond; {65667#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {65667#(<= ~counter~0 3)} assume !(0 == ~cond); {65667#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {65667#(<= ~counter~0 3)} assume true; {65667#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,967 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65667#(<= ~counter~0 3)} {65667#(<= ~counter~0 3)} #98#return; {65667#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:35,968 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-15 15:14:35,968 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-15 15:14:35,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {65692#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,969 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-15 15:14:35,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {65692#(<= ~counter~0 4)} ~cond := #in~cond; {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {65692#(<= ~counter~0 4)} assume !(0 == ~cond); {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {65692#(<= ~counter~0 4)} assume true; {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65692#(<= ~counter~0 4)} {65692#(<= ~counter~0 4)} #98#return; {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {65692#(<= ~counter~0 4)} assume !(~r~0 < 0); {65692#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:35,972 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-15 15:14:35,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {65717#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,972 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-15 15:14:35,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {65717#(<= ~counter~0 5)} ~cond := #in~cond; {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {65717#(<= ~counter~0 5)} assume !(0 == ~cond); {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,973 INFO L290 TraceCheckUtils]: 54: Hoare triple {65717#(<= ~counter~0 5)} assume true; {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,974 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65717#(<= ~counter~0 5)} {65717#(<= ~counter~0 5)} #94#return; {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {65717#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65717#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:35,975 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-15 15:14:35,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {65742#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {65742#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,976 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-15 15:14:35,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {65742#(<= ~counter~0 6)} ~cond := #in~cond; {65742#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {65742#(<= ~counter~0 6)} assume !(0 == ~cond); {65742#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {65742#(<= ~counter~0 6)} assume true; {65742#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,977 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65742#(<= ~counter~0 6)} {65742#(<= ~counter~0 6)} #96#return; {65742#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:35,977 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-15 15:14:35,978 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-15 15:14:35,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {65767#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {65767#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,979 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-15 15:14:35,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {65767#(<= ~counter~0 7)} ~cond := #in~cond; {65767#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {65767#(<= ~counter~0 7)} assume !(0 == ~cond); {65767#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,980 INFO L290 TraceCheckUtils]: 70: Hoare triple {65767#(<= ~counter~0 7)} assume true; {65767#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,980 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65767#(<= ~counter~0 7)} {65767#(<= ~counter~0 7)} #96#return; {65767#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:35,980 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-15 15:14:35,981 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-15 15:14:35,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {65792#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {65792#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,982 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-15 15:14:35,982 INFO L290 TraceCheckUtils]: 76: Hoare triple {65792#(<= ~counter~0 8)} ~cond := #in~cond; {65792#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {65792#(<= ~counter~0 8)} assume !(0 == ~cond); {65792#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,983 INFO L290 TraceCheckUtils]: 78: Hoare triple {65792#(<= ~counter~0 8)} assume true; {65792#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,983 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65792#(<= ~counter~0 8)} {65792#(<= ~counter~0 8)} #96#return; {65792#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:35,984 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-15 15:14:35,985 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-15 15:14:35,985 INFO L290 TraceCheckUtils]: 82: Hoare triple {65817#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {65817#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:35,985 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-15 15:14:35,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {65817#(<= ~counter~0 9)} ~cond := #in~cond; {65817#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:35,986 INFO L290 TraceCheckUtils]: 85: Hoare triple {65817#(<= ~counter~0 9)} assume !(0 == ~cond); {65817#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:35,986 INFO L290 TraceCheckUtils]: 86: Hoare triple {65817#(<= ~counter~0 9)} assume true; {65817#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:35,987 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65817#(<= ~counter~0 9)} {65817#(<= ~counter~0 9)} #96#return; {65817#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:35,987 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-15 15:14:35,988 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-15 15:14:35,988 INFO L290 TraceCheckUtils]: 90: Hoare triple {65842#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,989 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-15 15:14:35,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {65842#(<= ~counter~0 10)} ~cond := #in~cond; {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,989 INFO L290 TraceCheckUtils]: 93: Hoare triple {65842#(<= ~counter~0 10)} assume !(0 == ~cond); {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,989 INFO L290 TraceCheckUtils]: 94: Hoare triple {65842#(<= ~counter~0 10)} assume true; {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,990 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65842#(<= ~counter~0 10)} {65842#(<= ~counter~0 10)} #96#return; {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,990 INFO L290 TraceCheckUtils]: 96: Hoare triple {65842#(<= ~counter~0 10)} assume !(~r~0 > 0); {65842#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:35,991 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-15 15:14:35,991 INFO L290 TraceCheckUtils]: 98: Hoare triple {65867#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {65867#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:35,992 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-15 15:14:35,992 INFO L290 TraceCheckUtils]: 100: Hoare triple {65867#(<= ~counter~0 11)} ~cond := #in~cond; {65867#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:35,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {65867#(<= ~counter~0 11)} assume !(0 == ~cond); {65867#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:35,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {65867#(<= ~counter~0 11)} assume true; {65867#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:35,993 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65867#(<= ~counter~0 11)} {65867#(<= ~counter~0 11)} #98#return; {65867#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:35,993 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-15 15:14:35,994 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-15 15:14:35,994 INFO L290 TraceCheckUtils]: 106: Hoare triple {65892#(<= |main_#t~post8| 11)} assume !(#t~post8 < 50);havoc #t~post8; {65561#false} is VALID [2022-04-15 15:14:35,994 INFO L290 TraceCheckUtils]: 107: Hoare triple {65561#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65561#false} is VALID [2022-04-15 15:14:35,994 INFO L290 TraceCheckUtils]: 108: Hoare triple {65561#false} assume !(#t~post6 < 50);havoc #t~post6; {65561#false} is VALID [2022-04-15 15:14:35,994 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-15 15:14:35,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {65561#false} ~cond := #in~cond; {65561#false} is VALID [2022-04-15 15:14:35,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {65561#false} assume 0 == ~cond; {65561#false} is VALID [2022-04-15 15:14:35,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {65561#false} assume !false; {65561#false} is VALID [2022-04-15 15:14:35,995 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-15 15:14:35,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:36,621 INFO L290 TraceCheckUtils]: 112: Hoare triple {65561#false} assume !false; {65561#false} is VALID [2022-04-15 15:14:36,621 INFO L290 TraceCheckUtils]: 111: Hoare triple {65561#false} assume 0 == ~cond; {65561#false} is VALID [2022-04-15 15:14:36,621 INFO L290 TraceCheckUtils]: 110: Hoare triple {65561#false} ~cond := #in~cond; {65561#false} is VALID [2022-04-15 15:14:36,621 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-15 15:14:36,621 INFO L290 TraceCheckUtils]: 108: Hoare triple {65561#false} assume !(#t~post6 < 50);havoc #t~post6; {65561#false} is VALID [2022-04-15 15:14:36,622 INFO L290 TraceCheckUtils]: 107: Hoare triple {65561#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65561#false} is VALID [2022-04-15 15:14:36,622 INFO L290 TraceCheckUtils]: 106: Hoare triple {65932#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {65561#false} is VALID [2022-04-15 15:14:36,622 INFO L290 TraceCheckUtils]: 105: Hoare triple {65936#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65932#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:14:36,622 INFO L290 TraceCheckUtils]: 104: Hoare triple {65936#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65936#(< ~counter~0 50)} is VALID [2022-04-15 15:14:36,623 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65560#true} {65936#(< ~counter~0 50)} #98#return; {65936#(< ~counter~0 50)} is VALID [2022-04-15 15:14:36,623 INFO L290 TraceCheckUtils]: 102: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,623 INFO L290 TraceCheckUtils]: 101: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,623 INFO L290 TraceCheckUtils]: 100: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,623 INFO L272 TraceCheckUtils]: 99: Hoare triple {65936#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:36,623 INFO L290 TraceCheckUtils]: 98: Hoare triple {65936#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {65936#(< ~counter~0 50)} is VALID [2022-04-15 15:14:36,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {65961#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65936#(< ~counter~0 50)} is VALID [2022-04-15 15:14:36,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {65961#(< ~counter~0 49)} assume !(~r~0 > 0); {65961#(< ~counter~0 49)} is VALID [2022-04-15 15:14:36,626 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65560#true} {65961#(< ~counter~0 49)} #96#return; {65961#(< ~counter~0 49)} is VALID [2022-04-15 15:14:36,626 INFO L290 TraceCheckUtils]: 94: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,626 INFO L290 TraceCheckUtils]: 93: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,626 INFO L272 TraceCheckUtils]: 91: Hoare triple {65961#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:36,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {65961#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {65961#(< ~counter~0 49)} is VALID [2022-04-15 15:14:36,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {65986#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65961#(< ~counter~0 49)} is VALID [2022-04-15 15:14:36,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {65986#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65986#(< ~counter~0 48)} is VALID [2022-04-15 15:14:36,628 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65560#true} {65986#(< ~counter~0 48)} #96#return; {65986#(< ~counter~0 48)} is VALID [2022-04-15 15:14:36,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,628 INFO L272 TraceCheckUtils]: 83: Hoare triple {65986#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:36,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {65986#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {65986#(< ~counter~0 48)} is VALID [2022-04-15 15:14:36,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {66011#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65986#(< ~counter~0 48)} is VALID [2022-04-15 15:14:36,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {66011#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66011#(< ~counter~0 47)} is VALID [2022-04-15 15:14:36,630 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65560#true} {66011#(< ~counter~0 47)} #96#return; {66011#(< ~counter~0 47)} is VALID [2022-04-15 15:14:36,630 INFO L290 TraceCheckUtils]: 78: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,630 INFO L290 TraceCheckUtils]: 76: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,630 INFO L272 TraceCheckUtils]: 75: Hoare triple {66011#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:36,630 INFO L290 TraceCheckUtils]: 74: Hoare triple {66011#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {66011#(< ~counter~0 47)} is VALID [2022-04-15 15:14:36,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {66036#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66011#(< ~counter~0 47)} is VALID [2022-04-15 15:14:36,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {66036#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66036#(< ~counter~0 46)} is VALID [2022-04-15 15:14:36,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65560#true} {66036#(< ~counter~0 46)} #96#return; {66036#(< ~counter~0 46)} is VALID [2022-04-15 15:14:36,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,632 INFO L272 TraceCheckUtils]: 67: Hoare triple {66036#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:36,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {66036#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {66036#(< ~counter~0 46)} is VALID [2022-04-15 15:14:36,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {66061#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66036#(< ~counter~0 46)} is VALID [2022-04-15 15:14:36,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {66061#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66061#(< ~counter~0 45)} is VALID [2022-04-15 15:14:36,634 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65560#true} {66061#(< ~counter~0 45)} #96#return; {66061#(< ~counter~0 45)} is VALID [2022-04-15 15:14:36,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,634 INFO L272 TraceCheckUtils]: 59: Hoare triple {66061#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:36,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {66061#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {66061#(< ~counter~0 45)} is VALID [2022-04-15 15:14:36,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {66086#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66061#(< ~counter~0 45)} is VALID [2022-04-15 15:14:36,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {66086#(< ~counter~0 44)} assume !!(0 != ~r~0); {66086#(< ~counter~0 44)} is VALID [2022-04-15 15:14:36,636 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65560#true} {66086#(< ~counter~0 44)} #94#return; {66086#(< ~counter~0 44)} is VALID [2022-04-15 15:14:36,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,636 INFO L272 TraceCheckUtils]: 51: Hoare triple {66086#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:36,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {66086#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {66086#(< ~counter~0 44)} is VALID [2022-04-15 15:14:36,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {66111#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66086#(< ~counter~0 44)} is VALID [2022-04-15 15:14:36,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {66111#(< ~counter~0 43)} assume !(~r~0 < 0); {66111#(< ~counter~0 43)} is VALID [2022-04-15 15:14:36,638 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65560#true} {66111#(< ~counter~0 43)} #98#return; {66111#(< ~counter~0 43)} is VALID [2022-04-15 15:14:36,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,638 INFO L290 TraceCheckUtils]: 45: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,638 INFO L290 TraceCheckUtils]: 44: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,638 INFO L272 TraceCheckUtils]: 43: Hoare triple {66111#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:36,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {66111#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {66111#(< ~counter~0 43)} is VALID [2022-04-15 15:14:36,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {66136#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66111#(< ~counter~0 43)} is VALID [2022-04-15 15:14:36,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {66136#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66136#(< ~counter~0 42)} is VALID [2022-04-15 15:14:36,640 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65560#true} {66136#(< ~counter~0 42)} #98#return; {66136#(< ~counter~0 42)} is VALID [2022-04-15 15:14:36,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,640 INFO L272 TraceCheckUtils]: 35: Hoare triple {66136#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:36,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {66136#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {66136#(< ~counter~0 42)} is VALID [2022-04-15 15:14:36,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {66161#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66136#(< ~counter~0 42)} is VALID [2022-04-15 15:14:36,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {66161#(< ~counter~0 41)} assume !(~r~0 > 0); {66161#(< ~counter~0 41)} is VALID [2022-04-15 15:14:36,642 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65560#true} {66161#(< ~counter~0 41)} #96#return; {66161#(< ~counter~0 41)} is VALID [2022-04-15 15:14:36,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,643 INFO L272 TraceCheckUtils]: 27: Hoare triple {66161#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:36,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {66161#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {66161#(< ~counter~0 41)} is VALID [2022-04-15 15:14:36,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {66186#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66161#(< ~counter~0 41)} is VALID [2022-04-15 15:14:36,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {66186#(< ~counter~0 40)} assume !!(0 != ~r~0); {66186#(< ~counter~0 40)} is VALID [2022-04-15 15:14:36,644 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65560#true} {66186#(< ~counter~0 40)} #94#return; {66186#(< ~counter~0 40)} is VALID [2022-04-15 15:14:36,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,645 INFO L272 TraceCheckUtils]: 19: Hoare triple {66186#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:14:36,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {66186#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {66186#(< ~counter~0 40)} is VALID [2022-04-15 15:14:36,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {66211#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66186#(< ~counter~0 40)} is VALID [2022-04-15 15:14:36,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {66211#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65560#true} {66211#(< ~counter~0 39)} #92#return; {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,647 INFO L272 TraceCheckUtils]: 11: Hoare triple {66211#(< ~counter~0 39)} call assume_abort_if_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-15 15:14:36,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65560#true} {66211#(< ~counter~0 39)} #90#return; {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {65560#true} assume true; {65560#true} is VALID [2022-04-15 15:14:36,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {65560#true} assume !(0 == ~cond); {65560#true} is VALID [2022-04-15 15:14:36,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {65560#true} ~cond := #in~cond; {65560#true} is VALID [2022-04-15 15:14:36,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {66211#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65560#true} is VALID [2022-04-15 15:14:36,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {66211#(< ~counter~0 39)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 39)} is VALID [2022-04-15 15:14:36,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#(< ~counter~0 39)} call #t~ret9 := main(); {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#(< ~counter~0 39)} {65560#true} #102#return; {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#(< ~counter~0 39)} assume true; {66211#(< ~counter~0 39)} is VALID [2022-04-15 15:14:36,649 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 39)} is VALID [2022-04-15 15:14:36,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {65560#true} call ULTIMATE.init(); {65560#true} is VALID [2022-04-15 15:14:36,649 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-15 15:14:36,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:36,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343882889] [2022-04-15 15:14:36,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:36,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849362331] [2022-04-15 15:14:36,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849362331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:36,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:36,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:14:36,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:36,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686547381] [2022-04-15 15:14:36,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686547381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:36,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:36,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:14:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479123661] [2022-04-15 15:14:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:36,651 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-15 15:14:36,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:36,651 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-15 15:14:36,738 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-15 15:14:36,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:14:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:14:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:14:36,740 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-15 15:14:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:39,405 INFO L93 Difference]: Finished difference Result 781 states and 1101 transitions. [2022-04-15 15:14:39,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 15:14:39,406 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-15 15:14:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:39,406 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-15 15:14:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:14:39,420 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-15 15:14:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:14:39,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-15 15:14:39,624 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-15 15:14:39,639 INFO L225 Difference]: With dead ends: 781 [2022-04-15 15:14:39,639 INFO L226 Difference]: Without dead ends: 588 [2022-04-15 15:14:39,639 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-15 15:14:39,640 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 144 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:39,640 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.3s Time] [2022-04-15 15:14:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-04-15 15:14:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 578. [2022-04-15 15:14:41,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:41,240 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-15 15:14:41,240 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-15 15:14:41,240 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-15 15:14:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:41,259 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-15 15:14:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-15 15:14:41,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:41,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:41,261 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-15 15:14:41,261 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-15 15:14:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:41,280 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2022-04-15 15:14:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-04-15 15:14:41,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:41,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:41,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:41,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:41,282 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-15 15:14:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 790 transitions. [2022-04-15 15:14:41,304 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 790 transitions. Word has length 113 [2022-04-15 15:14:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:41,304 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 790 transitions. [2022-04-15 15:14:41,304 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-15 15:14:41,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 790 transitions. [2022-04-15 15:14:43,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 790 edges. 790 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 790 transitions. [2022-04-15 15:14:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 15:14:43,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:43,282 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-15 15:14:43,287 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-15 15:14:43,483 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-15 15:14:43,483 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-15 15:14:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955575655] [2022-04-15 15:14:43,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-15 15:14:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540481653] [2022-04-15 15:14:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:43,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:43,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457645277] [2022-04-15 15:14:43,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:43,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:43,498 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-15 15:14:43,527 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-15 15:14:43,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:43,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:43,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:14:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:43,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:44,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {70177#true} call ULTIMATE.init(); {70177#true} is VALID [2022-04-15 15:14:44,147 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-15 15:14:44,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70185#(<= ~counter~0 0)} {70177#true} #102#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {70185#(<= ~counter~0 0)} call #t~ret9 := main(); {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,148 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-15 15:14:44,148 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-15 15:14:44,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {70185#(<= ~counter~0 0)} ~cond := #in~cond; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {70185#(<= ~counter~0 0)} assume !(0 == ~cond); {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70185#(<= ~counter~0 0)} {70185#(<= ~counter~0 0)} #90#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,150 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-15 15:14:44,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {70185#(<= ~counter~0 0)} ~cond := #in~cond; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {70185#(<= ~counter~0 0)} assume !(0 == ~cond); {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {70185#(<= ~counter~0 0)} assume true; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,151 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70185#(<= ~counter~0 0)} {70185#(<= ~counter~0 0)} #92#return; {70185#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:44,151 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-15 15:14:44,153 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-15 15:14:44,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {70234#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,154 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-15 15:14:44,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(<= ~counter~0 1)} ~cond := #in~cond; {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {70234#(<= ~counter~0 1)} assume !(0 == ~cond); {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {70234#(<= ~counter~0 1)} assume true; {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,155 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70234#(<= ~counter~0 1)} {70234#(<= ~counter~0 1)} #94#return; {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {70234#(<= ~counter~0 1)} assume !!(0 != ~r~0); {70234#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:44,156 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-15 15:14:44,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {70259#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,157 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-15 15:14:44,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {70259#(<= ~counter~0 2)} ~cond := #in~cond; {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {70259#(<= ~counter~0 2)} assume !(0 == ~cond); {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {70259#(<= ~counter~0 2)} assume true; {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,158 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70259#(<= ~counter~0 2)} {70259#(<= ~counter~0 2)} #96#return; {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {70259#(<= ~counter~0 2)} assume !(~r~0 > 0); {70259#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:44,159 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-15 15:14:44,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {70284#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {70284#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:44,160 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-15 15:14:44,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {70284#(<= ~counter~0 3)} ~cond := #in~cond; {70284#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:44,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {70284#(<= ~counter~0 3)} assume !(0 == ~cond); {70284#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:44,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {70284#(<= ~counter~0 3)} assume true; {70284#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:44,161 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {70284#(<= ~counter~0 3)} {70284#(<= ~counter~0 3)} #98#return; {70284#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:44,161 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-15 15:14:44,162 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-15 15:14:44,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {70309#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,163 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-15 15:14:44,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {70309#(<= ~counter~0 4)} ~cond := #in~cond; {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,163 INFO L290 TraceCheckUtils]: 45: Hoare triple {70309#(<= ~counter~0 4)} assume !(0 == ~cond); {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {70309#(<= ~counter~0 4)} assume true; {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,164 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {70309#(<= ~counter~0 4)} {70309#(<= ~counter~0 4)} #98#return; {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {70309#(<= ~counter~0 4)} assume !(~r~0 < 0); {70309#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:44,165 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-15 15:14:44,165 INFO L290 TraceCheckUtils]: 50: Hoare triple {70334#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,166 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-15 15:14:44,166 INFO L290 TraceCheckUtils]: 52: Hoare triple {70334#(<= ~counter~0 5)} ~cond := #in~cond; {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {70334#(<= ~counter~0 5)} assume !(0 == ~cond); {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,167 INFO L290 TraceCheckUtils]: 54: Hoare triple {70334#(<= ~counter~0 5)} assume true; {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,167 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {70334#(<= ~counter~0 5)} {70334#(<= ~counter~0 5)} #94#return; {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,168 INFO L290 TraceCheckUtils]: 56: Hoare triple {70334#(<= ~counter~0 5)} assume !!(0 != ~r~0); {70334#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:44,168 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-15 15:14:44,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {70359#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {70359#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:44,169 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-15 15:14:44,169 INFO L290 TraceCheckUtils]: 60: Hoare triple {70359#(<= ~counter~0 6)} ~cond := #in~cond; {70359#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:44,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {70359#(<= ~counter~0 6)} assume !(0 == ~cond); {70359#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:44,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {70359#(<= ~counter~0 6)} assume true; {70359#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:44,170 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {70359#(<= ~counter~0 6)} {70359#(<= ~counter~0 6)} #96#return; {70359#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:44,171 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-15 15:14:44,171 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-15 15:14:44,172 INFO L290 TraceCheckUtils]: 66: Hoare triple {70384#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {70384#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:44,172 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-15 15:14:44,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {70384#(<= ~counter~0 7)} ~cond := #in~cond; {70384#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:44,173 INFO L290 TraceCheckUtils]: 69: Hoare triple {70384#(<= ~counter~0 7)} assume !(0 == ~cond); {70384#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:44,173 INFO L290 TraceCheckUtils]: 70: Hoare triple {70384#(<= ~counter~0 7)} assume true; {70384#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:44,173 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70384#(<= ~counter~0 7)} {70384#(<= ~counter~0 7)} #96#return; {70384#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:44,174 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-15 15:14:44,174 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-15 15:14:44,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {70409#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,175 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-15 15:14:44,175 INFO L290 TraceCheckUtils]: 76: Hoare triple {70409#(<= ~counter~0 8)} ~cond := #in~cond; {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,176 INFO L290 TraceCheckUtils]: 77: Hoare triple {70409#(<= ~counter~0 8)} assume !(0 == ~cond); {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,176 INFO L290 TraceCheckUtils]: 78: Hoare triple {70409#(<= ~counter~0 8)} assume true; {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,176 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {70409#(<= ~counter~0 8)} {70409#(<= ~counter~0 8)} #96#return; {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {70409#(<= ~counter~0 8)} assume !(~r~0 > 0); {70409#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:44,177 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-15 15:14:44,178 INFO L290 TraceCheckUtils]: 82: Hoare triple {70434#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {70434#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:44,178 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-15 15:14:44,179 INFO L290 TraceCheckUtils]: 84: Hoare triple {70434#(<= ~counter~0 9)} ~cond := #in~cond; {70434#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:44,179 INFO L290 TraceCheckUtils]: 85: Hoare triple {70434#(<= ~counter~0 9)} assume !(0 == ~cond); {70434#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:44,179 INFO L290 TraceCheckUtils]: 86: Hoare triple {70434#(<= ~counter~0 9)} assume true; {70434#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:44,180 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70434#(<= ~counter~0 9)} {70434#(<= ~counter~0 9)} #98#return; {70434#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:44,180 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-15 15:14:44,181 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-15 15:14:44,181 INFO L290 TraceCheckUtils]: 90: Hoare triple {70459#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,181 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-15 15:14:44,182 INFO L290 TraceCheckUtils]: 92: Hoare triple {70459#(<= ~counter~0 10)} ~cond := #in~cond; {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,182 INFO L290 TraceCheckUtils]: 93: Hoare triple {70459#(<= ~counter~0 10)} assume !(0 == ~cond); {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,182 INFO L290 TraceCheckUtils]: 94: Hoare triple {70459#(<= ~counter~0 10)} assume true; {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,183 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70459#(<= ~counter~0 10)} {70459#(<= ~counter~0 10)} #98#return; {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {70459#(<= ~counter~0 10)} assume !(~r~0 < 0); {70459#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:44,184 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-15 15:14:44,184 INFO L290 TraceCheckUtils]: 98: Hoare triple {70484#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,184 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-15 15:14:44,185 INFO L290 TraceCheckUtils]: 100: Hoare triple {70484#(<= ~counter~0 11)} ~cond := #in~cond; {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,185 INFO L290 TraceCheckUtils]: 101: Hoare triple {70484#(<= ~counter~0 11)} assume !(0 == ~cond); {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,185 INFO L290 TraceCheckUtils]: 102: Hoare triple {70484#(<= ~counter~0 11)} assume true; {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,186 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70484#(<= ~counter~0 11)} {70484#(<= ~counter~0 11)} #94#return; {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,186 INFO L290 TraceCheckUtils]: 104: Hoare triple {70484#(<= ~counter~0 11)} assume !!(0 != ~r~0); {70484#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:44,186 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-15 15:14:44,187 INFO L290 TraceCheckUtils]: 106: Hoare triple {70509#(<= |main_#t~post7| 11)} assume !(#t~post7 < 50);havoc #t~post7; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 107: Hoare triple {70178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 108: Hoare triple {70178#false} assume !(#t~post8 < 50);havoc #t~post8; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 109: Hoare triple {70178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 110: Hoare triple {70178#false} assume !(#t~post6 < 50);havoc #t~post6; {70178#false} is VALID [2022-04-15 15:14:44,187 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-15 15:14:44,187 INFO L290 TraceCheckUtils]: 112: Hoare triple {70178#false} ~cond := #in~cond; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 113: Hoare triple {70178#false} assume 0 == ~cond; {70178#false} is VALID [2022-04-15 15:14:44,187 INFO L290 TraceCheckUtils]: 114: Hoare triple {70178#false} assume !false; {70178#false} is VALID [2022-04-15 15:14:44,188 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-15 15:14:44,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:44,850 INFO L290 TraceCheckUtils]: 114: Hoare triple {70178#false} assume !false; {70178#false} is VALID [2022-04-15 15:14:44,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {70178#false} assume 0 == ~cond; {70178#false} is VALID [2022-04-15 15:14:44,851 INFO L290 TraceCheckUtils]: 112: Hoare triple {70178#false} ~cond := #in~cond; {70178#false} is VALID [2022-04-15 15:14:44,851 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-15 15:14:44,851 INFO L290 TraceCheckUtils]: 110: Hoare triple {70178#false} assume !(#t~post6 < 50);havoc #t~post6; {70178#false} is VALID [2022-04-15 15:14:44,851 INFO L290 TraceCheckUtils]: 109: Hoare triple {70178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70178#false} is VALID [2022-04-15 15:14:44,851 INFO L290 TraceCheckUtils]: 108: Hoare triple {70178#false} assume !(#t~post8 < 50);havoc #t~post8; {70178#false} is VALID [2022-04-15 15:14:44,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {70178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70178#false} is VALID [2022-04-15 15:14:44,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {70561#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {70178#false} is VALID [2022-04-15 15:14:44,852 INFO L290 TraceCheckUtils]: 105: Hoare triple {70565#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70561#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:14:44,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {70565#(< ~counter~0 50)} assume !!(0 != ~r~0); {70565#(< ~counter~0 50)} is VALID [2022-04-15 15:14:44,852 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70177#true} {70565#(< ~counter~0 50)} #94#return; {70565#(< ~counter~0 50)} is VALID [2022-04-15 15:14:44,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,853 INFO L290 TraceCheckUtils]: 101: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,853 INFO L290 TraceCheckUtils]: 100: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,853 INFO L272 TraceCheckUtils]: 99: Hoare triple {70565#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:44,853 INFO L290 TraceCheckUtils]: 98: Hoare triple {70565#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {70565#(< ~counter~0 50)} is VALID [2022-04-15 15:14:44,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {70590#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70565#(< ~counter~0 50)} is VALID [2022-04-15 15:14:44,855 INFO L290 TraceCheckUtils]: 96: Hoare triple {70590#(< ~counter~0 49)} assume !(~r~0 < 0); {70590#(< ~counter~0 49)} is VALID [2022-04-15 15:14:44,855 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70177#true} {70590#(< ~counter~0 49)} #98#return; {70590#(< ~counter~0 49)} is VALID [2022-04-15 15:14:44,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,855 INFO L290 TraceCheckUtils]: 92: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,856 INFO L272 TraceCheckUtils]: 91: Hoare triple {70590#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:44,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {70590#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {70590#(< ~counter~0 49)} is VALID [2022-04-15 15:14:44,857 INFO L290 TraceCheckUtils]: 89: Hoare triple {70615#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70590#(< ~counter~0 49)} is VALID [2022-04-15 15:14:44,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {70615#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70615#(< ~counter~0 48)} is VALID [2022-04-15 15:14:44,857 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70177#true} {70615#(< ~counter~0 48)} #98#return; {70615#(< ~counter~0 48)} is VALID [2022-04-15 15:14:44,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,858 INFO L272 TraceCheckUtils]: 83: Hoare triple {70615#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:44,858 INFO L290 TraceCheckUtils]: 82: Hoare triple {70615#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {70615#(< ~counter~0 48)} is VALID [2022-04-15 15:14:44,859 INFO L290 TraceCheckUtils]: 81: Hoare triple {70640#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70615#(< ~counter~0 48)} is VALID [2022-04-15 15:14:44,859 INFO L290 TraceCheckUtils]: 80: Hoare triple {70640#(< ~counter~0 47)} assume !(~r~0 > 0); {70640#(< ~counter~0 47)} is VALID [2022-04-15 15:14:44,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {70177#true} {70640#(< ~counter~0 47)} #96#return; {70640#(< ~counter~0 47)} is VALID [2022-04-15 15:14:44,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,860 INFO L272 TraceCheckUtils]: 75: Hoare triple {70640#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:44,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {70640#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {70640#(< ~counter~0 47)} is VALID [2022-04-15 15:14:44,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {70665#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70640#(< ~counter~0 47)} is VALID [2022-04-15 15:14:44,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {70665#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70665#(< ~counter~0 46)} is VALID [2022-04-15 15:14:44,861 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70177#true} {70665#(< ~counter~0 46)} #96#return; {70665#(< ~counter~0 46)} is VALID [2022-04-15 15:14:44,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,862 INFO L272 TraceCheckUtils]: 67: Hoare triple {70665#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:44,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {70665#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {70665#(< ~counter~0 46)} is VALID [2022-04-15 15:14:44,863 INFO L290 TraceCheckUtils]: 65: Hoare triple {70690#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70665#(< ~counter~0 46)} is VALID [2022-04-15 15:14:44,863 INFO L290 TraceCheckUtils]: 64: Hoare triple {70690#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70690#(< ~counter~0 45)} is VALID [2022-04-15 15:14:44,864 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {70177#true} {70690#(< ~counter~0 45)} #96#return; {70690#(< ~counter~0 45)} is VALID [2022-04-15 15:14:44,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,864 INFO L272 TraceCheckUtils]: 59: Hoare triple {70690#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:44,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {70690#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {70690#(< ~counter~0 45)} is VALID [2022-04-15 15:14:44,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {70715#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70690#(< ~counter~0 45)} is VALID [2022-04-15 15:14:44,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {70715#(< ~counter~0 44)} assume !!(0 != ~r~0); {70715#(< ~counter~0 44)} is VALID [2022-04-15 15:14:44,866 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {70177#true} {70715#(< ~counter~0 44)} #94#return; {70715#(< ~counter~0 44)} is VALID [2022-04-15 15:14:44,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,866 INFO L272 TraceCheckUtils]: 51: Hoare triple {70715#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:44,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {70715#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {70715#(< ~counter~0 44)} is VALID [2022-04-15 15:14:44,867 INFO L290 TraceCheckUtils]: 49: Hoare triple {70740#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70715#(< ~counter~0 44)} is VALID [2022-04-15 15:14:44,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {70740#(< ~counter~0 43)} assume !(~r~0 < 0); {70740#(< ~counter~0 43)} is VALID [2022-04-15 15:14:44,868 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {70177#true} {70740#(< ~counter~0 43)} #98#return; {70740#(< ~counter~0 43)} is VALID [2022-04-15 15:14:44,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,868 INFO L290 TraceCheckUtils]: 45: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,868 INFO L290 TraceCheckUtils]: 44: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,868 INFO L272 TraceCheckUtils]: 43: Hoare triple {70740#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:44,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {70740#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {70740#(< ~counter~0 43)} is VALID [2022-04-15 15:14:44,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {70765#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70740#(< ~counter~0 43)} is VALID [2022-04-15 15:14:44,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {70765#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70765#(< ~counter~0 42)} is VALID [2022-04-15 15:14:44,870 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {70177#true} {70765#(< ~counter~0 42)} #98#return; {70765#(< ~counter~0 42)} is VALID [2022-04-15 15:14:44,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,870 INFO L272 TraceCheckUtils]: 35: Hoare triple {70765#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:44,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {70765#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {70765#(< ~counter~0 42)} is VALID [2022-04-15 15:14:44,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {70790#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70765#(< ~counter~0 42)} is VALID [2022-04-15 15:14:44,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {70790#(< ~counter~0 41)} assume !(~r~0 > 0); {70790#(< ~counter~0 41)} is VALID [2022-04-15 15:14:44,872 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70177#true} {70790#(< ~counter~0 41)} #96#return; {70790#(< ~counter~0 41)} is VALID [2022-04-15 15:14:44,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,872 INFO L272 TraceCheckUtils]: 27: Hoare triple {70790#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:44,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {70790#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {70790#(< ~counter~0 41)} is VALID [2022-04-15 15:14:44,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {70815#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70790#(< ~counter~0 41)} is VALID [2022-04-15 15:14:44,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {70815#(< ~counter~0 40)} assume !!(0 != ~r~0); {70815#(< ~counter~0 40)} is VALID [2022-04-15 15:14:44,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70177#true} {70815#(< ~counter~0 40)} #94#return; {70815#(< ~counter~0 40)} is VALID [2022-04-15 15:14:44,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {70815#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:14:44,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {70815#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {70815#(< ~counter~0 40)} is VALID [2022-04-15 15:14:44,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {70840#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70815#(< ~counter~0 40)} is VALID [2022-04-15 15:14:44,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {70840#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70177#true} {70840#(< ~counter~0 39)} #92#return; {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {70840#(< ~counter~0 39)} call assume_abort_if_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-15 15:14:44,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70177#true} {70840#(< ~counter~0 39)} #90#return; {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {70177#true} assume true; {70177#true} is VALID [2022-04-15 15:14:44,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {70177#true} assume !(0 == ~cond); {70177#true} is VALID [2022-04-15 15:14:44,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {70177#true} ~cond := #in~cond; {70177#true} is VALID [2022-04-15 15:14:44,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {70840#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {70177#true} is VALID [2022-04-15 15:14:44,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {70840#(< ~counter~0 39)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 39)} is VALID [2022-04-15 15:14:44,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {70840#(< ~counter~0 39)} call #t~ret9 := main(); {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70840#(< ~counter~0 39)} {70177#true} #102#return; {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {70840#(< ~counter~0 39)} assume true; {70840#(< ~counter~0 39)} is VALID [2022-04-15 15:14:44,879 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 39)} is VALID [2022-04-15 15:14:44,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {70177#true} call ULTIMATE.init(); {70177#true} is VALID [2022-04-15 15:14:44,879 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-15 15:14:44,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540481653] [2022-04-15 15:14:44,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:44,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457645277] [2022-04-15 15:14:44,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457645277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:44,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:14:44,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:44,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955575655] [2022-04-15 15:14:44,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955575655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:44,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:44,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:14:44,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226042746] [2022-04-15 15:14:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:44,880 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-15 15:14:44,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:44,881 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-15 15:14:44,976 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-15 15:14:44,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:14:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:44,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:14:44,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:14:44,977 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-15 15:14:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:47,494 INFO L93 Difference]: Finished difference Result 791 states and 1114 transitions. [2022-04-15 15:14:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:14:47,495 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-15 15:14:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:47,495 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-15 15:14:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:14:47,497 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-15 15:14:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:14:47,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-15 15:14:47,706 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-15 15:14:47,721 INFO L225 Difference]: With dead ends: 791 [2022-04-15 15:14:47,721 INFO L226 Difference]: Without dead ends: 594 [2022-04-15 15:14:47,722 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-15 15:14:47,722 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-15 15:14:47,722 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-15 15:14:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-04-15 15:14:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-04-15 15:14:49,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:49,486 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-15 15:14:49,486 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-15 15:14:49,486 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-15 15:14:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:49,499 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-15 15:14:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-15 15:14:49,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:49,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:49,500 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-15 15:14:49,500 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-15 15:14:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:49,518 INFO L93 Difference]: Finished difference Result 594 states and 806 transitions. [2022-04-15 15:14:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-15 15:14:49,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:49,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:49,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:49,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:49,520 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-15 15:14:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 806 transitions. [2022-04-15 15:14:49,544 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 806 transitions. Word has length 115 [2022-04-15 15:14:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:49,544 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 806 transitions. [2022-04-15 15:14:49,544 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-15 15:14:49,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 806 transitions. [2022-04-15 15:14:51,662 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-15 15:14:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 806 transitions. [2022-04-15 15:14:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 15:14:51,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:51,663 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-15 15:14:51,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:51,864 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-15 15:14:51,864 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-15 15:14:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620213509] [2022-04-15 15:14:51,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-15 15:14:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255367372] [2022-04-15 15:14:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:51,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:51,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450386580] [2022-04-15 15:14:51,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:51,877 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-15 15:14:51,877 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-15 15:14:51,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:51,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:51,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:14:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:51,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:52,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {74872#true} call ULTIMATE.init(); {74872#true} is VALID [2022-04-15 15:14:52,606 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-15 15:14:52,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74880#(<= ~counter~0 0)} {74872#true} #102#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {74880#(<= ~counter~0 0)} call #t~ret9 := main(); {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,607 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-15 15:14:52,608 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-15 15:14:52,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {74880#(<= ~counter~0 0)} ~cond := #in~cond; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {74880#(<= ~counter~0 0)} assume !(0 == ~cond); {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74880#(<= ~counter~0 0)} {74880#(<= ~counter~0 0)} #90#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,609 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-15 15:14:52,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {74880#(<= ~counter~0 0)} ~cond := #in~cond; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {74880#(<= ~counter~0 0)} assume !(0 == ~cond); {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {74880#(<= ~counter~0 0)} assume true; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74880#(<= ~counter~0 0)} {74880#(<= ~counter~0 0)} #92#return; {74880#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:52,611 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-15 15:14:52,612 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-15 15:14:52,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {74929#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,613 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-15 15:14:52,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {74929#(<= ~counter~0 1)} ~cond := #in~cond; {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {74929#(<= ~counter~0 1)} assume !(0 == ~cond); {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {74929#(<= ~counter~0 1)} assume true; {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,614 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74929#(<= ~counter~0 1)} {74929#(<= ~counter~0 1)} #94#return; {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {74929#(<= ~counter~0 1)} assume !!(0 != ~r~0); {74929#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:52,616 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-15 15:14:52,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {74954#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,616 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-15 15:14:52,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {74954#(<= ~counter~0 2)} ~cond := #in~cond; {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {74954#(<= ~counter~0 2)} assume !(0 == ~cond); {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {74954#(<= ~counter~0 2)} assume true; {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,618 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74954#(<= ~counter~0 2)} {74954#(<= ~counter~0 2)} #96#return; {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {74954#(<= ~counter~0 2)} assume !(~r~0 > 0); {74954#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:52,619 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-15 15:14:52,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {74979#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {74979#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:52,619 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-15 15:14:52,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {74979#(<= ~counter~0 3)} ~cond := #in~cond; {74979#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:52,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {74979#(<= ~counter~0 3)} assume !(0 == ~cond); {74979#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:52,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {74979#(<= ~counter~0 3)} assume true; {74979#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:52,621 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74979#(<= ~counter~0 3)} {74979#(<= ~counter~0 3)} #98#return; {74979#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:52,621 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-15 15:14:52,622 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-15 15:14:52,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {75004#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,622 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-15 15:14:52,623 INFO L290 TraceCheckUtils]: 44: Hoare triple {75004#(<= ~counter~0 4)} ~cond := #in~cond; {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {75004#(<= ~counter~0 4)} assume !(0 == ~cond); {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {75004#(<= ~counter~0 4)} assume true; {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,624 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75004#(<= ~counter~0 4)} {75004#(<= ~counter~0 4)} #98#return; {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {75004#(<= ~counter~0 4)} assume !(~r~0 < 0); {75004#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:52,625 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-15 15:14:52,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {75029#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,626 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-15 15:14:52,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {75029#(<= ~counter~0 5)} ~cond := #in~cond; {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {75029#(<= ~counter~0 5)} assume !(0 == ~cond); {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {75029#(<= ~counter~0 5)} assume true; {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,627 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75029#(<= ~counter~0 5)} {75029#(<= ~counter~0 5)} #94#return; {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {75029#(<= ~counter~0 5)} assume !!(0 != ~r~0); {75029#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:52,628 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-15 15:14:52,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {75054#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {75054#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:52,629 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-15 15:14:52,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {75054#(<= ~counter~0 6)} ~cond := #in~cond; {75054#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:52,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {75054#(<= ~counter~0 6)} assume !(0 == ~cond); {75054#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:52,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {75054#(<= ~counter~0 6)} assume true; {75054#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:52,630 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75054#(<= ~counter~0 6)} {75054#(<= ~counter~0 6)} #96#return; {75054#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:52,630 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-15 15:14:52,631 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-15 15:14:52,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {75079#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {75079#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:52,639 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-15 15:14:52,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {75079#(<= ~counter~0 7)} ~cond := #in~cond; {75079#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:52,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {75079#(<= ~counter~0 7)} assume !(0 == ~cond); {75079#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:52,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {75079#(<= ~counter~0 7)} assume true; {75079#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:52,641 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75079#(<= ~counter~0 7)} {75079#(<= ~counter~0 7)} #96#return; {75079#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:52,641 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-15 15:14:52,643 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-15 15:14:52,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {75104#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {75104#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:52,644 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-15 15:14:52,644 INFO L290 TraceCheckUtils]: 76: Hoare triple {75104#(<= ~counter~0 8)} ~cond := #in~cond; {75104#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:52,644 INFO L290 TraceCheckUtils]: 77: Hoare triple {75104#(<= ~counter~0 8)} assume !(0 == ~cond); {75104#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:52,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {75104#(<= ~counter~0 8)} assume true; {75104#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:52,645 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75104#(<= ~counter~0 8)} {75104#(<= ~counter~0 8)} #96#return; {75104#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:52,646 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-15 15:14:52,647 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-15 15:14:52,647 INFO L290 TraceCheckUtils]: 82: Hoare triple {75129#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {75129#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:52,648 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-15 15:14:52,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {75129#(<= ~counter~0 9)} ~cond := #in~cond; {75129#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:52,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {75129#(<= ~counter~0 9)} assume !(0 == ~cond); {75129#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:52,649 INFO L290 TraceCheckUtils]: 86: Hoare triple {75129#(<= ~counter~0 9)} assume true; {75129#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:52,649 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75129#(<= ~counter~0 9)} {75129#(<= ~counter~0 9)} #96#return; {75129#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:52,649 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-15 15:14:52,650 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-15 15:14:52,651 INFO L290 TraceCheckUtils]: 90: Hoare triple {75154#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,651 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-15 15:14:52,651 INFO L290 TraceCheckUtils]: 92: Hoare triple {75154#(<= ~counter~0 10)} ~cond := #in~cond; {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {75154#(<= ~counter~0 10)} assume !(0 == ~cond); {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,652 INFO L290 TraceCheckUtils]: 94: Hoare triple {75154#(<= ~counter~0 10)} assume true; {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,652 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75154#(<= ~counter~0 10)} {75154#(<= ~counter~0 10)} #96#return; {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,653 INFO L290 TraceCheckUtils]: 96: Hoare triple {75154#(<= ~counter~0 10)} assume !(~r~0 > 0); {75154#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:52,653 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-15 15:14:52,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {75179#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {75179#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:52,654 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-15 15:14:52,654 INFO L290 TraceCheckUtils]: 100: Hoare triple {75179#(<= ~counter~0 11)} ~cond := #in~cond; {75179#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:52,655 INFO L290 TraceCheckUtils]: 101: Hoare triple {75179#(<= ~counter~0 11)} assume !(0 == ~cond); {75179#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:52,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {75179#(<= ~counter~0 11)} assume true; {75179#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:52,655 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75179#(<= ~counter~0 11)} {75179#(<= ~counter~0 11)} #98#return; {75179#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:52,656 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-15 15:14:52,657 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-15 15:14:52,657 INFO L290 TraceCheckUtils]: 106: Hoare triple {75204#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,658 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-15 15:14:52,658 INFO L290 TraceCheckUtils]: 108: Hoare triple {75204#(<= ~counter~0 12)} ~cond := #in~cond; {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,658 INFO L290 TraceCheckUtils]: 109: Hoare triple {75204#(<= ~counter~0 12)} assume !(0 == ~cond); {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,659 INFO L290 TraceCheckUtils]: 110: Hoare triple {75204#(<= ~counter~0 12)} assume true; {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,659 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {75204#(<= ~counter~0 12)} {75204#(<= ~counter~0 12)} #98#return; {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,659 INFO L290 TraceCheckUtils]: 112: Hoare triple {75204#(<= ~counter~0 12)} assume !(~r~0 < 0); {75204#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:52,660 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-15 15:14:52,660 INFO L290 TraceCheckUtils]: 114: Hoare triple {75229#(<= |main_#t~post6| 12)} assume !(#t~post6 < 50);havoc #t~post6; {74873#false} is VALID [2022-04-15 15:14:52,660 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-15 15:14:52,660 INFO L290 TraceCheckUtils]: 116: Hoare triple {74873#false} ~cond := #in~cond; {74873#false} is VALID [2022-04-15 15:14:52,660 INFO L290 TraceCheckUtils]: 117: Hoare triple {74873#false} assume 0 == ~cond; {74873#false} is VALID [2022-04-15 15:14:52,660 INFO L290 TraceCheckUtils]: 118: Hoare triple {74873#false} assume !false; {74873#false} is VALID [2022-04-15 15:14:52,661 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-15 15:14:52,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:53,391 INFO L290 TraceCheckUtils]: 118: Hoare triple {74873#false} assume !false; {74873#false} is VALID [2022-04-15 15:14:53,391 INFO L290 TraceCheckUtils]: 117: Hoare triple {74873#false} assume 0 == ~cond; {74873#false} is VALID [2022-04-15 15:14:53,391 INFO L290 TraceCheckUtils]: 116: Hoare triple {74873#false} ~cond := #in~cond; {74873#false} is VALID [2022-04-15 15:14:53,391 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-15 15:14:53,395 INFO L290 TraceCheckUtils]: 114: Hoare triple {75257#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {74873#false} is VALID [2022-04-15 15:14:53,396 INFO L290 TraceCheckUtils]: 113: Hoare triple {75261#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75257#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:14:53,396 INFO L290 TraceCheckUtils]: 112: Hoare triple {75261#(< ~counter~0 50)} assume !(~r~0 < 0); {75261#(< ~counter~0 50)} is VALID [2022-04-15 15:14:53,397 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {74872#true} {75261#(< ~counter~0 50)} #98#return; {75261#(< ~counter~0 50)} is VALID [2022-04-15 15:14:53,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,397 INFO L290 TraceCheckUtils]: 109: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,397 INFO L290 TraceCheckUtils]: 108: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,397 INFO L272 TraceCheckUtils]: 107: Hoare triple {75261#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:14:53,398 INFO L290 TraceCheckUtils]: 106: Hoare triple {75261#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {75261#(< ~counter~0 50)} is VALID [2022-04-15 15:14:53,399 INFO L290 TraceCheckUtils]: 105: Hoare triple {75286#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75261#(< ~counter~0 50)} is VALID [2022-04-15 15:14:53,400 INFO L290 TraceCheckUtils]: 104: Hoare triple {75286#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75286#(< ~counter~0 49)} is VALID [2022-04-15 15:14:53,400 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74872#true} {75286#(< ~counter~0 49)} #98#return; {75286#(< ~counter~0 49)} is VALID [2022-04-15 15:14:53,400 INFO L290 TraceCheckUtils]: 102: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,401 INFO L290 TraceCheckUtils]: 101: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,419 INFO L272 TraceCheckUtils]: 99: Hoare triple {75286#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:14:53,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {75286#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {75286#(< ~counter~0 49)} is VALID [2022-04-15 15:14:53,422 INFO L290 TraceCheckUtils]: 97: Hoare triple {75311#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75286#(< ~counter~0 49)} is VALID [2022-04-15 15:14:53,423 INFO L290 TraceCheckUtils]: 96: Hoare triple {75311#(< ~counter~0 48)} assume !(~r~0 > 0); {75311#(< ~counter~0 48)} is VALID [2022-04-15 15:14:53,424 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74872#true} {75311#(< ~counter~0 48)} #96#return; {75311#(< ~counter~0 48)} is VALID [2022-04-15 15:14:53,424 INFO L290 TraceCheckUtils]: 94: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,424 INFO L290 TraceCheckUtils]: 93: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,424 INFO L290 TraceCheckUtils]: 92: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,424 INFO L272 TraceCheckUtils]: 91: Hoare triple {75311#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:14:53,424 INFO L290 TraceCheckUtils]: 90: Hoare triple {75311#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {75311#(< ~counter~0 48)} is VALID [2022-04-15 15:14:53,425 INFO L290 TraceCheckUtils]: 89: Hoare triple {75336#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75311#(< ~counter~0 48)} is VALID [2022-04-15 15:14:53,425 INFO L290 TraceCheckUtils]: 88: Hoare triple {75336#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75336#(< ~counter~0 47)} is VALID [2022-04-15 15:14:53,426 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74872#true} {75336#(< ~counter~0 47)} #96#return; {75336#(< ~counter~0 47)} is VALID [2022-04-15 15:14:53,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,426 INFO L272 TraceCheckUtils]: 83: Hoare triple {75336#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:14:53,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {75336#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {75336#(< ~counter~0 47)} is VALID [2022-04-15 15:14:53,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {75361#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75336#(< ~counter~0 47)} is VALID [2022-04-15 15:14:53,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {75361#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75361#(< ~counter~0 46)} is VALID [2022-04-15 15:14:53,428 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74872#true} {75361#(< ~counter~0 46)} #96#return; {75361#(< ~counter~0 46)} is VALID [2022-04-15 15:14:53,428 INFO L290 TraceCheckUtils]: 78: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,429 INFO L272 TraceCheckUtils]: 75: Hoare triple {75361#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:14:53,429 INFO L290 TraceCheckUtils]: 74: Hoare triple {75361#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {75361#(< ~counter~0 46)} is VALID [2022-04-15 15:14:53,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {75386#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75361#(< ~counter~0 46)} is VALID [2022-04-15 15:14:53,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {75386#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75386#(< ~counter~0 45)} is VALID [2022-04-15 15:14:53,431 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74872#true} {75386#(< ~counter~0 45)} #96#return; {75386#(< ~counter~0 45)} is VALID [2022-04-15 15:14:53,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,431 INFO L272 TraceCheckUtils]: 67: Hoare triple {75386#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:14:53,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {75386#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {75386#(< ~counter~0 45)} is VALID [2022-04-15 15:14:53,432 INFO L290 TraceCheckUtils]: 65: Hoare triple {75411#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75386#(< ~counter~0 45)} is VALID [2022-04-15 15:14:53,432 INFO L290 TraceCheckUtils]: 64: Hoare triple {75411#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75411#(< ~counter~0 44)} is VALID [2022-04-15 15:14:53,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74872#true} {75411#(< ~counter~0 44)} #96#return; {75411#(< ~counter~0 44)} is VALID [2022-04-15 15:14:53,433 INFO L290 TraceCheckUtils]: 62: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,433 INFO L272 TraceCheckUtils]: 59: Hoare triple {75411#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:14:53,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {75411#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {75411#(< ~counter~0 44)} is VALID [2022-04-15 15:14:53,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {75436#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75411#(< ~counter~0 44)} is VALID [2022-04-15 15:14:53,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {75436#(< ~counter~0 43)} assume !!(0 != ~r~0); {75436#(< ~counter~0 43)} is VALID [2022-04-15 15:14:53,435 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74872#true} {75436#(< ~counter~0 43)} #94#return; {75436#(< ~counter~0 43)} is VALID [2022-04-15 15:14:53,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,436 INFO L272 TraceCheckUtils]: 51: Hoare triple {75436#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:14:53,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {75436#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {75436#(< ~counter~0 43)} is VALID [2022-04-15 15:14:53,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {75461#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75436#(< ~counter~0 43)} is VALID [2022-04-15 15:14:53,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {75461#(< ~counter~0 42)} assume !(~r~0 < 0); {75461#(< ~counter~0 42)} is VALID [2022-04-15 15:14:53,438 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74872#true} {75461#(< ~counter~0 42)} #98#return; {75461#(< ~counter~0 42)} is VALID [2022-04-15 15:14:53,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,438 INFO L272 TraceCheckUtils]: 43: Hoare triple {75461#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:14:53,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {75461#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {75461#(< ~counter~0 42)} is VALID [2022-04-15 15:14:53,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {75486#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75461#(< ~counter~0 42)} is VALID [2022-04-15 15:14:53,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {75486#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75486#(< ~counter~0 41)} is VALID [2022-04-15 15:14:53,440 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74872#true} {75486#(< ~counter~0 41)} #98#return; {75486#(< ~counter~0 41)} is VALID [2022-04-15 15:14:53,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,441 INFO L272 TraceCheckUtils]: 35: Hoare triple {75486#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:14:53,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {75486#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {75486#(< ~counter~0 41)} is VALID [2022-04-15 15:14:53,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {75511#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75486#(< ~counter~0 41)} is VALID [2022-04-15 15:14:53,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {75511#(< ~counter~0 40)} assume !(~r~0 > 0); {75511#(< ~counter~0 40)} is VALID [2022-04-15 15:14:53,443 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74872#true} {75511#(< ~counter~0 40)} #96#return; {75511#(< ~counter~0 40)} is VALID [2022-04-15 15:14:53,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,443 INFO L272 TraceCheckUtils]: 27: Hoare triple {75511#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:14:53,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {75511#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {75511#(< ~counter~0 40)} is VALID [2022-04-15 15:14:53,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {75536#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75511#(< ~counter~0 40)} is VALID [2022-04-15 15:14:53,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {75536#(< ~counter~0 39)} assume !!(0 != ~r~0); {75536#(< ~counter~0 39)} is VALID [2022-04-15 15:14:53,445 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74872#true} {75536#(< ~counter~0 39)} #94#return; {75536#(< ~counter~0 39)} is VALID [2022-04-15 15:14:53,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,446 INFO L272 TraceCheckUtils]: 19: Hoare triple {75536#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:14:53,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {75536#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {75536#(< ~counter~0 39)} is VALID [2022-04-15 15:14:53,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {75561#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75536#(< ~counter~0 39)} is VALID [2022-04-15 15:14:53,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {75561#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74872#true} {75561#(< ~counter~0 38)} #92#return; {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,448 INFO L272 TraceCheckUtils]: 11: Hoare triple {75561#(< ~counter~0 38)} call assume_abort_if_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-15 15:14:53,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74872#true} {75561#(< ~counter~0 38)} #90#return; {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {74872#true} assume true; {74872#true} is VALID [2022-04-15 15:14:53,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {74872#true} assume !(0 == ~cond); {74872#true} is VALID [2022-04-15 15:14:53,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {74872#true} ~cond := #in~cond; {74872#true} is VALID [2022-04-15 15:14:53,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {75561#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74872#true} is VALID [2022-04-15 15:14:53,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {75561#(< ~counter~0 38)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 38)} is VALID [2022-04-15 15:14:53,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {75561#(< ~counter~0 38)} call #t~ret9 := main(); {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75561#(< ~counter~0 38)} {74872#true} #102#return; {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {75561#(< ~counter~0 38)} assume true; {75561#(< ~counter~0 38)} is VALID [2022-04-15 15:14:53,450 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 38)} is VALID [2022-04-15 15:14:53,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {74872#true} call ULTIMATE.init(); {74872#true} is VALID [2022-04-15 15:14:53,451 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-15 15:14:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255367372] [2022-04-15 15:14:53,451 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450386580] [2022-04-15 15:14:53,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450386580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:53,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:53,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:14:53,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620213509] [2022-04-15 15:14:53,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620213509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:53,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:53,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:14:53,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644856972] [2022-04-15 15:14:53,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:53,453 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-15 15:14:53,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:53,453 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-15 15:14:53,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:53,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:14:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:14:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:14:53,547 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-15 15:14:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:56,547 INFO L93 Difference]: Finished difference Result 649 states and 883 transitions. [2022-04-15 15:14:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:14:56,547 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-15 15:14:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:56,548 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-15 15:14:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:14:56,549 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-15 15:14:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:14:56,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-15 15:14:56,761 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-15 15:14:56,777 INFO L225 Difference]: With dead ends: 649 [2022-04-15 15:14:56,777 INFO L226 Difference]: Without dead ends: 638 [2022-04-15 15:14:56,778 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-15 15:14:56,778 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 227 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:56,778 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.4s Time] [2022-04-15 15:14:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-04-15 15:14:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 616. [2022-04-15 15:14:58,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:58,555 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-15 15:14:58,555 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-15 15:14:58,555 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-15 15:14:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:58,576 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-15 15:14:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-15 15:14:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:58,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:58,577 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-15 15:14:58,577 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-15 15:14:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:58,592 INFO L93 Difference]: Finished difference Result 638 states and 867 transitions. [2022-04-15 15:14:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 867 transitions. [2022-04-15 15:14:58,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:58,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:58,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:58,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:58,593 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-15 15:14:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 841 transitions. [2022-04-15 15:14:58,611 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 841 transitions. Word has length 119 [2022-04-15 15:14:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:58,612 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 841 transitions. [2022-04-15 15:14:58,612 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-15 15:14:58,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 616 states and 841 transitions. [2022-04-15 15:15:02,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 841 edges. 840 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 841 transitions. [2022-04-15 15:15:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 15:15:02,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:02,006 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-15 15:15:02,022 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-15 15:15:02,206 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-15 15:15:02,206 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-15 15:15:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569933206] [2022-04-15 15:15:02,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-15 15:15:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738284099] [2022-04-15 15:15:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:02,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:02,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:02,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609861319] [2022-04-15 15:15:02,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:15:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:02,225 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-15 15:15:02,225 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-15 15:15:02,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 15:15:02,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:02,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:15:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:02,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:03,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {79439#true} call ULTIMATE.init(); {79439#true} is VALID [2022-04-15 15:15:03,605 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-15 15:15:03,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79447#(<= ~counter~0 0)} {79439#true} #102#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {79447#(<= ~counter~0 0)} call #t~ret9 := main(); {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,606 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-15 15:15:03,607 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-15 15:15:03,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {79447#(<= ~counter~0 0)} ~cond := #in~cond; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {79447#(<= ~counter~0 0)} assume !(0 == ~cond); {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79447#(<= ~counter~0 0)} {79447#(<= ~counter~0 0)} #90#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,608 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-15 15:15:03,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {79447#(<= ~counter~0 0)} ~cond := #in~cond; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {79447#(<= ~counter~0 0)} assume !(0 == ~cond); {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {79447#(<= ~counter~0 0)} assume true; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79447#(<= ~counter~0 0)} {79447#(<= ~counter~0 0)} #92#return; {79447#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:03,610 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-15 15:15:03,611 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-15 15:15:03,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {79496#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,612 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-15 15:15:03,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {79496#(<= ~counter~0 1)} ~cond := #in~cond; {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {79496#(<= ~counter~0 1)} assume !(0 == ~cond); {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {79496#(<= ~counter~0 1)} assume true; {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,613 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79496#(<= ~counter~0 1)} {79496#(<= ~counter~0 1)} #94#return; {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {79496#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79496#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:03,615 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-15 15:15:03,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {79521#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,615 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-15 15:15:03,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {79521#(<= ~counter~0 2)} ~cond := #in~cond; {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {79521#(<= ~counter~0 2)} assume !(0 == ~cond); {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {79521#(<= ~counter~0 2)} assume true; {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,617 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79521#(<= ~counter~0 2)} {79521#(<= ~counter~0 2)} #96#return; {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {79521#(<= ~counter~0 2)} assume !(~r~0 > 0); {79521#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:03,618 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-15 15:15:03,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {79546#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {79546#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:03,619 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-15 15:15:03,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {79546#(<= ~counter~0 3)} ~cond := #in~cond; {79546#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:03,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {79546#(<= ~counter~0 3)} assume !(0 == ~cond); {79546#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:03,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {79546#(<= ~counter~0 3)} assume true; {79546#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:03,620 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79546#(<= ~counter~0 3)} {79546#(<= ~counter~0 3)} #98#return; {79546#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:03,620 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-15 15:15:03,621 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-15 15:15:03,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {79571#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,622 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-15 15:15:03,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {79571#(<= ~counter~0 4)} ~cond := #in~cond; {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {79571#(<= ~counter~0 4)} assume !(0 == ~cond); {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {79571#(<= ~counter~0 4)} assume true; {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,623 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79571#(<= ~counter~0 4)} {79571#(<= ~counter~0 4)} #98#return; {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,623 INFO L290 TraceCheckUtils]: 48: Hoare triple {79571#(<= ~counter~0 4)} assume !(~r~0 < 0); {79571#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:03,624 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-15 15:15:03,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {79596#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,625 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-15 15:15:03,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {79596#(<= ~counter~0 5)} ~cond := #in~cond; {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {79596#(<= ~counter~0 5)} assume !(0 == ~cond); {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {79596#(<= ~counter~0 5)} assume true; {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,626 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79596#(<= ~counter~0 5)} {79596#(<= ~counter~0 5)} #94#return; {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {79596#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79596#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:03,628 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-15 15:15:03,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {79621#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {79621#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:03,628 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-15 15:15:03,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {79621#(<= ~counter~0 6)} ~cond := #in~cond; {79621#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:03,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {79621#(<= ~counter~0 6)} assume !(0 == ~cond); {79621#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:03,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {79621#(<= ~counter~0 6)} assume true; {79621#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:03,630 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79621#(<= ~counter~0 6)} {79621#(<= ~counter~0 6)} #96#return; {79621#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:03,630 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-15 15:15:03,631 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-15 15:15:03,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {79646#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {79646#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:03,632 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-15 15:15:03,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {79646#(<= ~counter~0 7)} ~cond := #in~cond; {79646#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:03,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {79646#(<= ~counter~0 7)} assume !(0 == ~cond); {79646#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:03,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {79646#(<= ~counter~0 7)} assume true; {79646#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:03,633 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79646#(<= ~counter~0 7)} {79646#(<= ~counter~0 7)} #96#return; {79646#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:03,633 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-15 15:15:03,634 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-15 15:15:03,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {79671#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {79671#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:03,635 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-15 15:15:03,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {79671#(<= ~counter~0 8)} ~cond := #in~cond; {79671#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:03,636 INFO L290 TraceCheckUtils]: 77: Hoare triple {79671#(<= ~counter~0 8)} assume !(0 == ~cond); {79671#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:03,636 INFO L290 TraceCheckUtils]: 78: Hoare triple {79671#(<= ~counter~0 8)} assume true; {79671#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:03,636 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79671#(<= ~counter~0 8)} {79671#(<= ~counter~0 8)} #96#return; {79671#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:03,637 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-15 15:15:03,637 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-15 15:15:03,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {79696#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {79696#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:03,638 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-15 15:15:03,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {79696#(<= ~counter~0 9)} ~cond := #in~cond; {79696#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:03,639 INFO L290 TraceCheckUtils]: 85: Hoare triple {79696#(<= ~counter~0 9)} assume !(0 == ~cond); {79696#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:03,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {79696#(<= ~counter~0 9)} assume true; {79696#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:03,640 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79696#(<= ~counter~0 9)} {79696#(<= ~counter~0 9)} #96#return; {79696#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:03,640 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-15 15:15:03,641 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-15 15:15:03,641 INFO L290 TraceCheckUtils]: 90: Hoare triple {79721#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {79721#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:03,642 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-15 15:15:03,642 INFO L290 TraceCheckUtils]: 92: Hoare triple {79721#(<= ~counter~0 10)} ~cond := #in~cond; {79721#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:03,642 INFO L290 TraceCheckUtils]: 93: Hoare triple {79721#(<= ~counter~0 10)} assume !(0 == ~cond); {79721#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:03,642 INFO L290 TraceCheckUtils]: 94: Hoare triple {79721#(<= ~counter~0 10)} assume true; {79721#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:03,643 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79721#(<= ~counter~0 10)} {79721#(<= ~counter~0 10)} #96#return; {79721#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:03,643 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-15 15:15:03,644 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-15 15:15:03,644 INFO L290 TraceCheckUtils]: 98: Hoare triple {79746#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,645 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-15 15:15:03,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {79746#(<= ~counter~0 11)} ~cond := #in~cond; {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,645 INFO L290 TraceCheckUtils]: 101: Hoare triple {79746#(<= ~counter~0 11)} assume !(0 == ~cond); {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,646 INFO L290 TraceCheckUtils]: 102: Hoare triple {79746#(<= ~counter~0 11)} assume true; {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,646 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79746#(<= ~counter~0 11)} {79746#(<= ~counter~0 11)} #96#return; {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,646 INFO L290 TraceCheckUtils]: 104: Hoare triple {79746#(<= ~counter~0 11)} assume !(~r~0 > 0); {79746#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:03,647 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-15 15:15:03,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {79771#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {79771#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:03,648 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-15 15:15:03,648 INFO L290 TraceCheckUtils]: 108: Hoare triple {79771#(<= ~counter~0 12)} ~cond := #in~cond; {79771#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:03,649 INFO L290 TraceCheckUtils]: 109: Hoare triple {79771#(<= ~counter~0 12)} assume !(0 == ~cond); {79771#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:03,649 INFO L290 TraceCheckUtils]: 110: Hoare triple {79771#(<= ~counter~0 12)} assume true; {79771#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:03,649 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79771#(<= ~counter~0 12)} {79771#(<= ~counter~0 12)} #98#return; {79771#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:03,650 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-15 15:15:03,650 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-15 15:15:03,650 INFO L290 TraceCheckUtils]: 114: Hoare triple {79796#(<= |main_#t~post8| 12)} assume !(#t~post8 < 50);havoc #t~post8; {79440#false} is VALID [2022-04-15 15:15:03,650 INFO L290 TraceCheckUtils]: 115: Hoare triple {79440#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79440#false} is VALID [2022-04-15 15:15:03,651 INFO L290 TraceCheckUtils]: 116: Hoare triple {79440#false} assume !(#t~post6 < 50);havoc #t~post6; {79440#false} is VALID [2022-04-15 15:15:03,651 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-15 15:15:03,651 INFO L290 TraceCheckUtils]: 118: Hoare triple {79440#false} ~cond := #in~cond; {79440#false} is VALID [2022-04-15 15:15:03,651 INFO L290 TraceCheckUtils]: 119: Hoare triple {79440#false} assume 0 == ~cond; {79440#false} is VALID [2022-04-15 15:15:03,651 INFO L290 TraceCheckUtils]: 120: Hoare triple {79440#false} assume !false; {79440#false} is VALID [2022-04-15 15:15:03,651 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-15 15:15:03,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:04,315 INFO L290 TraceCheckUtils]: 120: Hoare triple {79440#false} assume !false; {79440#false} is VALID [2022-04-15 15:15:04,315 INFO L290 TraceCheckUtils]: 119: Hoare triple {79440#false} assume 0 == ~cond; {79440#false} is VALID [2022-04-15 15:15:04,315 INFO L290 TraceCheckUtils]: 118: Hoare triple {79440#false} ~cond := #in~cond; {79440#false} is VALID [2022-04-15 15:15:04,315 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-15 15:15:04,315 INFO L290 TraceCheckUtils]: 116: Hoare triple {79440#false} assume !(#t~post6 < 50);havoc #t~post6; {79440#false} is VALID [2022-04-15 15:15:04,315 INFO L290 TraceCheckUtils]: 115: Hoare triple {79440#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79440#false} is VALID [2022-04-15 15:15:04,315 INFO L290 TraceCheckUtils]: 114: Hoare triple {79836#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {79440#false} is VALID [2022-04-15 15:15:04,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {79840#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79836#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:15:04,316 INFO L290 TraceCheckUtils]: 112: Hoare triple {79840#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79840#(< ~counter~0 50)} is VALID [2022-04-15 15:15:04,317 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79439#true} {79840#(< ~counter~0 50)} #98#return; {79840#(< ~counter~0 50)} is VALID [2022-04-15 15:15:04,317 INFO L290 TraceCheckUtils]: 110: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,317 INFO L290 TraceCheckUtils]: 109: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,317 INFO L290 TraceCheckUtils]: 108: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,317 INFO L272 TraceCheckUtils]: 107: Hoare triple {79840#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:15:04,317 INFO L290 TraceCheckUtils]: 106: Hoare triple {79840#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {79840#(< ~counter~0 50)} is VALID [2022-04-15 15:15:04,319 INFO L290 TraceCheckUtils]: 105: Hoare triple {79865#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79840#(< ~counter~0 50)} is VALID [2022-04-15 15:15:04,319 INFO L290 TraceCheckUtils]: 104: Hoare triple {79865#(< ~counter~0 49)} assume !(~r~0 > 0); {79865#(< ~counter~0 49)} is VALID [2022-04-15 15:15:04,320 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79439#true} {79865#(< ~counter~0 49)} #96#return; {79865#(< ~counter~0 49)} is VALID [2022-04-15 15:15:04,320 INFO L290 TraceCheckUtils]: 102: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,320 INFO L290 TraceCheckUtils]: 101: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,320 INFO L290 TraceCheckUtils]: 100: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,320 INFO L272 TraceCheckUtils]: 99: Hoare triple {79865#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:15:04,320 INFO L290 TraceCheckUtils]: 98: Hoare triple {79865#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {79865#(< ~counter~0 49)} is VALID [2022-04-15 15:15:04,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {79890#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79865#(< ~counter~0 49)} is VALID [2022-04-15 15:15:04,321 INFO L290 TraceCheckUtils]: 96: Hoare triple {79890#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79890#(< ~counter~0 48)} is VALID [2022-04-15 15:15:04,322 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79439#true} {79890#(< ~counter~0 48)} #96#return; {79890#(< ~counter~0 48)} is VALID [2022-04-15 15:15:04,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,322 INFO L290 TraceCheckUtils]: 92: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,322 INFO L272 TraceCheckUtils]: 91: Hoare triple {79890#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:15:04,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {79890#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {79890#(< ~counter~0 48)} is VALID [2022-04-15 15:15:04,323 INFO L290 TraceCheckUtils]: 89: Hoare triple {79915#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79890#(< ~counter~0 48)} is VALID [2022-04-15 15:15:04,323 INFO L290 TraceCheckUtils]: 88: Hoare triple {79915#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79915#(< ~counter~0 47)} is VALID [2022-04-15 15:15:04,324 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79439#true} {79915#(< ~counter~0 47)} #96#return; {79915#(< ~counter~0 47)} is VALID [2022-04-15 15:15:04,324 INFO L290 TraceCheckUtils]: 86: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,324 INFO L290 TraceCheckUtils]: 85: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,324 INFO L272 TraceCheckUtils]: 83: Hoare triple {79915#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:15:04,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {79915#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {79915#(< ~counter~0 47)} is VALID [2022-04-15 15:15:04,325 INFO L290 TraceCheckUtils]: 81: Hoare triple {79940#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79915#(< ~counter~0 47)} is VALID [2022-04-15 15:15:04,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {79940#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79940#(< ~counter~0 46)} is VALID [2022-04-15 15:15:04,326 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79439#true} {79940#(< ~counter~0 46)} #96#return; {79940#(< ~counter~0 46)} is VALID [2022-04-15 15:15:04,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,326 INFO L272 TraceCheckUtils]: 75: Hoare triple {79940#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:15:04,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {79940#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {79940#(< ~counter~0 46)} is VALID [2022-04-15 15:15:04,327 INFO L290 TraceCheckUtils]: 73: Hoare triple {79965#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79940#(< ~counter~0 46)} is VALID [2022-04-15 15:15:04,328 INFO L290 TraceCheckUtils]: 72: Hoare triple {79965#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79965#(< ~counter~0 45)} is VALID [2022-04-15 15:15:04,328 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79439#true} {79965#(< ~counter~0 45)} #96#return; {79965#(< ~counter~0 45)} is VALID [2022-04-15 15:15:04,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,328 INFO L272 TraceCheckUtils]: 67: Hoare triple {79965#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:15:04,329 INFO L290 TraceCheckUtils]: 66: Hoare triple {79965#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {79965#(< ~counter~0 45)} is VALID [2022-04-15 15:15:04,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {79990#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79965#(< ~counter~0 45)} is VALID [2022-04-15 15:15:04,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {79990#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79990#(< ~counter~0 44)} is VALID [2022-04-15 15:15:04,330 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79439#true} {79990#(< ~counter~0 44)} #96#return; {79990#(< ~counter~0 44)} is VALID [2022-04-15 15:15:04,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,330 INFO L272 TraceCheckUtils]: 59: Hoare triple {79990#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:15:04,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {79990#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {79990#(< ~counter~0 44)} is VALID [2022-04-15 15:15:04,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {80015#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79990#(< ~counter~0 44)} is VALID [2022-04-15 15:15:04,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {80015#(< ~counter~0 43)} assume !!(0 != ~r~0); {80015#(< ~counter~0 43)} is VALID [2022-04-15 15:15:04,332 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79439#true} {80015#(< ~counter~0 43)} #94#return; {80015#(< ~counter~0 43)} is VALID [2022-04-15 15:15:04,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,332 INFO L272 TraceCheckUtils]: 51: Hoare triple {80015#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:15:04,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {80015#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {80015#(< ~counter~0 43)} is VALID [2022-04-15 15:15:04,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {80040#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80015#(< ~counter~0 43)} is VALID [2022-04-15 15:15:04,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {80040#(< ~counter~0 42)} assume !(~r~0 < 0); {80040#(< ~counter~0 42)} is VALID [2022-04-15 15:15:04,334 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79439#true} {80040#(< ~counter~0 42)} #98#return; {80040#(< ~counter~0 42)} is VALID [2022-04-15 15:15:04,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,335 INFO L272 TraceCheckUtils]: 43: Hoare triple {80040#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:15:04,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {80040#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {80040#(< ~counter~0 42)} is VALID [2022-04-15 15:15:04,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {80065#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80040#(< ~counter~0 42)} is VALID [2022-04-15 15:15:04,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {80065#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80065#(< ~counter~0 41)} is VALID [2022-04-15 15:15:04,336 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79439#true} {80065#(< ~counter~0 41)} #98#return; {80065#(< ~counter~0 41)} is VALID [2022-04-15 15:15:04,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,337 INFO L272 TraceCheckUtils]: 35: Hoare triple {80065#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:15:04,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {80065#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {80065#(< ~counter~0 41)} is VALID [2022-04-15 15:15:04,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {80090#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80065#(< ~counter~0 41)} is VALID [2022-04-15 15:15:04,338 INFO L290 TraceCheckUtils]: 32: Hoare triple {80090#(< ~counter~0 40)} assume !(~r~0 > 0); {80090#(< ~counter~0 40)} is VALID [2022-04-15 15:15:04,338 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79439#true} {80090#(< ~counter~0 40)} #96#return; {80090#(< ~counter~0 40)} is VALID [2022-04-15 15:15:04,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,339 INFO L272 TraceCheckUtils]: 27: Hoare triple {80090#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:15:04,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {80090#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {80090#(< ~counter~0 40)} is VALID [2022-04-15 15:15:04,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {80115#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80090#(< ~counter~0 40)} is VALID [2022-04-15 15:15:04,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {80115#(< ~counter~0 39)} assume !!(0 != ~r~0); {80115#(< ~counter~0 39)} is VALID [2022-04-15 15:15:04,340 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79439#true} {80115#(< ~counter~0 39)} #94#return; {80115#(< ~counter~0 39)} is VALID [2022-04-15 15:15:04,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {80115#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:15:04,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {80115#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {80115#(< ~counter~0 39)} is VALID [2022-04-15 15:15:04,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {80140#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80115#(< ~counter~0 39)} is VALID [2022-04-15 15:15:04,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {80140#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,342 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79439#true} {80140#(< ~counter~0 38)} #92#return; {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {80140#(< ~counter~0 38)} call assume_abort_if_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-15 15:15:04,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79439#true} {80140#(< ~counter~0 38)} #90#return; {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {79439#true} assume true; {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {79439#true} assume !(0 == ~cond); {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {79439#true} ~cond := #in~cond; {79439#true} is VALID [2022-04-15 15:15:04,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {80140#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79439#true} is VALID [2022-04-15 15:15:04,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {80140#(< ~counter~0 38)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 38)} is VALID [2022-04-15 15:15:04,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {80140#(< ~counter~0 38)} call #t~ret9 := main(); {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80140#(< ~counter~0 38)} {79439#true} #102#return; {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {80140#(< ~counter~0 38)} assume true; {80140#(< ~counter~0 38)} is VALID [2022-04-15 15:15:04,345 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 38)} is VALID [2022-04-15 15:15:04,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {79439#true} call ULTIMATE.init(); {79439#true} is VALID [2022-04-15 15:15:04,345 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-15 15:15:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738284099] [2022-04-15 15:15:04,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:04,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609861319] [2022-04-15 15:15:04,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609861319] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:04,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:04,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:15:04,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:04,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569933206] [2022-04-15 15:15:04,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569933206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:04,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:04,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:15:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514813240] [2022-04-15 15:15:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:04,347 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-15 15:15:04,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:04,347 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-15 15:15:04,442 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-15 15:15:04,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:15:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:04,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:15:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:15:04,443 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-15 15:15:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:07,329 INFO L93 Difference]: Finished difference Result 837 states and 1174 transitions. [2022-04-15 15:15:07,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 15:15:07,329 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-15 15:15:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:07,329 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-15 15:15:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:15:07,331 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-15 15:15:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:15:07,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-15 15:15:07,568 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-15 15:15:07,586 INFO L225 Difference]: With dead ends: 837 [2022-04-15 15:15:07,586 INFO L226 Difference]: Without dead ends: 644 [2022-04-15 15:15:07,587 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-15 15:15:07,587 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-15 15:15:07,587 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-15 15:15:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-04-15 15:15:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 634. [2022-04-15 15:15:09,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:09,438 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-15 15:15:09,438 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-15 15:15:09,438 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-15 15:15:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:09,454 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-15 15:15:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-15 15:15:09,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:09,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:09,455 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-15 15:15:09,455 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-15 15:15:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:09,469 INFO L93 Difference]: Finished difference Result 644 states and 873 transitions. [2022-04-15 15:15:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2022-04-15 15:15:09,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:09,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:09,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:09,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:09,471 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-15 15:15:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 863 transitions. [2022-04-15 15:15:09,489 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 863 transitions. Word has length 121 [2022-04-15 15:15:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:09,490 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 863 transitions. [2022-04-15 15:15:09,490 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-15 15:15:09,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 863 transitions. [2022-04-15 15:15:11,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 863 edges. 863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 863 transitions. [2022-04-15 15:15:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 15:15:11,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:11,782 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-15 15:15:11,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:11,983 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-15 15:15:11,983 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-15 15:15:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036773473] [2022-04-15 15:15:11,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-15 15:15:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799060913] [2022-04-15 15:15:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:11,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:11,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200869655] [2022-04-15 15:15:11,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:15:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:11,997 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-15 15:15:12,019 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-15 15:15:12,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:15:12,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:12,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:15:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:12,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:12,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {84444#true} call ULTIMATE.init(); {84444#true} is VALID [2022-04-15 15:15:12,758 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-15 15:15:12,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84452#(<= ~counter~0 0)} {84444#true} #102#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {84452#(<= ~counter~0 0)} call #t~ret9 := main(); {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,759 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-15 15:15:12,760 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-15 15:15:12,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {84452#(<= ~counter~0 0)} ~cond := #in~cond; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {84452#(<= ~counter~0 0)} assume !(0 == ~cond); {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84452#(<= ~counter~0 0)} {84452#(<= ~counter~0 0)} #90#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,762 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-15 15:15:12,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {84452#(<= ~counter~0 0)} ~cond := #in~cond; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {84452#(<= ~counter~0 0)} assume !(0 == ~cond); {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {84452#(<= ~counter~0 0)} assume true; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84452#(<= ~counter~0 0)} {84452#(<= ~counter~0 0)} #92#return; {84452#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:12,763 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-15 15:15:12,765 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-15 15:15:12,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {84501#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,766 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-15 15:15:12,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {84501#(<= ~counter~0 1)} ~cond := #in~cond; {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {84501#(<= ~counter~0 1)} assume !(0 == ~cond); {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {84501#(<= ~counter~0 1)} assume true; {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,767 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84501#(<= ~counter~0 1)} {84501#(<= ~counter~0 1)} #94#return; {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {84501#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84501#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:12,768 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-15 15:15:12,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {84526#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,769 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-15 15:15:12,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {84526#(<= ~counter~0 2)} ~cond := #in~cond; {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {84526#(<= ~counter~0 2)} assume !(0 == ~cond); {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {84526#(<= ~counter~0 2)} assume true; {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,770 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84526#(<= ~counter~0 2)} {84526#(<= ~counter~0 2)} #96#return; {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {84526#(<= ~counter~0 2)} assume !(~r~0 > 0); {84526#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:12,771 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-15 15:15:12,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {84551#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {84551#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:12,772 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-15 15:15:12,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {84551#(<= ~counter~0 3)} ~cond := #in~cond; {84551#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:12,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {84551#(<= ~counter~0 3)} assume !(0 == ~cond); {84551#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:12,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {84551#(<= ~counter~0 3)} assume true; {84551#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:12,773 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84551#(<= ~counter~0 3)} {84551#(<= ~counter~0 3)} #98#return; {84551#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:12,773 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-15 15:15:12,774 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-15 15:15:12,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {84576#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,775 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-15 15:15:12,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {84576#(<= ~counter~0 4)} ~cond := #in~cond; {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {84576#(<= ~counter~0 4)} assume !(0 == ~cond); {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {84576#(<= ~counter~0 4)} assume true; {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,776 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84576#(<= ~counter~0 4)} {84576#(<= ~counter~0 4)} #98#return; {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {84576#(<= ~counter~0 4)} assume !(~r~0 < 0); {84576#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:12,777 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-15 15:15:12,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {84601#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,778 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-15 15:15:12,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {84601#(<= ~counter~0 5)} ~cond := #in~cond; {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {84601#(<= ~counter~0 5)} assume !(0 == ~cond); {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {84601#(<= ~counter~0 5)} assume true; {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,779 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84601#(<= ~counter~0 5)} {84601#(<= ~counter~0 5)} #94#return; {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {84601#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84601#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:12,780 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-15 15:15:12,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {84626#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {84626#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:12,781 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-15 15:15:12,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {84626#(<= ~counter~0 6)} ~cond := #in~cond; {84626#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:12,782 INFO L290 TraceCheckUtils]: 61: Hoare triple {84626#(<= ~counter~0 6)} assume !(0 == ~cond); {84626#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:12,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {84626#(<= ~counter~0 6)} assume true; {84626#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:12,782 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84626#(<= ~counter~0 6)} {84626#(<= ~counter~0 6)} #96#return; {84626#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:12,783 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-15 15:15:12,784 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-15 15:15:12,784 INFO L290 TraceCheckUtils]: 66: Hoare triple {84651#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {84651#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:12,784 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-15 15:15:12,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {84651#(<= ~counter~0 7)} ~cond := #in~cond; {84651#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:12,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {84651#(<= ~counter~0 7)} assume !(0 == ~cond); {84651#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:12,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {84651#(<= ~counter~0 7)} assume true; {84651#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:12,786 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84651#(<= ~counter~0 7)} {84651#(<= ~counter~0 7)} #96#return; {84651#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:12,786 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-15 15:15:12,787 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-15 15:15:12,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {84676#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,787 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-15 15:15:12,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {84676#(<= ~counter~0 8)} ~cond := #in~cond; {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {84676#(<= ~counter~0 8)} assume !(0 == ~cond); {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {84676#(<= ~counter~0 8)} assume true; {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,789 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84676#(<= ~counter~0 8)} {84676#(<= ~counter~0 8)} #96#return; {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {84676#(<= ~counter~0 8)} assume !(~r~0 > 0); {84676#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:12,790 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-15 15:15:12,790 INFO L290 TraceCheckUtils]: 82: Hoare triple {84701#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {84701#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:12,791 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-15 15:15:12,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {84701#(<= ~counter~0 9)} ~cond := #in~cond; {84701#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:12,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {84701#(<= ~counter~0 9)} assume !(0 == ~cond); {84701#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:12,791 INFO L290 TraceCheckUtils]: 86: Hoare triple {84701#(<= ~counter~0 9)} assume true; {84701#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:12,792 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84701#(<= ~counter~0 9)} {84701#(<= ~counter~0 9)} #98#return; {84701#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:12,792 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-15 15:15:12,793 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-15 15:15:12,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {84726#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,794 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-15 15:15:12,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {84726#(<= ~counter~0 10)} ~cond := #in~cond; {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {84726#(<= ~counter~0 10)} assume !(0 == ~cond); {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {84726#(<= ~counter~0 10)} assume true; {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,795 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84726#(<= ~counter~0 10)} {84726#(<= ~counter~0 10)} #98#return; {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {84726#(<= ~counter~0 10)} assume !(~r~0 < 0); {84726#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:12,796 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-15 15:15:12,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {84751#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,797 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-15 15:15:12,797 INFO L290 TraceCheckUtils]: 100: Hoare triple {84751#(<= ~counter~0 11)} ~cond := #in~cond; {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,797 INFO L290 TraceCheckUtils]: 101: Hoare triple {84751#(<= ~counter~0 11)} assume !(0 == ~cond); {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,798 INFO L290 TraceCheckUtils]: 102: Hoare triple {84751#(<= ~counter~0 11)} assume true; {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,798 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84751#(<= ~counter~0 11)} {84751#(<= ~counter~0 11)} #94#return; {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,798 INFO L290 TraceCheckUtils]: 104: Hoare triple {84751#(<= ~counter~0 11)} assume !!(0 != ~r~0); {84751#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:12,799 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-15 15:15:12,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {84776#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {84776#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:12,800 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-15 15:15:12,800 INFO L290 TraceCheckUtils]: 108: Hoare triple {84776#(<= ~counter~0 12)} ~cond := #in~cond; {84776#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:12,801 INFO L290 TraceCheckUtils]: 109: Hoare triple {84776#(<= ~counter~0 12)} assume !(0 == ~cond); {84776#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:12,801 INFO L290 TraceCheckUtils]: 110: Hoare triple {84776#(<= ~counter~0 12)} assume true; {84776#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:12,801 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84776#(<= ~counter~0 12)} {84776#(<= ~counter~0 12)} #96#return; {84776#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:12,802 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-15 15:15:12,802 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-15 15:15:12,802 INFO L290 TraceCheckUtils]: 114: Hoare triple {84801#(<= |main_#t~post7| 12)} assume !(#t~post7 < 50);havoc #t~post7; {84445#false} is VALID [2022-04-15 15:15:12,802 INFO L290 TraceCheckUtils]: 115: Hoare triple {84445#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84445#false} is VALID [2022-04-15 15:15:12,802 INFO L290 TraceCheckUtils]: 116: Hoare triple {84445#false} assume !(#t~post8 < 50);havoc #t~post8; {84445#false} is VALID [2022-04-15 15:15:12,802 INFO L290 TraceCheckUtils]: 117: Hoare triple {84445#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84445#false} is VALID [2022-04-15 15:15:12,803 INFO L290 TraceCheckUtils]: 118: Hoare triple {84445#false} assume !(#t~post6 < 50);havoc #t~post6; {84445#false} is VALID [2022-04-15 15:15:12,803 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-15 15:15:12,803 INFO L290 TraceCheckUtils]: 120: Hoare triple {84445#false} ~cond := #in~cond; {84445#false} is VALID [2022-04-15 15:15:12,803 INFO L290 TraceCheckUtils]: 121: Hoare triple {84445#false} assume 0 == ~cond; {84445#false} is VALID [2022-04-15 15:15:12,803 INFO L290 TraceCheckUtils]: 122: Hoare triple {84445#false} assume !false; {84445#false} is VALID [2022-04-15 15:15:12,803 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-15 15:15:12,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:13,501 INFO L290 TraceCheckUtils]: 122: Hoare triple {84445#false} assume !false; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 121: Hoare triple {84445#false} assume 0 == ~cond; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 120: Hoare triple {84445#false} ~cond := #in~cond; {84445#false} is VALID [2022-04-15 15:15:13,502 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-15 15:15:13,502 INFO L290 TraceCheckUtils]: 118: Hoare triple {84445#false} assume !(#t~post6 < 50);havoc #t~post6; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 117: Hoare triple {84445#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 116: Hoare triple {84445#false} assume !(#t~post8 < 50);havoc #t~post8; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 115: Hoare triple {84445#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84445#false} is VALID [2022-04-15 15:15:13,502 INFO L290 TraceCheckUtils]: 114: Hoare triple {84853#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {84445#false} is VALID [2022-04-15 15:15:13,503 INFO L290 TraceCheckUtils]: 113: Hoare triple {84857#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84853#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:15:13,503 INFO L290 TraceCheckUtils]: 112: Hoare triple {84857#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84857#(< ~counter~0 50)} is VALID [2022-04-15 15:15:13,503 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84444#true} {84857#(< ~counter~0 50)} #96#return; {84857#(< ~counter~0 50)} is VALID [2022-04-15 15:15:13,503 INFO L290 TraceCheckUtils]: 110: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,504 INFO L272 TraceCheckUtils]: 107: Hoare triple {84857#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:15:13,504 INFO L290 TraceCheckUtils]: 106: Hoare triple {84857#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {84857#(< ~counter~0 50)} is VALID [2022-04-15 15:15:13,506 INFO L290 TraceCheckUtils]: 105: Hoare triple {84882#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84857#(< ~counter~0 50)} is VALID [2022-04-15 15:15:13,506 INFO L290 TraceCheckUtils]: 104: Hoare triple {84882#(< ~counter~0 49)} assume !!(0 != ~r~0); {84882#(< ~counter~0 49)} is VALID [2022-04-15 15:15:13,506 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84444#true} {84882#(< ~counter~0 49)} #94#return; {84882#(< ~counter~0 49)} is VALID [2022-04-15 15:15:13,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,506 INFO L290 TraceCheckUtils]: 101: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,507 INFO L290 TraceCheckUtils]: 100: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,507 INFO L272 TraceCheckUtils]: 99: Hoare triple {84882#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:15:13,507 INFO L290 TraceCheckUtils]: 98: Hoare triple {84882#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {84882#(< ~counter~0 49)} is VALID [2022-04-15 15:15:13,508 INFO L290 TraceCheckUtils]: 97: Hoare triple {84907#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84882#(< ~counter~0 49)} is VALID [2022-04-15 15:15:13,508 INFO L290 TraceCheckUtils]: 96: Hoare triple {84907#(< ~counter~0 48)} assume !(~r~0 < 0); {84907#(< ~counter~0 48)} is VALID [2022-04-15 15:15:13,508 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84444#true} {84907#(< ~counter~0 48)} #98#return; {84907#(< ~counter~0 48)} is VALID [2022-04-15 15:15:13,509 INFO L290 TraceCheckUtils]: 94: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,509 INFO L272 TraceCheckUtils]: 91: Hoare triple {84907#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:15:13,509 INFO L290 TraceCheckUtils]: 90: Hoare triple {84907#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {84907#(< ~counter~0 48)} is VALID [2022-04-15 15:15:13,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {84932#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84907#(< ~counter~0 48)} is VALID [2022-04-15 15:15:13,510 INFO L290 TraceCheckUtils]: 88: Hoare triple {84932#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84932#(< ~counter~0 47)} is VALID [2022-04-15 15:15:13,511 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84444#true} {84932#(< ~counter~0 47)} #98#return; {84932#(< ~counter~0 47)} is VALID [2022-04-15 15:15:13,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,511 INFO L290 TraceCheckUtils]: 84: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,511 INFO L272 TraceCheckUtils]: 83: Hoare triple {84932#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:15:13,511 INFO L290 TraceCheckUtils]: 82: Hoare triple {84932#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {84932#(< ~counter~0 47)} is VALID [2022-04-15 15:15:13,512 INFO L290 TraceCheckUtils]: 81: Hoare triple {84957#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84932#(< ~counter~0 47)} is VALID [2022-04-15 15:15:13,512 INFO L290 TraceCheckUtils]: 80: Hoare triple {84957#(< ~counter~0 46)} assume !(~r~0 > 0); {84957#(< ~counter~0 46)} is VALID [2022-04-15 15:15:13,513 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84444#true} {84957#(< ~counter~0 46)} #96#return; {84957#(< ~counter~0 46)} is VALID [2022-04-15 15:15:13,513 INFO L290 TraceCheckUtils]: 78: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,513 INFO L290 TraceCheckUtils]: 77: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,513 INFO L290 TraceCheckUtils]: 76: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,513 INFO L272 TraceCheckUtils]: 75: Hoare triple {84957#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:15:13,513 INFO L290 TraceCheckUtils]: 74: Hoare triple {84957#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {84957#(< ~counter~0 46)} is VALID [2022-04-15 15:15:13,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {84982#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84957#(< ~counter~0 46)} is VALID [2022-04-15 15:15:13,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {84982#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84982#(< ~counter~0 45)} is VALID [2022-04-15 15:15:13,515 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84444#true} {84982#(< ~counter~0 45)} #96#return; {84982#(< ~counter~0 45)} is VALID [2022-04-15 15:15:13,515 INFO L290 TraceCheckUtils]: 70: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,515 INFO L290 TraceCheckUtils]: 69: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,515 INFO L290 TraceCheckUtils]: 68: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,515 INFO L272 TraceCheckUtils]: 67: Hoare triple {84982#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:15:13,516 INFO L290 TraceCheckUtils]: 66: Hoare triple {84982#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {84982#(< ~counter~0 45)} is VALID [2022-04-15 15:15:13,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {85007#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84982#(< ~counter~0 45)} is VALID [2022-04-15 15:15:13,517 INFO L290 TraceCheckUtils]: 64: Hoare triple {85007#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85007#(< ~counter~0 44)} is VALID [2022-04-15 15:15:13,517 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84444#true} {85007#(< ~counter~0 44)} #96#return; {85007#(< ~counter~0 44)} is VALID [2022-04-15 15:15:13,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,518 INFO L272 TraceCheckUtils]: 59: Hoare triple {85007#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:15:13,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {85007#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {85007#(< ~counter~0 44)} is VALID [2022-04-15 15:15:13,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {85032#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85007#(< ~counter~0 44)} is VALID [2022-04-15 15:15:13,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {85032#(< ~counter~0 43)} assume !!(0 != ~r~0); {85032#(< ~counter~0 43)} is VALID [2022-04-15 15:15:13,519 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84444#true} {85032#(< ~counter~0 43)} #94#return; {85032#(< ~counter~0 43)} is VALID [2022-04-15 15:15:13,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,520 INFO L272 TraceCheckUtils]: 51: Hoare triple {85032#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:15:13,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {85032#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {85032#(< ~counter~0 43)} is VALID [2022-04-15 15:15:13,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {85057#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85032#(< ~counter~0 43)} is VALID [2022-04-15 15:15:13,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {85057#(< ~counter~0 42)} assume !(~r~0 < 0); {85057#(< ~counter~0 42)} is VALID [2022-04-15 15:15:13,521 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84444#true} {85057#(< ~counter~0 42)} #98#return; {85057#(< ~counter~0 42)} is VALID [2022-04-15 15:15:13,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,522 INFO L272 TraceCheckUtils]: 43: Hoare triple {85057#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:15:13,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {85057#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {85057#(< ~counter~0 42)} is VALID [2022-04-15 15:15:13,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {85082#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85057#(< ~counter~0 42)} is VALID [2022-04-15 15:15:13,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {85082#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85082#(< ~counter~0 41)} is VALID [2022-04-15 15:15:13,524 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84444#true} {85082#(< ~counter~0 41)} #98#return; {85082#(< ~counter~0 41)} is VALID [2022-04-15 15:15:13,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,524 INFO L272 TraceCheckUtils]: 35: Hoare triple {85082#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:15:13,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {85082#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {85082#(< ~counter~0 41)} is VALID [2022-04-15 15:15:13,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {85107#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85082#(< ~counter~0 41)} is VALID [2022-04-15 15:15:13,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {85107#(< ~counter~0 40)} assume !(~r~0 > 0); {85107#(< ~counter~0 40)} is VALID [2022-04-15 15:15:13,526 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84444#true} {85107#(< ~counter~0 40)} #96#return; {85107#(< ~counter~0 40)} is VALID [2022-04-15 15:15:13,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,526 INFO L272 TraceCheckUtils]: 27: Hoare triple {85107#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:15:13,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {85107#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {85107#(< ~counter~0 40)} is VALID [2022-04-15 15:15:13,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {85132#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85107#(< ~counter~0 40)} is VALID [2022-04-15 15:15:13,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {85132#(< ~counter~0 39)} assume !!(0 != ~r~0); {85132#(< ~counter~0 39)} is VALID [2022-04-15 15:15:13,528 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84444#true} {85132#(< ~counter~0 39)} #94#return; {85132#(< ~counter~0 39)} is VALID [2022-04-15 15:15:13,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,528 INFO L272 TraceCheckUtils]: 19: Hoare triple {85132#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:15:13,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {85132#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {85132#(< ~counter~0 39)} is VALID [2022-04-15 15:15:13,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {85157#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85132#(< ~counter~0 39)} is VALID [2022-04-15 15:15:13,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {85157#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,530 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84444#true} {85157#(< ~counter~0 38)} #92#return; {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {85157#(< ~counter~0 38)} call assume_abort_if_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-15 15:15:13,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84444#true} {85157#(< ~counter~0 38)} #90#return; {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {84444#true} assume true; {84444#true} is VALID [2022-04-15 15:15:13,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {84444#true} assume !(0 == ~cond); {84444#true} is VALID [2022-04-15 15:15:13,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {84444#true} ~cond := #in~cond; {84444#true} is VALID [2022-04-15 15:15:13,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {85157#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84444#true} is VALID [2022-04-15 15:15:13,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {85157#(< ~counter~0 38)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 38)} is VALID [2022-04-15 15:15:13,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {85157#(< ~counter~0 38)} call #t~ret9 := main(); {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85157#(< ~counter~0 38)} {84444#true} #102#return; {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {85157#(< ~counter~0 38)} assume true; {85157#(< ~counter~0 38)} is VALID [2022-04-15 15:15:13,532 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 38)} is VALID [2022-04-15 15:15:13,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {84444#true} call ULTIMATE.init(); {84444#true} is VALID [2022-04-15 15:15:13,533 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-15 15:15:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799060913] [2022-04-15 15:15:13,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200869655] [2022-04-15 15:15:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200869655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:13,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:13,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:15:13,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036773473] [2022-04-15 15:15:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036773473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:13,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:13,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:15:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855866519] [2022-04-15 15:15:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:13,534 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-15 15:15:13,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:13,534 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-15 15:15:13,634 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-15 15:15:13,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:15:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:15:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:15:13,635 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-15 15:15:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:16,520 INFO L93 Difference]: Finished difference Result 847 states and 1187 transitions. [2022-04-15 15:15:16,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:15:16,520 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-15 15:15:16,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:16,521 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-15 15:15:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:15:16,523 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-15 15:15:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:15:16,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-15 15:15:16,773 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-15 15:15:16,792 INFO L225 Difference]: With dead ends: 847 [2022-04-15 15:15:16,793 INFO L226 Difference]: Without dead ends: 650 [2022-04-15 15:15:16,794 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-15 15:15:16,794 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-15 15:15:16,794 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-15 15:15:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-04-15 15:15:18,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-04-15 15:15:18,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:18,698 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-15 15:15:18,698 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-15 15:15:18,698 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-15 15:15:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:18,720 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-15 15:15:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-15 15:15:18,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:18,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:18,722 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-15 15:15:18,722 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-15 15:15:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:18,737 INFO L93 Difference]: Finished difference Result 650 states and 879 transitions. [2022-04-15 15:15:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-15 15:15:18,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:18,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:18,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:18,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:18,739 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-15 15:15:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 879 transitions. [2022-04-15 15:15:18,758 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 879 transitions. Word has length 123 [2022-04-15 15:15:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:18,758 INFO L478 AbstractCegarLoop]: Abstraction has 650 states and 879 transitions. [2022-04-15 15:15:18,758 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-15 15:15:18,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 650 states and 879 transitions. [2022-04-15 15:15:21,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:21,235 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 879 transitions. [2022-04-15 15:15:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 15:15:21,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:21,236 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-15 15:15:21,252 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-15 15:15:21,437 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-15 15:15:21,437 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-15 15:15:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519342616] [2022-04-15 15:15:21,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-15 15:15:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411364168] [2022-04-15 15:15:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:21,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:21,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964564214] [2022-04-15 15:15:21,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:15:21,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:21,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:21,458 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-15 15:15:21,463 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-15 15:15:21,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:15:21,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:21,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:15:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:21,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:22,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {89527#true} call ULTIMATE.init(); {89527#true} is VALID [2022-04-15 15:15:22,164 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-15 15:15:22,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89535#(<= ~counter~0 0)} {89527#true} #102#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {89535#(<= ~counter~0 0)} call #t~ret9 := main(); {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,165 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-15 15:15:22,165 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-15 15:15:22,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {89535#(<= ~counter~0 0)} ~cond := #in~cond; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {89535#(<= ~counter~0 0)} assume !(0 == ~cond); {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89535#(<= ~counter~0 0)} {89535#(<= ~counter~0 0)} #90#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,167 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-15 15:15:22,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {89535#(<= ~counter~0 0)} ~cond := #in~cond; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {89535#(<= ~counter~0 0)} assume !(0 == ~cond); {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {89535#(<= ~counter~0 0)} assume true; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89535#(<= ~counter~0 0)} {89535#(<= ~counter~0 0)} #92#return; {89535#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:22,168 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-15 15:15:22,170 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-15 15:15:22,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {89584#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,171 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-15 15:15:22,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {89584#(<= ~counter~0 1)} ~cond := #in~cond; {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {89584#(<= ~counter~0 1)} assume !(0 == ~cond); {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {89584#(<= ~counter~0 1)} assume true; {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,172 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89584#(<= ~counter~0 1)} {89584#(<= ~counter~0 1)} #94#return; {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {89584#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89584#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:22,173 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-15 15:15:22,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {89609#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,174 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-15 15:15:22,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {89609#(<= ~counter~0 2)} ~cond := #in~cond; {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {89609#(<= ~counter~0 2)} assume !(0 == ~cond); {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {89609#(<= ~counter~0 2)} assume true; {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,175 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89609#(<= ~counter~0 2)} {89609#(<= ~counter~0 2)} #96#return; {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {89609#(<= ~counter~0 2)} assume !(~r~0 > 0); {89609#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:22,176 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-15 15:15:22,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {89634#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {89634#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:22,177 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-15 15:15:22,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {89634#(<= ~counter~0 3)} ~cond := #in~cond; {89634#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:22,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {89634#(<= ~counter~0 3)} assume !(0 == ~cond); {89634#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:22,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {89634#(<= ~counter~0 3)} assume true; {89634#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:22,178 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89634#(<= ~counter~0 3)} {89634#(<= ~counter~0 3)} #98#return; {89634#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:22,178 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-15 15:15:22,179 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-15 15:15:22,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {89659#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,180 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-15 15:15:22,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {89659#(<= ~counter~0 4)} ~cond := #in~cond; {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {89659#(<= ~counter~0 4)} assume !(0 == ~cond); {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {89659#(<= ~counter~0 4)} assume true; {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,181 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89659#(<= ~counter~0 4)} {89659#(<= ~counter~0 4)} #98#return; {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {89659#(<= ~counter~0 4)} assume !(~r~0 < 0); {89659#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:22,182 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-15 15:15:22,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {89684#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,183 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-15 15:15:22,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {89684#(<= ~counter~0 5)} ~cond := #in~cond; {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {89684#(<= ~counter~0 5)} assume !(0 == ~cond); {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {89684#(<= ~counter~0 5)} assume true; {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,184 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89684#(<= ~counter~0 5)} {89684#(<= ~counter~0 5)} #94#return; {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {89684#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89684#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:22,186 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-15 15:15:22,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {89709#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {89709#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:22,186 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-15 15:15:22,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {89709#(<= ~counter~0 6)} ~cond := #in~cond; {89709#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:22,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {89709#(<= ~counter~0 6)} assume !(0 == ~cond); {89709#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:22,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {89709#(<= ~counter~0 6)} assume true; {89709#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:22,188 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89709#(<= ~counter~0 6)} {89709#(<= ~counter~0 6)} #96#return; {89709#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:22,188 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-15 15:15:22,189 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-15 15:15:22,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {89734#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {89734#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:22,189 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-15 15:15:22,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {89734#(<= ~counter~0 7)} ~cond := #in~cond; {89734#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:22,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {89734#(<= ~counter~0 7)} assume !(0 == ~cond); {89734#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:22,190 INFO L290 TraceCheckUtils]: 70: Hoare triple {89734#(<= ~counter~0 7)} assume true; {89734#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:22,191 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89734#(<= ~counter~0 7)} {89734#(<= ~counter~0 7)} #96#return; {89734#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:22,191 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-15 15:15:22,192 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-15 15:15:22,192 INFO L290 TraceCheckUtils]: 74: Hoare triple {89759#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {89759#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:22,192 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-15 15:15:22,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {89759#(<= ~counter~0 8)} ~cond := #in~cond; {89759#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:22,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {89759#(<= ~counter~0 8)} assume !(0 == ~cond); {89759#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:22,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {89759#(<= ~counter~0 8)} assume true; {89759#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:22,194 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89759#(<= ~counter~0 8)} {89759#(<= ~counter~0 8)} #96#return; {89759#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:22,194 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-15 15:15:22,195 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-15 15:15:22,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {89784#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {89784#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:22,196 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-15 15:15:22,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {89784#(<= ~counter~0 9)} ~cond := #in~cond; {89784#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:22,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {89784#(<= ~counter~0 9)} assume !(0 == ~cond); {89784#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:22,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {89784#(<= ~counter~0 9)} assume true; {89784#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:22,197 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89784#(<= ~counter~0 9)} {89784#(<= ~counter~0 9)} #96#return; {89784#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:22,197 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-15 15:15:22,198 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-15 15:15:22,198 INFO L290 TraceCheckUtils]: 90: Hoare triple {89809#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {89809#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:22,199 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-15 15:15:22,199 INFO L290 TraceCheckUtils]: 92: Hoare triple {89809#(<= ~counter~0 10)} ~cond := #in~cond; {89809#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:22,199 INFO L290 TraceCheckUtils]: 93: Hoare triple {89809#(<= ~counter~0 10)} assume !(0 == ~cond); {89809#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:22,199 INFO L290 TraceCheckUtils]: 94: Hoare triple {89809#(<= ~counter~0 10)} assume true; {89809#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:22,200 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89809#(<= ~counter~0 10)} {89809#(<= ~counter~0 10)} #96#return; {89809#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:22,200 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-15 15:15:22,201 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-15 15:15:22,201 INFO L290 TraceCheckUtils]: 98: Hoare triple {89834#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,202 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-15 15:15:22,202 INFO L290 TraceCheckUtils]: 100: Hoare triple {89834#(<= ~counter~0 11)} ~cond := #in~cond; {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,202 INFO L290 TraceCheckUtils]: 101: Hoare triple {89834#(<= ~counter~0 11)} assume !(0 == ~cond); {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {89834#(<= ~counter~0 11)} assume true; {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,203 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89834#(<= ~counter~0 11)} {89834#(<= ~counter~0 11)} #96#return; {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,203 INFO L290 TraceCheckUtils]: 104: Hoare triple {89834#(<= ~counter~0 11)} assume !(~r~0 > 0); {89834#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:22,204 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-15 15:15:22,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {89859#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {89859#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:22,205 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-15 15:15:22,205 INFO L290 TraceCheckUtils]: 108: Hoare triple {89859#(<= ~counter~0 12)} ~cond := #in~cond; {89859#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:22,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {89859#(<= ~counter~0 12)} assume !(0 == ~cond); {89859#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:22,206 INFO L290 TraceCheckUtils]: 110: Hoare triple {89859#(<= ~counter~0 12)} assume true; {89859#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:22,206 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89859#(<= ~counter~0 12)} {89859#(<= ~counter~0 12)} #98#return; {89859#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:22,206 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-15 15:15:22,207 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-15 15:15:22,207 INFO L290 TraceCheckUtils]: 114: Hoare triple {89884#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,208 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-15 15:15:22,208 INFO L290 TraceCheckUtils]: 116: Hoare triple {89884#(<= ~counter~0 13)} ~cond := #in~cond; {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,208 INFO L290 TraceCheckUtils]: 117: Hoare triple {89884#(<= ~counter~0 13)} assume !(0 == ~cond); {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,209 INFO L290 TraceCheckUtils]: 118: Hoare triple {89884#(<= ~counter~0 13)} assume true; {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,209 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89884#(<= ~counter~0 13)} {89884#(<= ~counter~0 13)} #98#return; {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,209 INFO L290 TraceCheckUtils]: 120: Hoare triple {89884#(<= ~counter~0 13)} assume !(~r~0 < 0); {89884#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:22,210 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-15 15:15:22,210 INFO L290 TraceCheckUtils]: 122: Hoare triple {89909#(<= |main_#t~post6| 13)} assume !(#t~post6 < 50);havoc #t~post6; {89528#false} is VALID [2022-04-15 15:15:22,210 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-15 15:15:22,210 INFO L290 TraceCheckUtils]: 124: Hoare triple {89528#false} ~cond := #in~cond; {89528#false} is VALID [2022-04-15 15:15:22,210 INFO L290 TraceCheckUtils]: 125: Hoare triple {89528#false} assume 0 == ~cond; {89528#false} is VALID [2022-04-15 15:15:22,210 INFO L290 TraceCheckUtils]: 126: Hoare triple {89528#false} assume !false; {89528#false} is VALID [2022-04-15 15:15:22,211 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-15 15:15:22,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:22,928 INFO L290 TraceCheckUtils]: 126: Hoare triple {89528#false} assume !false; {89528#false} is VALID [2022-04-15 15:15:22,929 INFO L290 TraceCheckUtils]: 125: Hoare triple {89528#false} assume 0 == ~cond; {89528#false} is VALID [2022-04-15 15:15:22,929 INFO L290 TraceCheckUtils]: 124: Hoare triple {89528#false} ~cond := #in~cond; {89528#false} is VALID [2022-04-15 15:15:22,929 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-15 15:15:22,929 INFO L290 TraceCheckUtils]: 122: Hoare triple {89937#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {89528#false} is VALID [2022-04-15 15:15:22,929 INFO L290 TraceCheckUtils]: 121: Hoare triple {89941#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89937#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:15:22,930 INFO L290 TraceCheckUtils]: 120: Hoare triple {89941#(< ~counter~0 50)} assume !(~r~0 < 0); {89941#(< ~counter~0 50)} is VALID [2022-04-15 15:15:22,930 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {89527#true} {89941#(< ~counter~0 50)} #98#return; {89941#(< ~counter~0 50)} is VALID [2022-04-15 15:15:22,930 INFO L290 TraceCheckUtils]: 118: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,930 INFO L290 TraceCheckUtils]: 117: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,930 INFO L290 TraceCheckUtils]: 116: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,930 INFO L272 TraceCheckUtils]: 115: Hoare triple {89941#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:15:22,931 INFO L290 TraceCheckUtils]: 114: Hoare triple {89941#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {89941#(< ~counter~0 50)} is VALID [2022-04-15 15:15:22,932 INFO L290 TraceCheckUtils]: 113: Hoare triple {89966#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89941#(< ~counter~0 50)} is VALID [2022-04-15 15:15:22,933 INFO L290 TraceCheckUtils]: 112: Hoare triple {89966#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89966#(< ~counter~0 49)} is VALID [2022-04-15 15:15:22,933 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89527#true} {89966#(< ~counter~0 49)} #98#return; {89966#(< ~counter~0 49)} is VALID [2022-04-15 15:15:22,933 INFO L290 TraceCheckUtils]: 110: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,933 INFO L290 TraceCheckUtils]: 109: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,933 INFO L290 TraceCheckUtils]: 108: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,934 INFO L272 TraceCheckUtils]: 107: Hoare triple {89966#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:15:22,934 INFO L290 TraceCheckUtils]: 106: Hoare triple {89966#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {89966#(< ~counter~0 49)} is VALID [2022-04-15 15:15:22,935 INFO L290 TraceCheckUtils]: 105: Hoare triple {89991#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89966#(< ~counter~0 49)} is VALID [2022-04-15 15:15:22,935 INFO L290 TraceCheckUtils]: 104: Hoare triple {89991#(< ~counter~0 48)} assume !(~r~0 > 0); {89991#(< ~counter~0 48)} is VALID [2022-04-15 15:15:22,935 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89527#true} {89991#(< ~counter~0 48)} #96#return; {89991#(< ~counter~0 48)} is VALID [2022-04-15 15:15:22,935 INFO L290 TraceCheckUtils]: 102: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,936 INFO L290 TraceCheckUtils]: 101: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,936 INFO L290 TraceCheckUtils]: 100: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,936 INFO L272 TraceCheckUtils]: 99: Hoare triple {89991#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:15:22,936 INFO L290 TraceCheckUtils]: 98: Hoare triple {89991#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {89991#(< ~counter~0 48)} is VALID [2022-04-15 15:15:22,937 INFO L290 TraceCheckUtils]: 97: Hoare triple {90016#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89991#(< ~counter~0 48)} is VALID [2022-04-15 15:15:22,937 INFO L290 TraceCheckUtils]: 96: Hoare triple {90016#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90016#(< ~counter~0 47)} is VALID [2022-04-15 15:15:22,937 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89527#true} {90016#(< ~counter~0 47)} #96#return; {90016#(< ~counter~0 47)} is VALID [2022-04-15 15:15:22,938 INFO L290 TraceCheckUtils]: 94: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,938 INFO L290 TraceCheckUtils]: 93: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,938 INFO L290 TraceCheckUtils]: 92: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,938 INFO L272 TraceCheckUtils]: 91: Hoare triple {90016#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:15:22,938 INFO L290 TraceCheckUtils]: 90: Hoare triple {90016#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {90016#(< ~counter~0 47)} is VALID [2022-04-15 15:15:22,939 INFO L290 TraceCheckUtils]: 89: Hoare triple {90041#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90016#(< ~counter~0 47)} is VALID [2022-04-15 15:15:22,939 INFO L290 TraceCheckUtils]: 88: Hoare triple {90041#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90041#(< ~counter~0 46)} is VALID [2022-04-15 15:15:22,940 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89527#true} {90041#(< ~counter~0 46)} #96#return; {90041#(< ~counter~0 46)} is VALID [2022-04-15 15:15:22,940 INFO L290 TraceCheckUtils]: 86: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,940 INFO L290 TraceCheckUtils]: 85: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,940 INFO L272 TraceCheckUtils]: 83: Hoare triple {90041#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:15:22,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {90041#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {90041#(< ~counter~0 46)} is VALID [2022-04-15 15:15:22,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {90066#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90041#(< ~counter~0 46)} is VALID [2022-04-15 15:15:22,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {90066#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90066#(< ~counter~0 45)} is VALID [2022-04-15 15:15:22,942 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89527#true} {90066#(< ~counter~0 45)} #96#return; {90066#(< ~counter~0 45)} is VALID [2022-04-15 15:15:22,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,942 INFO L290 TraceCheckUtils]: 77: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,942 INFO L272 TraceCheckUtils]: 75: Hoare triple {90066#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:15:22,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {90066#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {90066#(< ~counter~0 45)} is VALID [2022-04-15 15:15:22,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {90091#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90066#(< ~counter~0 45)} is VALID [2022-04-15 15:15:22,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {90091#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90091#(< ~counter~0 44)} is VALID [2022-04-15 15:15:22,944 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89527#true} {90091#(< ~counter~0 44)} #96#return; {90091#(< ~counter~0 44)} is VALID [2022-04-15 15:15:22,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,944 INFO L272 TraceCheckUtils]: 67: Hoare triple {90091#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:15:22,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {90091#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {90091#(< ~counter~0 44)} is VALID [2022-04-15 15:15:22,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {90116#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90091#(< ~counter~0 44)} is VALID [2022-04-15 15:15:22,945 INFO L290 TraceCheckUtils]: 64: Hoare triple {90116#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90116#(< ~counter~0 43)} is VALID [2022-04-15 15:15:22,946 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89527#true} {90116#(< ~counter~0 43)} #96#return; {90116#(< ~counter~0 43)} is VALID [2022-04-15 15:15:22,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,946 INFO L272 TraceCheckUtils]: 59: Hoare triple {90116#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:15:22,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {90116#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {90116#(< ~counter~0 43)} is VALID [2022-04-15 15:15:22,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {90141#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90116#(< ~counter~0 43)} is VALID [2022-04-15 15:15:22,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {90141#(< ~counter~0 42)} assume !!(0 != ~r~0); {90141#(< ~counter~0 42)} is VALID [2022-04-15 15:15:22,948 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89527#true} {90141#(< ~counter~0 42)} #94#return; {90141#(< ~counter~0 42)} is VALID [2022-04-15 15:15:22,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,948 INFO L272 TraceCheckUtils]: 51: Hoare triple {90141#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:15:22,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {90141#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {90141#(< ~counter~0 42)} is VALID [2022-04-15 15:15:22,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {90166#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90141#(< ~counter~0 42)} is VALID [2022-04-15 15:15:22,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {90166#(< ~counter~0 41)} assume !(~r~0 < 0); {90166#(< ~counter~0 41)} is VALID [2022-04-15 15:15:22,950 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89527#true} {90166#(< ~counter~0 41)} #98#return; {90166#(< ~counter~0 41)} is VALID [2022-04-15 15:15:22,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,950 INFO L272 TraceCheckUtils]: 43: Hoare triple {90166#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:15:22,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {90166#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {90166#(< ~counter~0 41)} is VALID [2022-04-15 15:15:22,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {90191#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90166#(< ~counter~0 41)} is VALID [2022-04-15 15:15:22,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {90191#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90191#(< ~counter~0 40)} is VALID [2022-04-15 15:15:22,952 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89527#true} {90191#(< ~counter~0 40)} #98#return; {90191#(< ~counter~0 40)} is VALID [2022-04-15 15:15:22,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,952 INFO L272 TraceCheckUtils]: 35: Hoare triple {90191#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:15:22,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {90191#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {90191#(< ~counter~0 40)} is VALID [2022-04-15 15:15:22,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {90216#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90191#(< ~counter~0 40)} is VALID [2022-04-15 15:15:22,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {90216#(< ~counter~0 39)} assume !(~r~0 > 0); {90216#(< ~counter~0 39)} is VALID [2022-04-15 15:15:22,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89527#true} {90216#(< ~counter~0 39)} #96#return; {90216#(< ~counter~0 39)} is VALID [2022-04-15 15:15:22,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,955 INFO L272 TraceCheckUtils]: 27: Hoare triple {90216#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:15:22,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {90216#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {90216#(< ~counter~0 39)} is VALID [2022-04-15 15:15:22,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {90241#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90216#(< ~counter~0 39)} is VALID [2022-04-15 15:15:22,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {90241#(< ~counter~0 38)} assume !!(0 != ~r~0); {90241#(< ~counter~0 38)} is VALID [2022-04-15 15:15:22,956 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89527#true} {90241#(< ~counter~0 38)} #94#return; {90241#(< ~counter~0 38)} is VALID [2022-04-15 15:15:22,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {90241#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:15:22,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {90241#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {90241#(< ~counter~0 38)} is VALID [2022-04-15 15:15:22,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {90266#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90241#(< ~counter~0 38)} is VALID [2022-04-15 15:15:22,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {90266#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89527#true} {90266#(< ~counter~0 37)} #92#return; {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,961 INFO L272 TraceCheckUtils]: 11: Hoare triple {90266#(< ~counter~0 37)} call assume_abort_if_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-15 15:15:22,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89527#true} {90266#(< ~counter~0 37)} #90#return; {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {89527#true} assume true; {89527#true} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {89527#true} assume !(0 == ~cond); {89527#true} is VALID [2022-04-15 15:15:22,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {89527#true} ~cond := #in~cond; {89527#true} is VALID [2022-04-15 15:15:22,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {90266#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89527#true} is VALID [2022-04-15 15:15:22,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {90266#(< ~counter~0 37)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 37)} is VALID [2022-04-15 15:15:22,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {90266#(< ~counter~0 37)} call #t~ret9 := main(); {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90266#(< ~counter~0 37)} {89527#true} #102#return; {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {90266#(< ~counter~0 37)} assume true; {90266#(< ~counter~0 37)} is VALID [2022-04-15 15:15:22,963 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 37)} is VALID [2022-04-15 15:15:22,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {89527#true} call ULTIMATE.init(); {89527#true} is VALID [2022-04-15 15:15:22,964 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-15 15:15:22,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411364168] [2022-04-15 15:15:22,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964564214] [2022-04-15 15:15:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964564214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:22,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:22,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:15:22,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519342616] [2022-04-15 15:15:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519342616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:22,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:22,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:15:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820108532] [2022-04-15 15:15:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:22,965 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-15 15:15:22,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:22,965 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-15 15:15:23,063 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-15 15:15:23,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:15:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:15:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:15:23,064 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-15 15:15:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:26,363 INFO L93 Difference]: Finished difference Result 705 states and 956 transitions. [2022-04-15 15:15:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:15:26,364 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-15 15:15:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:26,364 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-15 15:15:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:15:26,366 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-15 15:15:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:15:26,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-15 15:15:26,605 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-15 15:15:26,624 INFO L225 Difference]: With dead ends: 705 [2022-04-15 15:15:26,624 INFO L226 Difference]: Without dead ends: 694 [2022-04-15 15:15:26,625 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-15 15:15:26,625 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-15 15:15:26,626 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-15 15:15:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-15 15:15:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 672. [2022-04-15 15:15:28,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:28,597 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-15 15:15:28,597 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-15 15:15:28,597 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-15 15:15:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:28,616 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-15 15:15:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-15 15:15:28,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:28,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:28,617 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-15 15:15:28,617 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-15 15:15:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:28,633 INFO L93 Difference]: Finished difference Result 694 states and 940 transitions. [2022-04-15 15:15:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 940 transitions. [2022-04-15 15:15:28,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:28,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:28,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:28,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:28,634 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-15 15:15:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 914 transitions. [2022-04-15 15:15:28,655 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 914 transitions. Word has length 127 [2022-04-15 15:15:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:28,655 INFO L478 AbstractCegarLoop]: Abstraction has 672 states and 914 transitions. [2022-04-15 15:15:28,656 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-15 15:15:28,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 672 states and 914 transitions. [2022-04-15 15:15:32,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 914 edges. 913 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 914 transitions. [2022-04-15 15:15:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 15:15:32,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:32,338 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-15 15:15:32,355 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-15 15:15:32,543 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-15 15:15:32,543 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:32,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-15 15:15:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:32,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550943531] [2022-04-15 15:15:32,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-15 15:15:32,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:32,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345466049] [2022-04-15 15:15:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:32,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813321658] [2022-04-15 15:15:32,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:15:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:32,558 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-15 15:15:32,562 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-15 15:15:32,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:15:32,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:32,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:15:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:32,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:33,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {94482#true} call ULTIMATE.init(); {94482#true} is VALID [2022-04-15 15:15:33,333 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-15 15:15:33,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94490#(<= ~counter~0 0)} {94482#true} #102#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {94490#(<= ~counter~0 0)} call #t~ret9 := main(); {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,334 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-15 15:15:33,334 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-15 15:15:33,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {94490#(<= ~counter~0 0)} ~cond := #in~cond; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {94490#(<= ~counter~0 0)} assume !(0 == ~cond); {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,336 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94490#(<= ~counter~0 0)} {94490#(<= ~counter~0 0)} #90#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,336 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-15 15:15:33,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {94490#(<= ~counter~0 0)} ~cond := #in~cond; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {94490#(<= ~counter~0 0)} assume !(0 == ~cond); {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {94490#(<= ~counter~0 0)} assume true; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94490#(<= ~counter~0 0)} {94490#(<= ~counter~0 0)} #92#return; {94490#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:33,337 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-15 15:15:33,339 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-15 15:15:33,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {94539#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,340 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-15 15:15:33,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {94539#(<= ~counter~0 1)} ~cond := #in~cond; {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {94539#(<= ~counter~0 1)} assume !(0 == ~cond); {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {94539#(<= ~counter~0 1)} assume true; {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94539#(<= ~counter~0 1)} {94539#(<= ~counter~0 1)} #94#return; {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {94539#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94539#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:33,342 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-15 15:15:33,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {94564#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,343 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-15 15:15:33,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {94564#(<= ~counter~0 2)} ~cond := #in~cond; {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {94564#(<= ~counter~0 2)} assume !(0 == ~cond); {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {94564#(<= ~counter~0 2)} assume true; {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,345 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94564#(<= ~counter~0 2)} {94564#(<= ~counter~0 2)} #96#return; {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {94564#(<= ~counter~0 2)} assume !(~r~0 > 0); {94564#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:33,346 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-15 15:15:33,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {94589#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {94589#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:33,346 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-15 15:15:33,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {94589#(<= ~counter~0 3)} ~cond := #in~cond; {94589#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:33,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {94589#(<= ~counter~0 3)} assume !(0 == ~cond); {94589#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:33,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {94589#(<= ~counter~0 3)} assume true; {94589#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:33,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94589#(<= ~counter~0 3)} {94589#(<= ~counter~0 3)} #98#return; {94589#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:33,348 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-15 15:15:33,349 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-15 15:15:33,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {94614#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,350 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-15 15:15:33,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {94614#(<= ~counter~0 4)} ~cond := #in~cond; {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {94614#(<= ~counter~0 4)} assume !(0 == ~cond); {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {94614#(<= ~counter~0 4)} assume true; {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,351 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94614#(<= ~counter~0 4)} {94614#(<= ~counter~0 4)} #98#return; {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {94614#(<= ~counter~0 4)} assume !(~r~0 < 0); {94614#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:33,352 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-15 15:15:33,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {94639#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,353 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-15 15:15:33,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {94639#(<= ~counter~0 5)} ~cond := #in~cond; {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {94639#(<= ~counter~0 5)} assume !(0 == ~cond); {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {94639#(<= ~counter~0 5)} assume true; {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,354 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94639#(<= ~counter~0 5)} {94639#(<= ~counter~0 5)} #94#return; {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {94639#(<= ~counter~0 5)} assume !!(0 != ~r~0); {94639#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:33,355 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-15 15:15:33,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {94664#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {94664#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:33,356 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-15 15:15:33,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {94664#(<= ~counter~0 6)} ~cond := #in~cond; {94664#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:33,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {94664#(<= ~counter~0 6)} assume !(0 == ~cond); {94664#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:33,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {94664#(<= ~counter~0 6)} assume true; {94664#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:33,357 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94664#(<= ~counter~0 6)} {94664#(<= ~counter~0 6)} #96#return; {94664#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:33,357 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-15 15:15:33,358 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-15 15:15:33,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {94689#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {94689#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:33,359 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-15 15:15:33,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {94689#(<= ~counter~0 7)} ~cond := #in~cond; {94689#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:33,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {94689#(<= ~counter~0 7)} assume !(0 == ~cond); {94689#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:33,360 INFO L290 TraceCheckUtils]: 70: Hoare triple {94689#(<= ~counter~0 7)} assume true; {94689#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:33,360 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94689#(<= ~counter~0 7)} {94689#(<= ~counter~0 7)} #96#return; {94689#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:33,361 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-15 15:15:33,362 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-15 15:15:33,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {94714#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,362 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-15 15:15:33,363 INFO L290 TraceCheckUtils]: 76: Hoare triple {94714#(<= ~counter~0 8)} ~cond := #in~cond; {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {94714#(<= ~counter~0 8)} assume !(0 == ~cond); {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {94714#(<= ~counter~0 8)} assume true; {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,364 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94714#(<= ~counter~0 8)} {94714#(<= ~counter~0 8)} #96#return; {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {94714#(<= ~counter~0 8)} assume !(~r~0 > 0); {94714#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:33,365 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-15 15:15:33,365 INFO L290 TraceCheckUtils]: 82: Hoare triple {94739#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {94739#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:33,366 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-15 15:15:33,366 INFO L290 TraceCheckUtils]: 84: Hoare triple {94739#(<= ~counter~0 9)} ~cond := #in~cond; {94739#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:33,366 INFO L290 TraceCheckUtils]: 85: Hoare triple {94739#(<= ~counter~0 9)} assume !(0 == ~cond); {94739#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:33,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {94739#(<= ~counter~0 9)} assume true; {94739#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:33,367 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94739#(<= ~counter~0 9)} {94739#(<= ~counter~0 9)} #98#return; {94739#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:33,367 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-15 15:15:33,368 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-15 15:15:33,368 INFO L290 TraceCheckUtils]: 90: Hoare triple {94764#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,369 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-15 15:15:33,369 INFO L290 TraceCheckUtils]: 92: Hoare triple {94764#(<= ~counter~0 10)} ~cond := #in~cond; {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,369 INFO L290 TraceCheckUtils]: 93: Hoare triple {94764#(<= ~counter~0 10)} assume !(0 == ~cond); {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,370 INFO L290 TraceCheckUtils]: 94: Hoare triple {94764#(<= ~counter~0 10)} assume true; {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,370 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94764#(<= ~counter~0 10)} {94764#(<= ~counter~0 10)} #98#return; {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,370 INFO L290 TraceCheckUtils]: 96: Hoare triple {94764#(<= ~counter~0 10)} assume !(~r~0 < 0); {94764#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:33,371 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-15 15:15:33,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {94789#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,372 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-15 15:15:33,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {94789#(<= ~counter~0 11)} ~cond := #in~cond; {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {94789#(<= ~counter~0 11)} assume !(0 == ~cond); {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {94789#(<= ~counter~0 11)} assume true; {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,373 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94789#(<= ~counter~0 11)} {94789#(<= ~counter~0 11)} #94#return; {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,374 INFO L290 TraceCheckUtils]: 104: Hoare triple {94789#(<= ~counter~0 11)} assume !!(0 != ~r~0); {94789#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:33,375 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-15 15:15:33,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {94814#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {94814#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:33,375 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-15 15:15:33,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {94814#(<= ~counter~0 12)} ~cond := #in~cond; {94814#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:33,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {94814#(<= ~counter~0 12)} assume !(0 == ~cond); {94814#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:33,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {94814#(<= ~counter~0 12)} assume true; {94814#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:33,377 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94814#(<= ~counter~0 12)} {94814#(<= ~counter~0 12)} #96#return; {94814#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:33,377 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-15 15:15:33,378 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-15 15:15:33,378 INFO L290 TraceCheckUtils]: 114: Hoare triple {94839#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,378 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-15 15:15:33,379 INFO L290 TraceCheckUtils]: 116: Hoare triple {94839#(<= ~counter~0 13)} ~cond := #in~cond; {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,379 INFO L290 TraceCheckUtils]: 117: Hoare triple {94839#(<= ~counter~0 13)} assume !(0 == ~cond); {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,379 INFO L290 TraceCheckUtils]: 118: Hoare triple {94839#(<= ~counter~0 13)} assume true; {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,380 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94839#(<= ~counter~0 13)} {94839#(<= ~counter~0 13)} #96#return; {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,380 INFO L290 TraceCheckUtils]: 120: Hoare triple {94839#(<= ~counter~0 13)} assume !(~r~0 > 0); {94839#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:33,380 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-15 15:15:33,381 INFO L290 TraceCheckUtils]: 122: Hoare triple {94864#(<= |main_#t~post8| 13)} assume !(#t~post8 < 50);havoc #t~post8; {94483#false} is VALID [2022-04-15 15:15:33,381 INFO L290 TraceCheckUtils]: 123: Hoare triple {94483#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94483#false} is VALID [2022-04-15 15:15:33,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {94483#false} assume !(#t~post6 < 50);havoc #t~post6; {94483#false} is VALID [2022-04-15 15:15:33,381 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-15 15:15:33,381 INFO L290 TraceCheckUtils]: 126: Hoare triple {94483#false} ~cond := #in~cond; {94483#false} is VALID [2022-04-15 15:15:33,381 INFO L290 TraceCheckUtils]: 127: Hoare triple {94483#false} assume 0 == ~cond; {94483#false} is VALID [2022-04-15 15:15:33,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {94483#false} assume !false; {94483#false} is VALID [2022-04-15 15:15:33,381 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-15 15:15:33,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:34,148 INFO L290 TraceCheckUtils]: 128: Hoare triple {94483#false} assume !false; {94483#false} is VALID [2022-04-15 15:15:34,148 INFO L290 TraceCheckUtils]: 127: Hoare triple {94483#false} assume 0 == ~cond; {94483#false} is VALID [2022-04-15 15:15:34,148 INFO L290 TraceCheckUtils]: 126: Hoare triple {94483#false} ~cond := #in~cond; {94483#false} is VALID [2022-04-15 15:15:34,148 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-15 15:15:34,148 INFO L290 TraceCheckUtils]: 124: Hoare triple {94483#false} assume !(#t~post6 < 50);havoc #t~post6; {94483#false} is VALID [2022-04-15 15:15:34,148 INFO L290 TraceCheckUtils]: 123: Hoare triple {94483#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94483#false} is VALID [2022-04-15 15:15:34,148 INFO L290 TraceCheckUtils]: 122: Hoare triple {94904#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {94483#false} is VALID [2022-04-15 15:15:34,149 INFO L290 TraceCheckUtils]: 121: Hoare triple {94908#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94904#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:15:34,149 INFO L290 TraceCheckUtils]: 120: Hoare triple {94908#(< ~counter~0 50)} assume !(~r~0 > 0); {94908#(< ~counter~0 50)} is VALID [2022-04-15 15:15:34,150 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {94482#true} {94908#(< ~counter~0 50)} #96#return; {94908#(< ~counter~0 50)} is VALID [2022-04-15 15:15:34,150 INFO L290 TraceCheckUtils]: 118: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,150 INFO L290 TraceCheckUtils]: 117: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,150 INFO L290 TraceCheckUtils]: 116: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,150 INFO L272 TraceCheckUtils]: 115: Hoare triple {94908#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:15:34,150 INFO L290 TraceCheckUtils]: 114: Hoare triple {94908#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {94908#(< ~counter~0 50)} is VALID [2022-04-15 15:15:34,152 INFO L290 TraceCheckUtils]: 113: Hoare triple {94933#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94908#(< ~counter~0 50)} is VALID [2022-04-15 15:15:34,152 INFO L290 TraceCheckUtils]: 112: Hoare triple {94933#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {94933#(< ~counter~0 49)} is VALID [2022-04-15 15:15:34,153 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94482#true} {94933#(< ~counter~0 49)} #96#return; {94933#(< ~counter~0 49)} is VALID [2022-04-15 15:15:34,153 INFO L290 TraceCheckUtils]: 110: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,153 INFO L290 TraceCheckUtils]: 109: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,153 INFO L290 TraceCheckUtils]: 108: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,153 INFO L272 TraceCheckUtils]: 107: Hoare triple {94933#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:15:34,153 INFO L290 TraceCheckUtils]: 106: Hoare triple {94933#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {94933#(< ~counter~0 49)} is VALID [2022-04-15 15:15:34,154 INFO L290 TraceCheckUtils]: 105: Hoare triple {94958#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94933#(< ~counter~0 49)} is VALID [2022-04-15 15:15:34,154 INFO L290 TraceCheckUtils]: 104: Hoare triple {94958#(< ~counter~0 48)} assume !!(0 != ~r~0); {94958#(< ~counter~0 48)} is VALID [2022-04-15 15:15:34,155 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94482#true} {94958#(< ~counter~0 48)} #94#return; {94958#(< ~counter~0 48)} is VALID [2022-04-15 15:15:34,155 INFO L290 TraceCheckUtils]: 102: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,155 INFO L290 TraceCheckUtils]: 101: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,155 INFO L290 TraceCheckUtils]: 100: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,155 INFO L272 TraceCheckUtils]: 99: Hoare triple {94958#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:15:34,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {94958#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {94958#(< ~counter~0 48)} is VALID [2022-04-15 15:15:34,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {94983#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94958#(< ~counter~0 48)} is VALID [2022-04-15 15:15:34,157 INFO L290 TraceCheckUtils]: 96: Hoare triple {94983#(< ~counter~0 47)} assume !(~r~0 < 0); {94983#(< ~counter~0 47)} is VALID [2022-04-15 15:15:34,157 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94482#true} {94983#(< ~counter~0 47)} #98#return; {94983#(< ~counter~0 47)} is VALID [2022-04-15 15:15:34,157 INFO L290 TraceCheckUtils]: 94: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,157 INFO L290 TraceCheckUtils]: 92: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,157 INFO L272 TraceCheckUtils]: 91: Hoare triple {94983#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:15:34,159 INFO L290 TraceCheckUtils]: 90: Hoare triple {94983#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {94983#(< ~counter~0 47)} is VALID [2022-04-15 15:15:34,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {95008#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94983#(< ~counter~0 47)} is VALID [2022-04-15 15:15:34,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {95008#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95008#(< ~counter~0 46)} is VALID [2022-04-15 15:15:34,161 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94482#true} {95008#(< ~counter~0 46)} #98#return; {95008#(< ~counter~0 46)} is VALID [2022-04-15 15:15:34,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,162 INFO L272 TraceCheckUtils]: 83: Hoare triple {95008#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:15:34,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {95008#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {95008#(< ~counter~0 46)} is VALID [2022-04-15 15:15:34,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {95033#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95008#(< ~counter~0 46)} is VALID [2022-04-15 15:15:34,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {95033#(< ~counter~0 45)} assume !(~r~0 > 0); {95033#(< ~counter~0 45)} is VALID [2022-04-15 15:15:34,164 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94482#true} {95033#(< ~counter~0 45)} #96#return; {95033#(< ~counter~0 45)} is VALID [2022-04-15 15:15:34,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,165 INFO L290 TraceCheckUtils]: 76: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,165 INFO L272 TraceCheckUtils]: 75: Hoare triple {95033#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:15:34,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {95033#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {95033#(< ~counter~0 45)} is VALID [2022-04-15 15:15:34,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {95058#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95033#(< ~counter~0 45)} is VALID [2022-04-15 15:15:34,166 INFO L290 TraceCheckUtils]: 72: Hoare triple {95058#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95058#(< ~counter~0 44)} is VALID [2022-04-15 15:15:34,167 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94482#true} {95058#(< ~counter~0 44)} #96#return; {95058#(< ~counter~0 44)} is VALID [2022-04-15 15:15:34,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,167 INFO L290 TraceCheckUtils]: 69: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,168 INFO L272 TraceCheckUtils]: 67: Hoare triple {95058#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:15:34,168 INFO L290 TraceCheckUtils]: 66: Hoare triple {95058#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {95058#(< ~counter~0 44)} is VALID [2022-04-15 15:15:34,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {95083#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95058#(< ~counter~0 44)} is VALID [2022-04-15 15:15:34,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {95083#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95083#(< ~counter~0 43)} is VALID [2022-04-15 15:15:34,170 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94482#true} {95083#(< ~counter~0 43)} #96#return; {95083#(< ~counter~0 43)} is VALID [2022-04-15 15:15:34,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,170 INFO L290 TraceCheckUtils]: 60: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,170 INFO L272 TraceCheckUtils]: 59: Hoare triple {95083#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:15:34,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {95083#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {95083#(< ~counter~0 43)} is VALID [2022-04-15 15:15:34,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {95108#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95083#(< ~counter~0 43)} is VALID [2022-04-15 15:15:34,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {95108#(< ~counter~0 42)} assume !!(0 != ~r~0); {95108#(< ~counter~0 42)} is VALID [2022-04-15 15:15:34,173 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94482#true} {95108#(< ~counter~0 42)} #94#return; {95108#(< ~counter~0 42)} is VALID [2022-04-15 15:15:34,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,173 INFO L272 TraceCheckUtils]: 51: Hoare triple {95108#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:15:34,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {95108#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {95108#(< ~counter~0 42)} is VALID [2022-04-15 15:15:34,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {95133#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95108#(< ~counter~0 42)} is VALID [2022-04-15 15:15:34,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {95133#(< ~counter~0 41)} assume !(~r~0 < 0); {95133#(< ~counter~0 41)} is VALID [2022-04-15 15:15:34,176 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94482#true} {95133#(< ~counter~0 41)} #98#return; {95133#(< ~counter~0 41)} is VALID [2022-04-15 15:15:34,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,176 INFO L272 TraceCheckUtils]: 43: Hoare triple {95133#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:15:34,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {95133#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {95133#(< ~counter~0 41)} is VALID [2022-04-15 15:15:34,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {95158#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95133#(< ~counter~0 41)} is VALID [2022-04-15 15:15:34,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {95158#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95158#(< ~counter~0 40)} is VALID [2022-04-15 15:15:34,179 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94482#true} {95158#(< ~counter~0 40)} #98#return; {95158#(< ~counter~0 40)} is VALID [2022-04-15 15:15:34,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,179 INFO L272 TraceCheckUtils]: 35: Hoare triple {95158#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:15:34,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {95158#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {95158#(< ~counter~0 40)} is VALID [2022-04-15 15:15:34,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {95183#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95158#(< ~counter~0 40)} is VALID [2022-04-15 15:15:34,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {95183#(< ~counter~0 39)} assume !(~r~0 > 0); {95183#(< ~counter~0 39)} is VALID [2022-04-15 15:15:34,182 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94482#true} {95183#(< ~counter~0 39)} #96#return; {95183#(< ~counter~0 39)} is VALID [2022-04-15 15:15:34,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,182 INFO L272 TraceCheckUtils]: 27: Hoare triple {95183#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:15:34,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {95183#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {95183#(< ~counter~0 39)} is VALID [2022-04-15 15:15:34,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {95208#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95183#(< ~counter~0 39)} is VALID [2022-04-15 15:15:34,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {95208#(< ~counter~0 38)} assume !!(0 != ~r~0); {95208#(< ~counter~0 38)} is VALID [2022-04-15 15:15:34,185 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94482#true} {95208#(< ~counter~0 38)} #94#return; {95208#(< ~counter~0 38)} is VALID [2022-04-15 15:15:34,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,185 INFO L272 TraceCheckUtils]: 19: Hoare triple {95208#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:15:34,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {95208#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {95208#(< ~counter~0 38)} is VALID [2022-04-15 15:15:34,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {95233#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95208#(< ~counter~0 38)} is VALID [2022-04-15 15:15:34,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {95233#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,188 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94482#true} {95233#(< ~counter~0 37)} #92#return; {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,188 INFO L272 TraceCheckUtils]: 11: Hoare triple {95233#(< ~counter~0 37)} call assume_abort_if_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-15 15:15:34,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94482#true} {95233#(< ~counter~0 37)} #90#return; {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {94482#true} assume true; {94482#true} is VALID [2022-04-15 15:15:34,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {94482#true} assume !(0 == ~cond); {94482#true} is VALID [2022-04-15 15:15:34,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {94482#true} ~cond := #in~cond; {94482#true} is VALID [2022-04-15 15:15:34,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {95233#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94482#true} is VALID [2022-04-15 15:15:34,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {95233#(< ~counter~0 37)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 37)} is VALID [2022-04-15 15:15:34,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {95233#(< ~counter~0 37)} call #t~ret9 := main(); {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95233#(< ~counter~0 37)} {94482#true} #102#return; {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {95233#(< ~counter~0 37)} assume true; {95233#(< ~counter~0 37)} is VALID [2022-04-15 15:15:34,191 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 37)} is VALID [2022-04-15 15:15:34,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {94482#true} call ULTIMATE.init(); {94482#true} is VALID [2022-04-15 15:15:34,192 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-15 15:15:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:34,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345466049] [2022-04-15 15:15:34,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:34,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813321658] [2022-04-15 15:15:34,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813321658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:34,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:34,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:15:34,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:34,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550943531] [2022-04-15 15:15:34,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550943531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:34,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:34,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:15:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595840970] [2022-04-15 15:15:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:34,196 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-15 15:15:34,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:34,196 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-15 15:15:34,306 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-15 15:15:34,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:15:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:15:34,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:15:34,307 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-15 15:15:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:37,746 INFO L93 Difference]: Finished difference Result 893 states and 1247 transitions. [2022-04-15 15:15:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 15:15:37,746 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-15 15:15:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:37,746 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-15 15:15:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:15:37,748 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-15 15:15:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:15:37,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-15 15:15:38,006 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-15 15:15:38,029 INFO L225 Difference]: With dead ends: 893 [2022-04-15 15:15:38,029 INFO L226 Difference]: Without dead ends: 700 [2022-04-15 15:15:38,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 15:15:38,031 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 245 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:38,031 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.4s Time] [2022-04-15 15:15:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-04-15 15:15:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 690. [2022-04-15 15:15:40,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:40,126 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-15 15:15:40,126 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-15 15:15:40,127 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-15 15:15:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:40,143 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-15 15:15:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-15 15:15:40,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:40,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:40,145 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-15 15:15:40,145 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-15 15:15:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:40,161 INFO L93 Difference]: Finished difference Result 700 states and 946 transitions. [2022-04-15 15:15:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2022-04-15 15:15:40,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:40,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:40,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:40,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:40,163 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-15 15:15:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 936 transitions. [2022-04-15 15:15:40,191 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 936 transitions. Word has length 129 [2022-04-15 15:15:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:40,191 INFO L478 AbstractCegarLoop]: Abstraction has 690 states and 936 transitions. [2022-04-15 15:15:40,191 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-15 15:15:40,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 690 states and 936 transitions. [2022-04-15 15:15:43,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 936 edges. 936 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 936 transitions. [2022-04-15 15:15:43,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 15:15:43,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:43,010 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-15 15:15:43,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 15:15:43,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-15 15:15:43,211 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-15 15:15:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002543663] [2022-04-15 15:15:43,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-15 15:15:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487272593] [2022-04-15 15:15:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:43,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:43,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768842060] [2022-04-15 15:15:43,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:15:43,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:43,226 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-15 15:15:43,231 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-15 15:15:43,406 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:15:43,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:43,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:15:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:43,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:44,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {99875#true} call ULTIMATE.init(); {99875#true} is VALID [2022-04-15 15:15:44,072 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-15 15:15:44,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99883#(<= ~counter~0 0)} {99875#true} #102#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {99883#(<= ~counter~0 0)} call #t~ret9 := main(); {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,073 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-15 15:15:44,073 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-15 15:15:44,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {99883#(<= ~counter~0 0)} ~cond := #in~cond; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {99883#(<= ~counter~0 0)} assume !(0 == ~cond); {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,075 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99883#(<= ~counter~0 0)} {99883#(<= ~counter~0 0)} #90#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,075 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-15 15:15:44,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {99883#(<= ~counter~0 0)} ~cond := #in~cond; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {99883#(<= ~counter~0 0)} assume !(0 == ~cond); {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {99883#(<= ~counter~0 0)} assume true; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,076 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99883#(<= ~counter~0 0)} {99883#(<= ~counter~0 0)} #92#return; {99883#(<= ~counter~0 0)} is VALID [2022-04-15 15:15:44,076 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-15 15:15:44,078 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-15 15:15:44,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {99932#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,079 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-15 15:15:44,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {99932#(<= ~counter~0 1)} ~cond := #in~cond; {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {99932#(<= ~counter~0 1)} assume !(0 == ~cond); {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {99932#(<= ~counter~0 1)} assume true; {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99932#(<= ~counter~0 1)} {99932#(<= ~counter~0 1)} #94#return; {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {99932#(<= ~counter~0 1)} assume !!(0 != ~r~0); {99932#(<= ~counter~0 1)} is VALID [2022-04-15 15:15:44,082 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-15 15:15:44,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {99957#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,082 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-15 15:15:44,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {99957#(<= ~counter~0 2)} ~cond := #in~cond; {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {99957#(<= ~counter~0 2)} assume !(0 == ~cond); {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {99957#(<= ~counter~0 2)} assume true; {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,084 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99957#(<= ~counter~0 2)} {99957#(<= ~counter~0 2)} #96#return; {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {99957#(<= ~counter~0 2)} assume !(~r~0 > 0); {99957#(<= ~counter~0 2)} is VALID [2022-04-15 15:15:44,085 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-15 15:15:44,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {99982#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {99982#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:44,086 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-15 15:15:44,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {99982#(<= ~counter~0 3)} ~cond := #in~cond; {99982#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:44,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {99982#(<= ~counter~0 3)} assume !(0 == ~cond); {99982#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:44,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {99982#(<= ~counter~0 3)} assume true; {99982#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:44,088 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99982#(<= ~counter~0 3)} {99982#(<= ~counter~0 3)} #98#return; {99982#(<= ~counter~0 3)} is VALID [2022-04-15 15:15:44,088 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-15 15:15:44,104 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-15 15:15:44,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {100007#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,106 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-15 15:15:44,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {100007#(<= ~counter~0 4)} ~cond := #in~cond; {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {100007#(<= ~counter~0 4)} assume !(0 == ~cond); {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {100007#(<= ~counter~0 4)} assume true; {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,107 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100007#(<= ~counter~0 4)} {100007#(<= ~counter~0 4)} #98#return; {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {100007#(<= ~counter~0 4)} assume !(~r~0 < 0); {100007#(<= ~counter~0 4)} is VALID [2022-04-15 15:15:44,109 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-15 15:15:44,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {100032#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,110 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-15 15:15:44,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {100032#(<= ~counter~0 5)} ~cond := #in~cond; {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {100032#(<= ~counter~0 5)} assume !(0 == ~cond); {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {100032#(<= ~counter~0 5)} assume true; {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,111 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100032#(<= ~counter~0 5)} {100032#(<= ~counter~0 5)} #94#return; {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {100032#(<= ~counter~0 5)} assume !!(0 != ~r~0); {100032#(<= ~counter~0 5)} is VALID [2022-04-15 15:15:44,113 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-15 15:15:44,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {100057#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {100057#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:44,114 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-15 15:15:44,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {100057#(<= ~counter~0 6)} ~cond := #in~cond; {100057#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:44,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {100057#(<= ~counter~0 6)} assume !(0 == ~cond); {100057#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:44,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {100057#(<= ~counter~0 6)} assume true; {100057#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:44,115 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100057#(<= ~counter~0 6)} {100057#(<= ~counter~0 6)} #96#return; {100057#(<= ~counter~0 6)} is VALID [2022-04-15 15:15:44,116 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-15 15:15:44,117 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-15 15:15:44,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {100082#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {100082#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:44,118 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-15 15:15:44,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {100082#(<= ~counter~0 7)} ~cond := #in~cond; {100082#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:44,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {100082#(<= ~counter~0 7)} assume !(0 == ~cond); {100082#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:44,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {100082#(<= ~counter~0 7)} assume true; {100082#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:44,119 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100082#(<= ~counter~0 7)} {100082#(<= ~counter~0 7)} #96#return; {100082#(<= ~counter~0 7)} is VALID [2022-04-15 15:15:44,120 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-15 15:15:44,121 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-15 15:15:44,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {100107#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,122 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-15 15:15:44,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {100107#(<= ~counter~0 8)} ~cond := #in~cond; {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {100107#(<= ~counter~0 8)} assume !(0 == ~cond); {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {100107#(<= ~counter~0 8)} assume true; {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,123 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100107#(<= ~counter~0 8)} {100107#(<= ~counter~0 8)} #96#return; {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {100107#(<= ~counter~0 8)} assume !(~r~0 > 0); {100107#(<= ~counter~0 8)} is VALID [2022-04-15 15:15:44,125 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-15 15:15:44,125 INFO L290 TraceCheckUtils]: 82: Hoare triple {100132#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {100132#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:44,126 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-15 15:15:44,126 INFO L290 TraceCheckUtils]: 84: Hoare triple {100132#(<= ~counter~0 9)} ~cond := #in~cond; {100132#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:44,126 INFO L290 TraceCheckUtils]: 85: Hoare triple {100132#(<= ~counter~0 9)} assume !(0 == ~cond); {100132#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:44,127 INFO L290 TraceCheckUtils]: 86: Hoare triple {100132#(<= ~counter~0 9)} assume true; {100132#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:44,127 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100132#(<= ~counter~0 9)} {100132#(<= ~counter~0 9)} #98#return; {100132#(<= ~counter~0 9)} is VALID [2022-04-15 15:15:44,128 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-15 15:15:44,129 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-15 15:15:44,129 INFO L290 TraceCheckUtils]: 90: Hoare triple {100157#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,130 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-15 15:15:44,130 INFO L290 TraceCheckUtils]: 92: Hoare triple {100157#(<= ~counter~0 10)} ~cond := #in~cond; {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,130 INFO L290 TraceCheckUtils]: 93: Hoare triple {100157#(<= ~counter~0 10)} assume !(0 == ~cond); {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,131 INFO L290 TraceCheckUtils]: 94: Hoare triple {100157#(<= ~counter~0 10)} assume true; {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,131 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100157#(<= ~counter~0 10)} {100157#(<= ~counter~0 10)} #98#return; {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,132 INFO L290 TraceCheckUtils]: 96: Hoare triple {100157#(<= ~counter~0 10)} assume !(~r~0 < 0); {100157#(<= ~counter~0 10)} is VALID [2022-04-15 15:15:44,133 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-15 15:15:44,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {100182#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,134 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-15 15:15:44,134 INFO L290 TraceCheckUtils]: 100: Hoare triple {100182#(<= ~counter~0 11)} ~cond := #in~cond; {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,134 INFO L290 TraceCheckUtils]: 101: Hoare triple {100182#(<= ~counter~0 11)} assume !(0 == ~cond); {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,135 INFO L290 TraceCheckUtils]: 102: Hoare triple {100182#(<= ~counter~0 11)} assume true; {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,135 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100182#(<= ~counter~0 11)} {100182#(<= ~counter~0 11)} #94#return; {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,136 INFO L290 TraceCheckUtils]: 104: Hoare triple {100182#(<= ~counter~0 11)} assume !!(0 != ~r~0); {100182#(<= ~counter~0 11)} is VALID [2022-04-15 15:15:44,137 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-15 15:15:44,137 INFO L290 TraceCheckUtils]: 106: Hoare triple {100207#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {100207#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:44,138 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-15 15:15:44,138 INFO L290 TraceCheckUtils]: 108: Hoare triple {100207#(<= ~counter~0 12)} ~cond := #in~cond; {100207#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:44,139 INFO L290 TraceCheckUtils]: 109: Hoare triple {100207#(<= ~counter~0 12)} assume !(0 == ~cond); {100207#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:44,139 INFO L290 TraceCheckUtils]: 110: Hoare triple {100207#(<= ~counter~0 12)} assume true; {100207#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:44,140 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100207#(<= ~counter~0 12)} {100207#(<= ~counter~0 12)} #96#return; {100207#(<= ~counter~0 12)} is VALID [2022-04-15 15:15:44,140 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-15 15:15:44,141 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-15 15:15:44,141 INFO L290 TraceCheckUtils]: 114: Hoare triple {100232#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {100232#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:44,142 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-15 15:15:44,142 INFO L290 TraceCheckUtils]: 116: Hoare triple {100232#(<= ~counter~0 13)} ~cond := #in~cond; {100232#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:44,143 INFO L290 TraceCheckUtils]: 117: Hoare triple {100232#(<= ~counter~0 13)} assume !(0 == ~cond); {100232#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:44,143 INFO L290 TraceCheckUtils]: 118: Hoare triple {100232#(<= ~counter~0 13)} assume true; {100232#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:44,144 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100232#(<= ~counter~0 13)} {100232#(<= ~counter~0 13)} #96#return; {100232#(<= ~counter~0 13)} is VALID [2022-04-15 15:15:44,144 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-15 15:15:44,144 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-15 15:15:44,145 INFO L290 TraceCheckUtils]: 122: Hoare triple {100257#(<= |main_#t~post7| 13)} assume !(#t~post7 < 50);havoc #t~post7; {99876#false} is VALID [2022-04-15 15:15:44,145 INFO L290 TraceCheckUtils]: 123: Hoare triple {99876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99876#false} is VALID [2022-04-15 15:15:44,145 INFO L290 TraceCheckUtils]: 124: Hoare triple {99876#false} assume !(#t~post8 < 50);havoc #t~post8; {99876#false} is VALID [2022-04-15 15:15:44,145 INFO L290 TraceCheckUtils]: 125: Hoare triple {99876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99876#false} is VALID [2022-04-15 15:15:44,145 INFO L290 TraceCheckUtils]: 126: Hoare triple {99876#false} assume !(#t~post6 < 50);havoc #t~post6; {99876#false} is VALID [2022-04-15 15:15:44,145 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-15 15:15:44,145 INFO L290 TraceCheckUtils]: 128: Hoare triple {99876#false} ~cond := #in~cond; {99876#false} is VALID [2022-04-15 15:15:44,145 INFO L290 TraceCheckUtils]: 129: Hoare triple {99876#false} assume 0 == ~cond; {99876#false} is VALID [2022-04-15 15:15:44,146 INFO L290 TraceCheckUtils]: 130: Hoare triple {99876#false} assume !false; {99876#false} is VALID [2022-04-15 15:15:44,146 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-15 15:15:44,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 130: Hoare triple {99876#false} assume !false; {99876#false} is VALID [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 129: Hoare triple {99876#false} assume 0 == ~cond; {99876#false} is VALID [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 128: Hoare triple {99876#false} ~cond := #in~cond; {99876#false} is VALID [2022-04-15 15:15:44,906 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-15 15:15:44,906 INFO L290 TraceCheckUtils]: 126: Hoare triple {99876#false} assume !(#t~post6 < 50);havoc #t~post6; {99876#false} is VALID [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 125: Hoare triple {99876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {99876#false} is VALID [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 124: Hoare triple {99876#false} assume !(#t~post8 < 50);havoc #t~post8; {99876#false} is VALID [2022-04-15 15:15:44,906 INFO L290 TraceCheckUtils]: 123: Hoare triple {99876#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {99876#false} is VALID [2022-04-15 15:15:44,907 INFO L290 TraceCheckUtils]: 122: Hoare triple {100309#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {99876#false} is VALID [2022-04-15 15:15:44,907 INFO L290 TraceCheckUtils]: 121: Hoare triple {100313#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100309#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:15:44,907 INFO L290 TraceCheckUtils]: 120: Hoare triple {100313#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100313#(< ~counter~0 50)} is VALID [2022-04-15 15:15:44,908 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {99875#true} {100313#(< ~counter~0 50)} #96#return; {100313#(< ~counter~0 50)} is VALID [2022-04-15 15:15:44,908 INFO L290 TraceCheckUtils]: 118: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,908 INFO L290 TraceCheckUtils]: 117: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,908 INFO L290 TraceCheckUtils]: 116: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,908 INFO L272 TraceCheckUtils]: 115: Hoare triple {100313#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:15:44,908 INFO L290 TraceCheckUtils]: 114: Hoare triple {100313#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {100313#(< ~counter~0 50)} is VALID [2022-04-15 15:15:44,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {100338#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100313#(< ~counter~0 50)} is VALID [2022-04-15 15:15:44,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {100338#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100338#(< ~counter~0 49)} is VALID [2022-04-15 15:15:44,911 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {99875#true} {100338#(< ~counter~0 49)} #96#return; {100338#(< ~counter~0 49)} is VALID [2022-04-15 15:15:44,911 INFO L290 TraceCheckUtils]: 110: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,911 INFO L290 TraceCheckUtils]: 109: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,911 INFO L290 TraceCheckUtils]: 108: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,911 INFO L272 TraceCheckUtils]: 107: Hoare triple {100338#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:15:44,912 INFO L290 TraceCheckUtils]: 106: Hoare triple {100338#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {100338#(< ~counter~0 49)} is VALID [2022-04-15 15:15:44,912 INFO L290 TraceCheckUtils]: 105: Hoare triple {100363#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100338#(< ~counter~0 49)} is VALID [2022-04-15 15:15:44,913 INFO L290 TraceCheckUtils]: 104: Hoare triple {100363#(< ~counter~0 48)} assume !!(0 != ~r~0); {100363#(< ~counter~0 48)} is VALID [2022-04-15 15:15:44,913 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {99875#true} {100363#(< ~counter~0 48)} #94#return; {100363#(< ~counter~0 48)} is VALID [2022-04-15 15:15:44,913 INFO L290 TraceCheckUtils]: 102: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,913 INFO L290 TraceCheckUtils]: 101: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,913 INFO L290 TraceCheckUtils]: 100: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,914 INFO L272 TraceCheckUtils]: 99: Hoare triple {100363#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:15:44,914 INFO L290 TraceCheckUtils]: 98: Hoare triple {100363#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {100363#(< ~counter~0 48)} is VALID [2022-04-15 15:15:44,915 INFO L290 TraceCheckUtils]: 97: Hoare triple {100388#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100363#(< ~counter~0 48)} is VALID [2022-04-15 15:15:44,915 INFO L290 TraceCheckUtils]: 96: Hoare triple {100388#(< ~counter~0 47)} assume !(~r~0 < 0); {100388#(< ~counter~0 47)} is VALID [2022-04-15 15:15:44,915 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {99875#true} {100388#(< ~counter~0 47)} #98#return; {100388#(< ~counter~0 47)} is VALID [2022-04-15 15:15:44,916 INFO L290 TraceCheckUtils]: 94: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,916 INFO L290 TraceCheckUtils]: 93: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,916 INFO L290 TraceCheckUtils]: 92: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,916 INFO L272 TraceCheckUtils]: 91: Hoare triple {100388#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:15:44,916 INFO L290 TraceCheckUtils]: 90: Hoare triple {100388#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {100388#(< ~counter~0 47)} is VALID [2022-04-15 15:15:44,917 INFO L290 TraceCheckUtils]: 89: Hoare triple {100413#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100388#(< ~counter~0 47)} is VALID [2022-04-15 15:15:44,917 INFO L290 TraceCheckUtils]: 88: Hoare triple {100413#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100413#(< ~counter~0 46)} is VALID [2022-04-15 15:15:44,918 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {99875#true} {100413#(< ~counter~0 46)} #98#return; {100413#(< ~counter~0 46)} is VALID [2022-04-15 15:15:44,918 INFO L290 TraceCheckUtils]: 86: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,918 INFO L290 TraceCheckUtils]: 84: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,918 INFO L272 TraceCheckUtils]: 83: Hoare triple {100413#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:15:44,918 INFO L290 TraceCheckUtils]: 82: Hoare triple {100413#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {100413#(< ~counter~0 46)} is VALID [2022-04-15 15:15:44,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {100438#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100413#(< ~counter~0 46)} is VALID [2022-04-15 15:15:44,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {100438#(< ~counter~0 45)} assume !(~r~0 > 0); {100438#(< ~counter~0 45)} is VALID [2022-04-15 15:15:44,920 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {99875#true} {100438#(< ~counter~0 45)} #96#return; {100438#(< ~counter~0 45)} is VALID [2022-04-15 15:15:44,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,920 INFO L290 TraceCheckUtils]: 77: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,920 INFO L290 TraceCheckUtils]: 76: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,920 INFO L272 TraceCheckUtils]: 75: Hoare triple {100438#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:15:44,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {100438#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {100438#(< ~counter~0 45)} is VALID [2022-04-15 15:15:44,921 INFO L290 TraceCheckUtils]: 73: Hoare triple {100463#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100438#(< ~counter~0 45)} is VALID [2022-04-15 15:15:44,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {100463#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100463#(< ~counter~0 44)} is VALID [2022-04-15 15:15:44,922 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {99875#true} {100463#(< ~counter~0 44)} #96#return; {100463#(< ~counter~0 44)} is VALID [2022-04-15 15:15:44,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,922 INFO L272 TraceCheckUtils]: 67: Hoare triple {100463#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:15:44,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {100463#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {100463#(< ~counter~0 44)} is VALID [2022-04-15 15:15:44,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {100488#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100463#(< ~counter~0 44)} is VALID [2022-04-15 15:15:44,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {100488#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100488#(< ~counter~0 43)} is VALID [2022-04-15 15:15:44,924 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {99875#true} {100488#(< ~counter~0 43)} #96#return; {100488#(< ~counter~0 43)} is VALID [2022-04-15 15:15:44,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,924 INFO L272 TraceCheckUtils]: 59: Hoare triple {100488#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:15:44,925 INFO L290 TraceCheckUtils]: 58: Hoare triple {100488#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {100488#(< ~counter~0 43)} is VALID [2022-04-15 15:15:44,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {100513#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100488#(< ~counter~0 43)} is VALID [2022-04-15 15:15:44,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {100513#(< ~counter~0 42)} assume !!(0 != ~r~0); {100513#(< ~counter~0 42)} is VALID [2022-04-15 15:15:44,926 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {99875#true} {100513#(< ~counter~0 42)} #94#return; {100513#(< ~counter~0 42)} is VALID [2022-04-15 15:15:44,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,927 INFO L272 TraceCheckUtils]: 51: Hoare triple {100513#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:15:44,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {100513#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {100513#(< ~counter~0 42)} is VALID [2022-04-15 15:15:44,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {100538#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100513#(< ~counter~0 42)} is VALID [2022-04-15 15:15:44,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {100538#(< ~counter~0 41)} assume !(~r~0 < 0); {100538#(< ~counter~0 41)} is VALID [2022-04-15 15:15:44,929 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {99875#true} {100538#(< ~counter~0 41)} #98#return; {100538#(< ~counter~0 41)} is VALID [2022-04-15 15:15:44,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,929 INFO L272 TraceCheckUtils]: 43: Hoare triple {100538#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:15:44,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {100538#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {100538#(< ~counter~0 41)} is VALID [2022-04-15 15:15:44,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {100563#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100538#(< ~counter~0 41)} is VALID [2022-04-15 15:15:44,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {100563#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100563#(< ~counter~0 40)} is VALID [2022-04-15 15:15:44,931 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {99875#true} {100563#(< ~counter~0 40)} #98#return; {100563#(< ~counter~0 40)} is VALID [2022-04-15 15:15:44,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,931 INFO L272 TraceCheckUtils]: 35: Hoare triple {100563#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:15:44,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {100563#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {100563#(< ~counter~0 40)} is VALID [2022-04-15 15:15:44,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {100588#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100563#(< ~counter~0 40)} is VALID [2022-04-15 15:15:44,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {100588#(< ~counter~0 39)} assume !(~r~0 > 0); {100588#(< ~counter~0 39)} is VALID [2022-04-15 15:15:44,933 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {99875#true} {100588#(< ~counter~0 39)} #96#return; {100588#(< ~counter~0 39)} is VALID [2022-04-15 15:15:44,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,933 INFO L272 TraceCheckUtils]: 27: Hoare triple {100588#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:15:44,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {100588#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {100588#(< ~counter~0 39)} is VALID [2022-04-15 15:15:44,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {100613#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100588#(< ~counter~0 39)} is VALID [2022-04-15 15:15:44,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {100613#(< ~counter~0 38)} assume !!(0 != ~r~0); {100613#(< ~counter~0 38)} is VALID [2022-04-15 15:15:44,935 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {99875#true} {100613#(< ~counter~0 38)} #94#return; {100613#(< ~counter~0 38)} is VALID [2022-04-15 15:15:44,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {100613#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:15:44,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {100613#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {100613#(< ~counter~0 38)} is VALID [2022-04-15 15:15:44,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {100638#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100613#(< ~counter~0 38)} is VALID [2022-04-15 15:15:44,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {100638#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {99875#true} {100638#(< ~counter~0 37)} #92#return; {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,938 INFO L272 TraceCheckUtils]: 11: Hoare triple {100638#(< ~counter~0 37)} call assume_abort_if_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-15 15:15:44,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {99875#true} {100638#(< ~counter~0 37)} #90#return; {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {99875#true} assume true; {99875#true} is VALID [2022-04-15 15:15:44,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {99875#true} assume !(0 == ~cond); {99875#true} is VALID [2022-04-15 15:15:44,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {99875#true} ~cond := #in~cond; {99875#true} is VALID [2022-04-15 15:15:44,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {100638#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {99875#true} is VALID [2022-04-15 15:15:44,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {100638#(< ~counter~0 37)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 37)} is VALID [2022-04-15 15:15:44,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {100638#(< ~counter~0 37)} call #t~ret9 := main(); {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100638#(< ~counter~0 37)} {99875#true} #102#return; {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {100638#(< ~counter~0 37)} assume true; {100638#(< ~counter~0 37)} is VALID [2022-04-15 15:15:44,940 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 37)} is VALID [2022-04-15 15:15:44,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {99875#true} call ULTIMATE.init(); {99875#true} is VALID [2022-04-15 15:15:44,940 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-15 15:15:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:44,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487272593] [2022-04-15 15:15:44,941 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768842060] [2022-04-15 15:15:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768842060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:15:44,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:15:44,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:15:44,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002543663] [2022-04-15 15:15:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002543663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:44,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:44,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:15:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321444309] [2022-04-15 15:15:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:44,942 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-15 15:15:44,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:44,942 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-15 15:15:45,049 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-15 15:15:45,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:15:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:15:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:15:45,050 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-15 15:15:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:48,484 INFO L93 Difference]: Finished difference Result 903 states and 1260 transitions. [2022-04-15 15:15:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:15:48,485 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-15 15:15:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:48,485 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-15 15:15:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:15:48,487 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-15 15:15:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:15:48,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-15 15:15:48,783 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-15 15:15:48,803 INFO L225 Difference]: With dead ends: 903 [2022-04-15 15:15:48,803 INFO L226 Difference]: Without dead ends: 706 [2022-04-15 15:15:48,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 15:15:48,804 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-15 15:15:48,804 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-15 15:15:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-04-15 15:15:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-04-15 15:15:51,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:51,028 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-15 15:15:51,029 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-15 15:15:51,029 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-15 15:15:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:51,045 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-15 15:15:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-15 15:15:51,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:51,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:51,046 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-15 15:15:51,047 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-15 15:15:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:51,062 INFO L93 Difference]: Finished difference Result 706 states and 952 transitions. [2022-04-15 15:15:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-15 15:15:51,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:51,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:51,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:51,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:51,064 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-15 15:15:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 952 transitions. [2022-04-15 15:15:51,086 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 952 transitions. Word has length 131 [2022-04-15 15:15:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:51,086 INFO L478 AbstractCegarLoop]: Abstraction has 706 states and 952 transitions. [2022-04-15 15:15:51,086 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-15 15:15:51,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 706 states and 952 transitions. [2022-04-15 15:15:54,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 952 edges. 952 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 952 transitions. [2022-04-15 15:15:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:15:54,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:54,425 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-15 15:15:54,430 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-15 15:15:54,626 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-15 15:15:54,626 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-15 15:15:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661988954] [2022-04-15 15:15:54,627 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:54,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-15 15:15:54,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372940407] [2022-04-15 15:15:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:54,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:54,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:54,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184154630] [2022-04-15 15:15:54,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:15:54,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:54,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:54,641 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-15 15:15:54,644 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-15 15:15:54,728 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:15:54,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:54,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:15:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:54,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:15:55,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {105346#true} call ULTIMATE.init(); {105346#true} is VALID [2022-04-15 15:15:55,373 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-15 15:15:55,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105346#true} {105346#true} #102#return; {105346#true} is VALID [2022-04-15 15:15:55,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {105346#true} call #t~ret9 := main(); {105346#true} is VALID [2022-04-15 15:15:55,373 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-15 15:15:55,373 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-15 15:15:55,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105346#true} {105346#true} #90#return; {105346#true} is VALID [2022-04-15 15:15:55,374 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-15 15:15:55,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105346#true} {105346#true} #92#return; {105346#true} is VALID [2022-04-15 15:15:55,374 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-15 15:15:55,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {105346#true} assume !!(#t~post6 < 50);havoc #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,374 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-15 15:15:55,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-15 15:15:55,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,375 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-15 15:15:55,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 30: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {105346#true} assume !(~r~0 > 0); {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {105346#true} assume !!(#t~post8 < 50);havoc #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,375 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-15 15:15:55,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,375 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-15 15:15:55,376 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-15 15:15:55,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {105346#true} assume !!(#t~post8 < 50);havoc #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,376 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-15 15:15:55,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {105346#true} assume !(~r~0 < 0); {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {105346#true} assume !!(#t~post6 < 50);havoc #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,376 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-15 15:15:55,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,376 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,377 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-15 15:15:55,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,377 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-15 15:15:55,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,377 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-15 15:15:55,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,377 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,378 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-15 15:15:55,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,378 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-15 15:15:55,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {105346#true} assume !(~r~0 > 0); {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 82: Hoare triple {105346#true} assume !!(#t~post8 < 50);havoc #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,378 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-15 15:15:55,378 INFO L290 TraceCheckUtils]: 84: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 85: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,378 INFO L290 TraceCheckUtils]: 86: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-15 15:15:55,379 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-15 15:15:55,379 INFO L290 TraceCheckUtils]: 89: Hoare triple {105346#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 90: Hoare triple {105346#true} assume !!(#t~post8 < 50);havoc #t~post8; {105346#true} is VALID [2022-04-15 15:15:55,379 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-15 15:15:55,379 INFO L290 TraceCheckUtils]: 92: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 93: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 94: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105346#true} {105346#true} #98#return; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {105346#true} assume !(~r~0 < 0); {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 97: Hoare triple {105346#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 98: Hoare triple {105346#true} assume !!(#t~post6 < 50);havoc #t~post6; {105346#true} is VALID [2022-04-15 15:15:55,379 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-15 15:15:55,379 INFO L290 TraceCheckUtils]: 100: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 101: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,379 INFO L290 TraceCheckUtils]: 102: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105346#true} {105346#true} #94#return; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 104: Hoare triple {105346#true} assume !!(0 != ~r~0); {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 105: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,380 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-15 15:15:55,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,380 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-15 15:15:55,380 INFO L290 TraceCheckUtils]: 113: Hoare triple {105346#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {105346#true} assume !!(#t~post7 < 50);havoc #t~post7; {105346#true} is VALID [2022-04-15 15:15:55,380 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-15 15:15:55,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {105346#true} ~cond := #in~cond; {105346#true} is VALID [2022-04-15 15:15:55,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {105346#true} assume !(0 == ~cond); {105346#true} is VALID [2022-04-15 15:15:55,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {105346#true} assume true; {105346#true} is VALID [2022-04-15 15:15:55,381 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105346#true} {105346#true} #96#return; {105346#true} is VALID [2022-04-15 15:15:55,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {105346#true} assume !(~r~0 > 0); {105711#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:55,381 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-15 15:15:55,381 INFO L290 TraceCheckUtils]: 122: Hoare triple {105711#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {105711#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:15:55,381 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-15 15:15:55,382 INFO L290 TraceCheckUtils]: 124: Hoare triple {105346#true} ~cond := #in~cond; {105724#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:15:55,382 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-15 15:15:55,382 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-15 15:15:55,383 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-15 15:15:55,384 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-15 15:15:55,385 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-15 15:15:55,385 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 < 50);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-15 15:15:55,387 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-15 15:15:55,387 INFO L290 TraceCheckUtils]: 132: Hoare triple {105749#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {105753#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:15:55,387 INFO L290 TraceCheckUtils]: 133: Hoare triple {105753#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {105347#false} is VALID [2022-04-15 15:15:55,387 INFO L290 TraceCheckUtils]: 134: Hoare triple {105347#false} assume !false; {105347#false} is VALID [2022-04-15 15:15:55,388 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-15 15:15:55,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:15:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:15:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372940407] [2022-04-15 15:15:57,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:15:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184154630] [2022-04-15 15:15:57,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184154630] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 15:15:57,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:15:57,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 15:15:57,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:15:57,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661988954] [2022-04-15 15:15:57,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661988954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:15:57,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:15:57,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:15:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48458652] [2022-04-15 15:15:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:15:57,928 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-15 15:15:57,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:15:57,928 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-15 15:15:57,970 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-15 15:15:57,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:15:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:15:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-15 15:15:57,971 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-15 15:16:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:01,119 INFO L93 Difference]: Finished difference Result 758 states and 1028 transitions. [2022-04-15 15:16:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:16:01,119 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-15 15:16:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:01,119 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-15 15:16:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:16:01,120 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-15 15:16:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:16:01,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-15 15:16:01,202 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-15 15:16:01,228 INFO L225 Difference]: With dead ends: 758 [2022-04-15 15:16:01,229 INFO L226 Difference]: Without dead ends: 746 [2022-04-15 15:16:01,229 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-15 15:16:01,230 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-15 15:16:01,230 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-15 15:16:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-15 15:16:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 683. [2022-04-15 15:16:03,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:03,420 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-15 15:16:03,420 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-15 15:16:03,421 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-15 15:16:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:03,439 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-15 15:16:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-15 15:16:03,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:03,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:03,441 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-15 15:16:03,441 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-15 15:16:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:03,459 INFO L93 Difference]: Finished difference Result 746 states and 1010 transitions. [2022-04-15 15:16:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1010 transitions. [2022-04-15 15:16:03,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:03,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:03,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:03,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:03,467 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-15 15:16:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 912 transitions. [2022-04-15 15:16:03,488 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 912 transitions. Word has length 135 [2022-04-15 15:16:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:03,488 INFO L478 AbstractCegarLoop]: Abstraction has 683 states and 912 transitions. [2022-04-15 15:16:03,488 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-15 15:16:03,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 683 states and 912 transitions. [2022-04-15 15:16:07,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 911 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 912 transitions. [2022-04-15 15:16:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:16:07,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:07,392 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-15 15:16:07,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-15 15:16:07,598 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-15 15:16:07,599 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-15 15:16:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:07,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326492851] [2022-04-15 15:16:07,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-15 15:16:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307749340] [2022-04-15 15:16:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:07,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361858342] [2022-04-15 15:16:07,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:16:07,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:07,616 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-15 15:16:07,617 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-15 15:16:07,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:16:07,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:07,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 15:16:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:07,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:16:08,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {110166#true} call ULTIMATE.init(); {110166#true} is VALID [2022-04-15 15:16:08,432 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-15 15:16:08,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110174#(<= ~counter~0 0)} {110166#true} #102#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {110174#(<= ~counter~0 0)} call #t~ret9 := main(); {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,433 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-15 15:16:08,434 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-15 15:16:08,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {110174#(<= ~counter~0 0)} ~cond := #in~cond; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {110174#(<= ~counter~0 0)} assume !(0 == ~cond); {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110174#(<= ~counter~0 0)} {110174#(<= ~counter~0 0)} #90#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,435 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-15 15:16:08,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {110174#(<= ~counter~0 0)} ~cond := #in~cond; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {110174#(<= ~counter~0 0)} assume !(0 == ~cond); {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {110174#(<= ~counter~0 0)} assume true; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,436 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110174#(<= ~counter~0 0)} {110174#(<= ~counter~0 0)} #92#return; {110174#(<= ~counter~0 0)} is VALID [2022-04-15 15:16:08,437 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-15 15:16:08,439 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-15 15:16:08,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {110223#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,440 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-15 15:16:08,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {110223#(<= ~counter~0 1)} ~cond := #in~cond; {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {110223#(<= ~counter~0 1)} assume !(0 == ~cond); {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {110223#(<= ~counter~0 1)} assume true; {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,441 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {110223#(<= ~counter~0 1)} {110223#(<= ~counter~0 1)} #94#return; {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {110223#(<= ~counter~0 1)} assume !!(0 != ~r~0); {110223#(<= ~counter~0 1)} is VALID [2022-04-15 15:16:08,442 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-15 15:16:08,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {110248#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,443 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-15 15:16:08,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {110248#(<= ~counter~0 2)} ~cond := #in~cond; {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {110248#(<= ~counter~0 2)} assume !(0 == ~cond); {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {110248#(<= ~counter~0 2)} assume true; {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,444 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {110248#(<= ~counter~0 2)} {110248#(<= ~counter~0 2)} #96#return; {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {110248#(<= ~counter~0 2)} assume !(~r~0 > 0); {110248#(<= ~counter~0 2)} is VALID [2022-04-15 15:16:08,445 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-15 15:16:08,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {110273#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {110273#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:08,446 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-15 15:16:08,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {110273#(<= ~counter~0 3)} ~cond := #in~cond; {110273#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:08,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {110273#(<= ~counter~0 3)} assume !(0 == ~cond); {110273#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:08,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {110273#(<= ~counter~0 3)} assume true; {110273#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:08,447 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110273#(<= ~counter~0 3)} {110273#(<= ~counter~0 3)} #98#return; {110273#(<= ~counter~0 3)} is VALID [2022-04-15 15:16:08,448 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-15 15:16:08,449 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-15 15:16:08,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {110298#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,449 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-15 15:16:08,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {110298#(<= ~counter~0 4)} ~cond := #in~cond; {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {110298#(<= ~counter~0 4)} assume !(0 == ~cond); {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {110298#(<= ~counter~0 4)} assume true; {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,451 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {110298#(<= ~counter~0 4)} {110298#(<= ~counter~0 4)} #98#return; {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {110298#(<= ~counter~0 4)} assume !(~r~0 < 0); {110298#(<= ~counter~0 4)} is VALID [2022-04-15 15:16:08,452 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-15 15:16:08,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {110323#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,453 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-15 15:16:08,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {110323#(<= ~counter~0 5)} ~cond := #in~cond; {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {110323#(<= ~counter~0 5)} assume !(0 == ~cond); {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {110323#(<= ~counter~0 5)} assume true; {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,454 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {110323#(<= ~counter~0 5)} {110323#(<= ~counter~0 5)} #94#return; {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {110323#(<= ~counter~0 5)} assume !!(0 != ~r~0); {110323#(<= ~counter~0 5)} is VALID [2022-04-15 15:16:08,455 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-15 15:16:08,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {110348#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {110348#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:08,456 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-15 15:16:08,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {110348#(<= ~counter~0 6)} ~cond := #in~cond; {110348#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:08,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {110348#(<= ~counter~0 6)} assume !(0 == ~cond); {110348#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:08,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {110348#(<= ~counter~0 6)} assume true; {110348#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:08,457 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110348#(<= ~counter~0 6)} {110348#(<= ~counter~0 6)} #96#return; {110348#(<= ~counter~0 6)} is VALID [2022-04-15 15:16:08,458 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-15 15:16:08,458 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-15 15:16:08,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {110373#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {110373#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:08,459 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-15 15:16:08,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {110373#(<= ~counter~0 7)} ~cond := #in~cond; {110373#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:08,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {110373#(<= ~counter~0 7)} assume !(0 == ~cond); {110373#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:08,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {110373#(<= ~counter~0 7)} assume true; {110373#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:08,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {110373#(<= ~counter~0 7)} {110373#(<= ~counter~0 7)} #96#return; {110373#(<= ~counter~0 7)} is VALID [2022-04-15 15:16:08,461 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-15 15:16:08,462 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-15 15:16:08,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {110398#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {110398#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:08,471 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-15 15:16:08,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {110398#(<= ~counter~0 8)} ~cond := #in~cond; {110398#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:08,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {110398#(<= ~counter~0 8)} assume !(0 == ~cond); {110398#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:08,472 INFO L290 TraceCheckUtils]: 78: Hoare triple {110398#(<= ~counter~0 8)} assume true; {110398#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:08,472 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110398#(<= ~counter~0 8)} {110398#(<= ~counter~0 8)} #96#return; {110398#(<= ~counter~0 8)} is VALID [2022-04-15 15:16:08,472 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-15 15:16:08,475 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-15 15:16:08,475 INFO L290 TraceCheckUtils]: 82: Hoare triple {110423#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {110423#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:08,475 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-15 15:16:08,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {110423#(<= ~counter~0 9)} ~cond := #in~cond; {110423#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:08,476 INFO L290 TraceCheckUtils]: 85: Hoare triple {110423#(<= ~counter~0 9)} assume !(0 == ~cond); {110423#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:08,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {110423#(<= ~counter~0 9)} assume true; {110423#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:08,477 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {110423#(<= ~counter~0 9)} {110423#(<= ~counter~0 9)} #96#return; {110423#(<= ~counter~0 9)} is VALID [2022-04-15 15:16:08,477 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-15 15:16:08,478 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-15 15:16:08,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {110448#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {110448#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:08,479 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-15 15:16:08,479 INFO L290 TraceCheckUtils]: 92: Hoare triple {110448#(<= ~counter~0 10)} ~cond := #in~cond; {110448#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:08,479 INFO L290 TraceCheckUtils]: 93: Hoare triple {110448#(<= ~counter~0 10)} assume !(0 == ~cond); {110448#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:08,479 INFO L290 TraceCheckUtils]: 94: Hoare triple {110448#(<= ~counter~0 10)} assume true; {110448#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:08,480 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110448#(<= ~counter~0 10)} {110448#(<= ~counter~0 10)} #96#return; {110448#(<= ~counter~0 10)} is VALID [2022-04-15 15:16:08,480 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-15 15:16:08,481 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-15 15:16:08,481 INFO L290 TraceCheckUtils]: 98: Hoare triple {110473#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {110473#(<= ~counter~0 11)} is VALID [2022-04-15 15:16:08,482 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-15 15:16:08,482 INFO L290 TraceCheckUtils]: 100: Hoare triple {110473#(<= ~counter~0 11)} ~cond := #in~cond; {110473#(<= ~counter~0 11)} is VALID [2022-04-15 15:16:08,482 INFO L290 TraceCheckUtils]: 101: Hoare triple {110473#(<= ~counter~0 11)} assume !(0 == ~cond); {110473#(<= ~counter~0 11)} is VALID [2022-04-15 15:16:08,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {110473#(<= ~counter~0 11)} assume true; {110473#(<= ~counter~0 11)} is VALID [2022-04-15 15:16:08,483 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110473#(<= ~counter~0 11)} {110473#(<= ~counter~0 11)} #96#return; {110473#(<= ~counter~0 11)} is VALID [2022-04-15 15:16:08,483 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-15 15:16:08,484 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-15 15:16:08,485 INFO L290 TraceCheckUtils]: 106: Hoare triple {110498#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,485 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-15 15:16:08,485 INFO L290 TraceCheckUtils]: 108: Hoare triple {110498#(<= ~counter~0 12)} ~cond := #in~cond; {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,486 INFO L290 TraceCheckUtils]: 109: Hoare triple {110498#(<= ~counter~0 12)} assume !(0 == ~cond); {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {110498#(<= ~counter~0 12)} assume true; {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,486 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110498#(<= ~counter~0 12)} {110498#(<= ~counter~0 12)} #96#return; {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,487 INFO L290 TraceCheckUtils]: 112: Hoare triple {110498#(<= ~counter~0 12)} assume !(~r~0 > 0); {110498#(<= ~counter~0 12)} is VALID [2022-04-15 15:16:08,488 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-15 15:16:08,488 INFO L290 TraceCheckUtils]: 114: Hoare triple {110523#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {110523#(<= ~counter~0 13)} is VALID [2022-04-15 15:16:08,488 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-15 15:16:08,489 INFO L290 TraceCheckUtils]: 116: Hoare triple {110523#(<= ~counter~0 13)} ~cond := #in~cond; {110523#(<= ~counter~0 13)} is VALID [2022-04-15 15:16:08,489 INFO L290 TraceCheckUtils]: 117: Hoare triple {110523#(<= ~counter~0 13)} assume !(0 == ~cond); {110523#(<= ~counter~0 13)} is VALID [2022-04-15 15:16:08,489 INFO L290 TraceCheckUtils]: 118: Hoare triple {110523#(<= ~counter~0 13)} assume true; {110523#(<= ~counter~0 13)} is VALID [2022-04-15 15:16:08,490 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110523#(<= ~counter~0 13)} {110523#(<= ~counter~0 13)} #98#return; {110523#(<= ~counter~0 13)} is VALID [2022-04-15 15:16:08,490 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-15 15:16:08,491 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-15 15:16:08,491 INFO L290 TraceCheckUtils]: 122: Hoare triple {110548#(<= ~counter~0 14)} assume !!(#t~post8 < 50);havoc #t~post8; {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,492 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-15 15:16:08,492 INFO L290 TraceCheckUtils]: 124: Hoare triple {110548#(<= ~counter~0 14)} ~cond := #in~cond; {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,492 INFO L290 TraceCheckUtils]: 125: Hoare triple {110548#(<= ~counter~0 14)} assume !(0 == ~cond); {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,492 INFO L290 TraceCheckUtils]: 126: Hoare triple {110548#(<= ~counter~0 14)} assume true; {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,493 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110548#(<= ~counter~0 14)} {110548#(<= ~counter~0 14)} #98#return; {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {110548#(<= ~counter~0 14)} assume !(~r~0 < 0); {110548#(<= ~counter~0 14)} is VALID [2022-04-15 15:16:08,494 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-15 15:16:08,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {110573#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {110167#false} is VALID [2022-04-15 15:16:08,494 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-15 15:16:08,494 INFO L290 TraceCheckUtils]: 132: Hoare triple {110167#false} ~cond := #in~cond; {110167#false} is VALID [2022-04-15 15:16:08,494 INFO L290 TraceCheckUtils]: 133: Hoare triple {110167#false} assume 0 == ~cond; {110167#false} is VALID [2022-04-15 15:16:08,494 INFO L290 TraceCheckUtils]: 134: Hoare triple {110167#false} assume !false; {110167#false} is VALID [2022-04-15 15:16:08,495 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-15 15:16:08,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:16:09,335 INFO L290 TraceCheckUtils]: 134: Hoare triple {110167#false} assume !false; {110167#false} is VALID [2022-04-15 15:16:09,335 INFO L290 TraceCheckUtils]: 133: Hoare triple {110167#false} assume 0 == ~cond; {110167#false} is VALID [2022-04-15 15:16:09,335 INFO L290 TraceCheckUtils]: 132: Hoare triple {110167#false} ~cond := #in~cond; {110167#false} is VALID [2022-04-15 15:16:09,335 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-15 15:16:09,336 INFO L290 TraceCheckUtils]: 130: Hoare triple {110601#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {110167#false} is VALID [2022-04-15 15:16:09,336 INFO L290 TraceCheckUtils]: 129: Hoare triple {110605#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110601#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:16:09,336 INFO L290 TraceCheckUtils]: 128: Hoare triple {110605#(< ~counter~0 50)} assume !(~r~0 < 0); {110605#(< ~counter~0 50)} is VALID [2022-04-15 15:16:09,337 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {110166#true} {110605#(< ~counter~0 50)} #98#return; {110605#(< ~counter~0 50)} is VALID [2022-04-15 15:16:09,337 INFO L290 TraceCheckUtils]: 126: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,337 INFO L290 TraceCheckUtils]: 125: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,337 INFO L290 TraceCheckUtils]: 124: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,337 INFO L272 TraceCheckUtils]: 123: Hoare triple {110605#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:16:09,338 INFO L290 TraceCheckUtils]: 122: Hoare triple {110605#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {110605#(< ~counter~0 50)} is VALID [2022-04-15 15:16:09,340 INFO L290 TraceCheckUtils]: 121: Hoare triple {110630#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110605#(< ~counter~0 50)} is VALID [2022-04-15 15:16:09,340 INFO L290 TraceCheckUtils]: 120: Hoare triple {110630#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110630#(< ~counter~0 49)} is VALID [2022-04-15 15:16:09,341 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110166#true} {110630#(< ~counter~0 49)} #98#return; {110630#(< ~counter~0 49)} is VALID [2022-04-15 15:16:09,341 INFO L290 TraceCheckUtils]: 118: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,341 INFO L290 TraceCheckUtils]: 117: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,341 INFO L290 TraceCheckUtils]: 116: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,341 INFO L272 TraceCheckUtils]: 115: Hoare triple {110630#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:16:09,342 INFO L290 TraceCheckUtils]: 114: Hoare triple {110630#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {110630#(< ~counter~0 49)} is VALID [2022-04-15 15:16:09,343 INFO L290 TraceCheckUtils]: 113: Hoare triple {110655#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110630#(< ~counter~0 49)} is VALID [2022-04-15 15:16:09,343 INFO L290 TraceCheckUtils]: 112: Hoare triple {110655#(< ~counter~0 48)} assume !(~r~0 > 0); {110655#(< ~counter~0 48)} is VALID [2022-04-15 15:16:09,344 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {110166#true} {110655#(< ~counter~0 48)} #96#return; {110655#(< ~counter~0 48)} is VALID [2022-04-15 15:16:09,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,344 INFO L290 TraceCheckUtils]: 109: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,344 INFO L290 TraceCheckUtils]: 108: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,344 INFO L272 TraceCheckUtils]: 107: Hoare triple {110655#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:16:09,344 INFO L290 TraceCheckUtils]: 106: Hoare triple {110655#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {110655#(< ~counter~0 48)} is VALID [2022-04-15 15:16:09,345 INFO L290 TraceCheckUtils]: 105: Hoare triple {110680#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110655#(< ~counter~0 48)} is VALID [2022-04-15 15:16:09,346 INFO L290 TraceCheckUtils]: 104: Hoare triple {110680#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110680#(< ~counter~0 47)} is VALID [2022-04-15 15:16:09,346 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {110166#true} {110680#(< ~counter~0 47)} #96#return; {110680#(< ~counter~0 47)} is VALID [2022-04-15 15:16:09,346 INFO L290 TraceCheckUtils]: 102: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,347 INFO L290 TraceCheckUtils]: 101: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,347 INFO L290 TraceCheckUtils]: 100: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,347 INFO L272 TraceCheckUtils]: 99: Hoare triple {110680#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:16:09,347 INFO L290 TraceCheckUtils]: 98: Hoare triple {110680#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {110680#(< ~counter~0 47)} is VALID [2022-04-15 15:16:09,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {110705#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110680#(< ~counter~0 47)} is VALID [2022-04-15 15:16:09,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {110705#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110705#(< ~counter~0 46)} is VALID [2022-04-15 15:16:09,349 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {110166#true} {110705#(< ~counter~0 46)} #96#return; {110705#(< ~counter~0 46)} is VALID [2022-04-15 15:16:09,349 INFO L290 TraceCheckUtils]: 94: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,349 INFO L272 TraceCheckUtils]: 91: Hoare triple {110705#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:16:09,350 INFO L290 TraceCheckUtils]: 90: Hoare triple {110705#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {110705#(< ~counter~0 46)} is VALID [2022-04-15 15:16:09,350 INFO L290 TraceCheckUtils]: 89: Hoare triple {110730#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110705#(< ~counter~0 46)} is VALID [2022-04-15 15:16:09,351 INFO L290 TraceCheckUtils]: 88: Hoare triple {110730#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110730#(< ~counter~0 45)} is VALID [2022-04-15 15:16:09,351 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {110166#true} {110730#(< ~counter~0 45)} #96#return; {110730#(< ~counter~0 45)} is VALID [2022-04-15 15:16:09,351 INFO L290 TraceCheckUtils]: 86: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,352 INFO L272 TraceCheckUtils]: 83: Hoare triple {110730#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:16:09,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {110730#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {110730#(< ~counter~0 45)} is VALID [2022-04-15 15:16:09,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {110755#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110730#(< ~counter~0 45)} is VALID [2022-04-15 15:16:09,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {110755#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110755#(< ~counter~0 44)} is VALID [2022-04-15 15:16:09,353 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110166#true} {110755#(< ~counter~0 44)} #96#return; {110755#(< ~counter~0 44)} is VALID [2022-04-15 15:16:09,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,354 INFO L272 TraceCheckUtils]: 75: Hoare triple {110755#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:16:09,354 INFO L290 TraceCheckUtils]: 74: Hoare triple {110755#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {110755#(< ~counter~0 44)} is VALID [2022-04-15 15:16:09,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {110780#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110755#(< ~counter~0 44)} is VALID [2022-04-15 15:16:09,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {110780#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110780#(< ~counter~0 43)} is VALID [2022-04-15 15:16:09,356 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {110166#true} {110780#(< ~counter~0 43)} #96#return; {110780#(< ~counter~0 43)} is VALID [2022-04-15 15:16:09,356 INFO L290 TraceCheckUtils]: 70: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,356 INFO L290 TraceCheckUtils]: 69: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,356 INFO L290 TraceCheckUtils]: 68: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,356 INFO L272 TraceCheckUtils]: 67: Hoare triple {110780#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:16:09,356 INFO L290 TraceCheckUtils]: 66: Hoare triple {110780#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {110780#(< ~counter~0 43)} is VALID [2022-04-15 15:16:09,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {110805#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110780#(< ~counter~0 43)} is VALID [2022-04-15 15:16:09,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {110805#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {110805#(< ~counter~0 42)} is VALID [2022-04-15 15:16:09,358 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110166#true} {110805#(< ~counter~0 42)} #96#return; {110805#(< ~counter~0 42)} is VALID [2022-04-15 15:16:09,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,358 INFO L272 TraceCheckUtils]: 59: Hoare triple {110805#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:16:09,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {110805#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {110805#(< ~counter~0 42)} is VALID [2022-04-15 15:16:09,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {110830#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110805#(< ~counter~0 42)} is VALID [2022-04-15 15:16:09,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {110830#(< ~counter~0 41)} assume !!(0 != ~r~0); {110830#(< ~counter~0 41)} is VALID [2022-04-15 15:16:09,360 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {110166#true} {110830#(< ~counter~0 41)} #94#return; {110830#(< ~counter~0 41)} is VALID [2022-04-15 15:16:09,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,360 INFO L272 TraceCheckUtils]: 51: Hoare triple {110830#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:16:09,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {110830#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {110830#(< ~counter~0 41)} is VALID [2022-04-15 15:16:09,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {110855#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110830#(< ~counter~0 41)} is VALID [2022-04-15 15:16:09,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {110855#(< ~counter~0 40)} assume !(~r~0 < 0); {110855#(< ~counter~0 40)} is VALID [2022-04-15 15:16:09,362 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {110166#true} {110855#(< ~counter~0 40)} #98#return; {110855#(< ~counter~0 40)} is VALID [2022-04-15 15:16:09,362 INFO L290 TraceCheckUtils]: 46: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,363 INFO L272 TraceCheckUtils]: 43: Hoare triple {110855#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:16:09,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {110855#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {110855#(< ~counter~0 40)} is VALID [2022-04-15 15:16:09,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {110880#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110855#(< ~counter~0 40)} is VALID [2022-04-15 15:16:09,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {110880#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {110880#(< ~counter~0 39)} is VALID [2022-04-15 15:16:09,365 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110166#true} {110880#(< ~counter~0 39)} #98#return; {110880#(< ~counter~0 39)} is VALID [2022-04-15 15:16:09,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {110880#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:16:09,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {110880#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {110880#(< ~counter~0 39)} is VALID [2022-04-15 15:16:09,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {110905#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110880#(< ~counter~0 39)} is VALID [2022-04-15 15:16:09,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {110905#(< ~counter~0 38)} assume !(~r~0 > 0); {110905#(< ~counter~0 38)} is VALID [2022-04-15 15:16:09,367 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {110166#true} {110905#(< ~counter~0 38)} #96#return; {110905#(< ~counter~0 38)} is VALID [2022-04-15 15:16:09,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {110905#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:16:09,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {110905#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {110905#(< ~counter~0 38)} is VALID [2022-04-15 15:16:09,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {110930#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110905#(< ~counter~0 38)} is VALID [2022-04-15 15:16:09,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {110930#(< ~counter~0 37)} assume !!(0 != ~r~0); {110930#(< ~counter~0 37)} is VALID [2022-04-15 15:16:09,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {110166#true} {110930#(< ~counter~0 37)} #94#return; {110930#(< ~counter~0 37)} is VALID [2022-04-15 15:16:09,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {110930#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:16:09,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {110930#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {110930#(< ~counter~0 37)} is VALID [2022-04-15 15:16:09,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {110955#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110930#(< ~counter~0 37)} is VALID [2022-04-15 15:16:09,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {110955#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,371 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110166#true} {110955#(< ~counter~0 36)} #92#return; {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {110955#(< ~counter~0 36)} call assume_abort_if_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-15 15:16:09,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110166#true} {110955#(< ~counter~0 36)} #90#return; {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {110166#true} assume true; {110166#true} is VALID [2022-04-15 15:16:09,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {110166#true} assume !(0 == ~cond); {110166#true} is VALID [2022-04-15 15:16:09,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {110166#true} ~cond := #in~cond; {110166#true} is VALID [2022-04-15 15:16:09,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {110955#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {110166#true} is VALID [2022-04-15 15:16:09,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {110955#(< ~counter~0 36)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 36)} is VALID [2022-04-15 15:16:09,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {110955#(< ~counter~0 36)} call #t~ret9 := main(); {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110955#(< ~counter~0 36)} {110166#true} #102#return; {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {110955#(< ~counter~0 36)} assume true; {110955#(< ~counter~0 36)} is VALID [2022-04-15 15:16:09,374 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 36)} is VALID [2022-04-15 15:16:09,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {110166#true} call ULTIMATE.init(); {110166#true} is VALID [2022-04-15 15:16:09,374 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-15 15:16:09,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:16:09,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307749340] [2022-04-15 15:16:09,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:16:09,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361858342] [2022-04-15 15:16:09,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361858342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:16:09,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:16:09,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-15 15:16:09,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:16:09,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326492851] [2022-04-15 15:16:09,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326492851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:16:09,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:16:09,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:16:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484802340] [2022-04-15 15:16:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:16:09,376 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-15 15:16:09,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:16:09,376 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-15 15:16:09,492 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-15 15:16:09,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:16:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:16:09,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:16:09,493 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-15 15:16:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:13,276 INFO L93 Difference]: Finished difference Result 734 states and 982 transitions. [2022-04-15 15:16:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:16:13,277 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-15 15:16:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:16:13,277 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-15 15:16:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:16:13,279 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-15 15:16:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:16:13,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-15 15:16:13,563 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-15 15:16:13,596 INFO L225 Difference]: With dead ends: 734 [2022-04-15 15:16:13,597 INFO L226 Difference]: Without dead ends: 729 [2022-04-15 15:16:13,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 15:16:13,598 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-15 15:16:13,598 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-15 15:16:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-04-15 15:16:15,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 707. [2022-04-15 15:16:15,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:16:15,861 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-15 15:16:15,861 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-15 15:16:15,862 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-15 15:16:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:15,878 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-15 15:16:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-15 15:16:15,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:15,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:15,880 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-15 15:16:15,880 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-15 15:16:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:16:15,903 INFO L93 Difference]: Finished difference Result 729 states and 976 transitions. [2022-04-15 15:16:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 976 transitions. [2022-04-15 15:16:15,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:16:15,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:16:15,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:16:15,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:16:15,905 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-15 15:16:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-15 15:16:15,938 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 135 [2022-04-15 15:16:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:16:15,938 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-15 15:16:15,938 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-15 15:16:15,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-15 15:16:19,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 949 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:16:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-15 15:16:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 15:16:19,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:16:19,974 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-15 15:16:19,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 15:16:20,174 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-15 15:16:20,175 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:16:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:16:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-15 15:16:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:16:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369036805] [2022-04-15 15:16:20,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:16:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-15 15:16:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:16:20,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574878614] [2022-04-15 15:16:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:16:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:16:20,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:16:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334361464] [2022-04-15 15:16:20,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:16:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:16:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:16:20,189 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-15 15:16:20,190 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-15 15:16:20,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:16:20,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:16:20,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 15:16:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:16:20,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:30,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {115371#true} call ULTIMATE.init(); {115371#true} is VALID [2022-04-15 15:18:30,894 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-15 15:18:30,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:30,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115371#true} {115371#true} #102#return; {115371#true} is VALID [2022-04-15 15:18:30,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {115371#true} call #t~ret9 := main(); {115371#true} is VALID [2022-04-15 15:18:30,894 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-15 15:18:30,894 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-15 15:18:30,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:30,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:30,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:30,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {115371#true} {115371#true} #90#return; {115371#true} is VALID [2022-04-15 15:18:30,895 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-15 15:18:30,895 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-15 15:18:30,895 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-15 15:18:30,896 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-15 15:18:30,896 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-15 15:18:32,898 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-15 15:18:32,899 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-15 15:18:32,900 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 < 50);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-15 15:18:32,900 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-15 15:18:32,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:32,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:32,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:32,900 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-15 15:18:32,901 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-15 15:18:32,901 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-15 15:18:32,902 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 < 50);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-15 15:18:32,902 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-15 15:18:32,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:32,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:32,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:32,903 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-15 15:18:32,903 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-15 15:18:32,903 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-15 15:18:32,904 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 < 50);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-15 15:18:32,904 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-15 15:18:32,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:32,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:32,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:32,905 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-15 15:18:34,477 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-15 15:18:34,479 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-15 15:18:34,497 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 < 50);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-15 15:18:34,497 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-15 15:18:34,497 INFO L290 TraceCheckUtils]: 44: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,497 INFO L290 TraceCheckUtils]: 45: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,498 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-15 15:18:34,521 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-15 15:18:34,543 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-15 15:18:34,544 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 < 50);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-15 15:18:34,544 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-15 15:18:34,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,548 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-15 15:18:34,553 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-15 15:18:34,569 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-15 15:18:34,570 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 < 50);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-15 15:18:34,570 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-15 15:18:34,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,570 INFO L290 TraceCheckUtils]: 62: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,571 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-15 15:18:34,579 INFO 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 VALID [2022-04-15 15:18:34,589 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-15 15:18:34,600 INFO 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 < 50);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 VALID [2022-04-15 15:18:34,600 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-15 15:18:34,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,601 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-15 15:18:34,604 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-15 15:18:34,605 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-15 15:18:34,619 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 < 50);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-15 15:18:34,620 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-15 15:18:34,620 INFO L290 TraceCheckUtils]: 76: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,620 INFO L290 TraceCheckUtils]: 77: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,620 INFO L290 TraceCheckUtils]: 78: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,621 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-15 15:18:34,624 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-15 15:18:34,624 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-15 15:18:34,625 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 < 50);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-15 15:18:34,625 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-15 15:18:34,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,625 INFO L290 TraceCheckUtils]: 86: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,626 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-15 15:18:34,630 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-15 15:18:34,637 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-15 15:18:34,639 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 < 50);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-15 15:18:34,639 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-15 15:18:34,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,640 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-15 15:18:34,641 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-15 15:18:34,642 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-15 15:18:34,643 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 < 50);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-15 15:18:34,643 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-15 15:18:34,644 INFO L290 TraceCheckUtils]: 100: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,644 INFO L290 TraceCheckUtils]: 101: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,644 INFO L290 TraceCheckUtils]: 102: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,644 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-15 15:18:34,659 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-15 15:18:34,660 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-15 15:18:34,662 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 < 50);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-15 15:18:34,662 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-15 15:18:34,662 INFO L290 TraceCheckUtils]: 108: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,662 INFO L290 TraceCheckUtils]: 109: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,662 INFO L290 TraceCheckUtils]: 110: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,663 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-15 15:18:34,664 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-15 15:18:34,665 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-15 15:18:34,666 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 < 50);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-15 15:18:34,667 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-15 15:18:34,667 INFO L290 TraceCheckUtils]: 116: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,667 INFO L290 TraceCheckUtils]: 117: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,667 INFO L290 TraceCheckUtils]: 118: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,668 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-15 15:18:34,669 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-15 15:18:34,676 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-15 15:18:34,682 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 < 50);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-15 15:18:34,682 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-15 15:18:34,682 INFO L290 TraceCheckUtils]: 124: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:34,682 INFO L290 TraceCheckUtils]: 125: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:34,683 INFO L290 TraceCheckUtils]: 126: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:34,683 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-15 15:18:34,687 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-15 15:18:34,687 INFO L290 TraceCheckUtils]: 129: Hoare triple {115372#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115372#false} is VALID [2022-04-15 15:18:34,687 INFO L290 TraceCheckUtils]: 130: Hoare triple {115372#false} assume !(#t~post8 < 50);havoc #t~post8; {115372#false} is VALID [2022-04-15 15:18:34,687 INFO L290 TraceCheckUtils]: 131: Hoare triple {115372#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115372#false} is VALID [2022-04-15 15:18:34,688 INFO L290 TraceCheckUtils]: 132: Hoare triple {115372#false} assume !(#t~post6 < 50);havoc #t~post6; {115372#false} is VALID [2022-04-15 15:18:34,688 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-15 15:18:34,688 INFO L290 TraceCheckUtils]: 134: Hoare triple {115372#false} ~cond := #in~cond; {115372#false} is VALID [2022-04-15 15:18:34,688 INFO L290 TraceCheckUtils]: 135: Hoare triple {115372#false} assume 0 == ~cond; {115372#false} is VALID [2022-04-15 15:18:34,688 INFO L290 TraceCheckUtils]: 136: Hoare triple {115372#false} assume !false; {115372#false} is VALID [2022-04-15 15:18:34,689 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-15 15:18:34,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:37,341 INFO L290 TraceCheckUtils]: 136: Hoare triple {115372#false} assume !false; {115372#false} is VALID [2022-04-15 15:18:37,342 INFO L290 TraceCheckUtils]: 135: Hoare triple {115372#false} assume 0 == ~cond; {115372#false} is VALID [2022-04-15 15:18:37,342 INFO L290 TraceCheckUtils]: 134: Hoare triple {115372#false} ~cond := #in~cond; {115372#false} is VALID [2022-04-15 15:18:37,342 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-15 15:18:37,342 INFO L290 TraceCheckUtils]: 132: Hoare triple {115372#false} assume !(#t~post6 < 50);havoc #t~post6; {115372#false} is VALID [2022-04-15 15:18:37,342 INFO L290 TraceCheckUtils]: 131: Hoare triple {115372#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {115372#false} is VALID [2022-04-15 15:18:37,342 INFO L290 TraceCheckUtils]: 130: Hoare triple {115372#false} assume !(#t~post8 < 50);havoc #t~post8; {115372#false} is VALID [2022-04-15 15:18:37,342 INFO L290 TraceCheckUtils]: 129: Hoare triple {115372#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {115372#false} is VALID [2022-04-15 15:18:37,342 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-15 15:18:37,343 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-15 15:18:37,343 INFO L290 TraceCheckUtils]: 126: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,343 INFO L290 TraceCheckUtils]: 125: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,343 INFO L290 TraceCheckUtils]: 124: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,343 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-15 15:18:37,343 INFO L290 TraceCheckUtils]: 122: Hoare triple {115817#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {115817#(not (< main_~r~0 0))} is VALID [2022-04-15 15:18:37,344 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-15 15:18:37,344 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-15 15:18:37,344 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-15 15:18:37,345 INFO L290 TraceCheckUtils]: 118: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,345 INFO L290 TraceCheckUtils]: 117: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,345 INFO L290 TraceCheckUtils]: 116: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,345 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-15 15:18:37,345 INFO L290 TraceCheckUtils]: 114: Hoare triple {115817#(not (< main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {115817#(not (< main_~r~0 0))} is VALID [2022-04-15 15:18:37,345 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-15 15:18:37,347 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-15 15:18:37,347 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-15 15:18:37,347 INFO L290 TraceCheckUtils]: 110: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,347 INFO L290 TraceCheckUtils]: 109: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,347 INFO L290 TraceCheckUtils]: 108: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,347 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-15 15:18:37,348 INFO L290 TraceCheckUtils]: 106: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 50);havoc #t~post7; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:18:37,348 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-15 15:18:37,348 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-15 15:18:37,349 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-15 15:18:37,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,349 INFO L290 TraceCheckUtils]: 100: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,349 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-15 15:18:37,363 INFO L290 TraceCheckUtils]: 98: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 50);havoc #t~post6; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:18:37,363 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-15 15:18:37,364 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-15 15:18:37,364 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-15 15:18:37,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,365 INFO L290 TraceCheckUtils]: 93: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,365 INFO L290 TraceCheckUtils]: 92: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,365 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-15 15:18:37,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {115866#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {115866#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:18:37,366 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-15 15:18:37,369 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-15 15:18:37,370 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-15 15:18:37,370 INFO L290 TraceCheckUtils]: 86: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,370 INFO L290 TraceCheckUtils]: 85: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,370 INFO L290 TraceCheckUtils]: 84: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,370 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-15 15:18:37,370 INFO L290 TraceCheckUtils]: 82: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:18:37,371 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-15 15:18:37,371 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-15 15:18:37,372 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-15 15:18:37,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,372 INFO L290 TraceCheckUtils]: 77: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,372 INFO L290 TraceCheckUtils]: 76: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,372 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-15 15:18:37,372 INFO L290 TraceCheckUtils]: 74: Hoare triple {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {115939#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:18:37,373 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-15 15:18:37,374 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-15 15:18:37,374 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-15 15:18:37,374 INFO L290 TraceCheckUtils]: 70: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,375 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-15 15:18:37,375 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 < 50);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-15 15:18:37,376 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-15 15:18:37,377 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-15 15:18:37,377 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-15 15:18:37,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,378 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-15 15:18:37,378 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 < 50);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-15 15:18:37,379 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-15 15:18:37,379 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-15 15:18:37,380 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-15 15:18:37,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,380 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-15 15:18:37,381 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 < 50);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-15 15:18:37,381 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-15 15:18:37,381 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-15 15:18:37,382 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-15 15:18:37,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,383 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-15 15:18:37,383 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 < 50);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-15 15:18:37,383 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-15 15:18:37,387 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-15 15:18:37,388 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-15 15:18:37,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,388 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-15 15:18:37,388 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 < 50);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-15 15:18:37,389 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-15 15:18:37,389 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-15 15:18:37,390 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-15 15:18:37,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,390 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-15 15:18:37,390 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 < 50);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-15 15:18:37,391 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-15 15:18:37,391 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-15 15:18:37,391 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-15 15:18:37,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,392 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-15 15:18:37,392 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 < 50);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-15 15:18:37,392 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-15 15:18:37,394 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-15 15:18:37,395 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-15 15:18:37,395 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-15 15:18:37,396 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-15 15:18:37,396 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-15 15:18:37,396 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-15 15:18:37,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {115371#true} {115371#true} #90#return; {115371#true} is VALID [2022-04-15 15:18:37,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {115371#true} assume !(0 == ~cond); {115371#true} is VALID [2022-04-15 15:18:37,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {115371#true} ~cond := #in~cond; {115371#true} is VALID [2022-04-15 15:18:37,396 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-15 15:18:37,396 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-15 15:18:37,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {115371#true} call #t~ret9 := main(); {115371#true} is VALID [2022-04-15 15:18:37,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115371#true} {115371#true} #102#return; {115371#true} is VALID [2022-04-15 15:18:37,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {115371#true} assume true; {115371#true} is VALID [2022-04-15 15:18:37,397 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-15 15:18:37,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {115371#true} call ULTIMATE.init(); {115371#true} is VALID [2022-04-15 15:18:37,397 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-15 15:18:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574878614] [2022-04-15 15:18:37,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334361464] [2022-04-15 15:18:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334361464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:37,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-15 15:18:37,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369036805] [2022-04-15 15:18:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369036805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:37,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:37,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:18:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528048109] [2022-04-15 15:18:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:37,398 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-15 15:18:37,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:37,399 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-15 15:18:41,651 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-15 15:18:41,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:18:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:18:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:18:41,652 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-15 15:18:46,963 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-15 15:18:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:52,820 INFO L93 Difference]: Finished difference Result 964 states and 1336 transitions. [2022-04-15 15:18:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:18:52,821 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-15 15:18:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:52,821 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-15 15:18:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 15:18:52,822 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-15 15:18:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 15:18:52,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-15 15:18:56,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 160 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:56,725 INFO L225 Difference]: With dead ends: 964 [2022-04-15 15:18:56,725 INFO L226 Difference]: Without dead ends: 851 [2022-04-15 15:18:56,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:18:56,726 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:56,726 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.0s Time] [2022-04-15 15:18:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-15 15:18:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 707. [2022-04-15 15:18:59,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:59,180 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-15 15:18:59,180 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-15 15:18:59,181 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-15 15:18:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:59,205 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-15 15:18:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-15 15:18:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:59,207 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-15 15:18:59,207 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-15 15:18:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:59,231 INFO L93 Difference]: Finished difference Result 851 states and 1168 transitions. [2022-04-15 15:18:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1168 transitions. [2022-04-15 15:18:59,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:59,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:59,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:59,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:59,233 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-15 15:18:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 950 transitions. [2022-04-15 15:18:59,256 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 950 transitions. Word has length 137 [2022-04-15 15:18:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:59,256 INFO L478 AbstractCegarLoop]: Abstraction has 707 states and 950 transitions. [2022-04-15 15:18:59,256 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-15 15:18:59,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 707 states and 950 transitions. [2022-04-15 15:19:07,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 949 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 950 transitions. [2022-04-15 15:19:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 15:19:07,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:07,126 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-15 15:19:07,143 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-15 15:19:07,326 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-15 15:19:07,327 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-15 15:19:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:07,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1860314947] [2022-04-15 15:19:07,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-15 15:19:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:07,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199853168] [2022-04-15 15:19:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:07,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:07,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446262965] [2022-04-15 15:19:07,341 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:19:07,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:07,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:07,342 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-15 15:19:07,342 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-15 15:19:07,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:19:07,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:07,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:19:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:08,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {121261#true} call ULTIMATE.init(); {121261#true} is VALID [2022-04-15 15:19:08,267 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-15 15:19:08,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121269#(<= ~counter~0 0)} {121261#true} #102#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {121269#(<= ~counter~0 0)} call #t~ret9 := main(); {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,268 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-15 15:19:08,269 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-15 15:19:08,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {121269#(<= ~counter~0 0)} ~cond := #in~cond; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {121269#(<= ~counter~0 0)} assume !(0 == ~cond); {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {121269#(<= ~counter~0 0)} {121269#(<= ~counter~0 0)} #90#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,271 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-15 15:19:08,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {121269#(<= ~counter~0 0)} ~cond := #in~cond; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {121269#(<= ~counter~0 0)} assume !(0 == ~cond); {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {121269#(<= ~counter~0 0)} assume true; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {121269#(<= ~counter~0 0)} {121269#(<= ~counter~0 0)} #92#return; {121269#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,272 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-15 15:19:08,274 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-15 15:19:08,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {121318#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,275 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-15 15:19:08,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {121318#(<= ~counter~0 1)} ~cond := #in~cond; {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {121318#(<= ~counter~0 1)} assume !(0 == ~cond); {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {121318#(<= ~counter~0 1)} assume true; {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,276 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {121318#(<= ~counter~0 1)} {121318#(<= ~counter~0 1)} #94#return; {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {121318#(<= ~counter~0 1)} assume !!(0 != ~r~0); {121318#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,278 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-15 15:19:08,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {121343#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,278 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-15 15:19:08,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {121343#(<= ~counter~0 2)} ~cond := #in~cond; {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {121343#(<= ~counter~0 2)} assume !(0 == ~cond); {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {121343#(<= ~counter~0 2)} assume true; {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,280 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {121343#(<= ~counter~0 2)} {121343#(<= ~counter~0 2)} #96#return; {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {121343#(<= ~counter~0 2)} assume !(~r~0 > 0); {121343#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,281 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-15 15:19:08,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {121368#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {121368#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,282 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-15 15:19:08,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {121368#(<= ~counter~0 3)} ~cond := #in~cond; {121368#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {121368#(<= ~counter~0 3)} assume !(0 == ~cond); {121368#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {121368#(<= ~counter~0 3)} assume true; {121368#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,283 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {121368#(<= ~counter~0 3)} {121368#(<= ~counter~0 3)} #98#return; {121368#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,283 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-15 15:19:08,284 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-15 15:19:08,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {121393#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,285 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-15 15:19:08,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {121393#(<= ~counter~0 4)} ~cond := #in~cond; {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {121393#(<= ~counter~0 4)} assume !(0 == ~cond); {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {121393#(<= ~counter~0 4)} assume true; {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,286 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {121393#(<= ~counter~0 4)} {121393#(<= ~counter~0 4)} #98#return; {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {121393#(<= ~counter~0 4)} assume !(~r~0 < 0); {121393#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,288 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-15 15:19:08,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {121418#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,288 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-15 15:19:08,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {121418#(<= ~counter~0 5)} ~cond := #in~cond; {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {121418#(<= ~counter~0 5)} assume !(0 == ~cond); {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {121418#(<= ~counter~0 5)} assume true; {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,290 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {121418#(<= ~counter~0 5)} {121418#(<= ~counter~0 5)} #94#return; {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {121418#(<= ~counter~0 5)} assume !!(0 != ~r~0); {121418#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,291 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-15 15:19:08,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {121443#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {121443#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,292 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-15 15:19:08,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {121443#(<= ~counter~0 6)} ~cond := #in~cond; {121443#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {121443#(<= ~counter~0 6)} assume !(0 == ~cond); {121443#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {121443#(<= ~counter~0 6)} assume true; {121443#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,293 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121443#(<= ~counter~0 6)} {121443#(<= ~counter~0 6)} #96#return; {121443#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,293 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-15 15:19:08,294 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-15 15:19:08,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {121468#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {121468#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,295 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-15 15:19:08,295 INFO L290 TraceCheckUtils]: 68: Hoare triple {121468#(<= ~counter~0 7)} ~cond := #in~cond; {121468#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {121468#(<= ~counter~0 7)} assume !(0 == ~cond); {121468#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {121468#(<= ~counter~0 7)} assume true; {121468#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,296 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121468#(<= ~counter~0 7)} {121468#(<= ~counter~0 7)} #96#return; {121468#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,297 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-15 15:19:08,298 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-15 15:19:08,298 INFO L290 TraceCheckUtils]: 74: Hoare triple {121493#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,298 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-15 15:19:08,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {121493#(<= ~counter~0 8)} ~cond := #in~cond; {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,299 INFO L290 TraceCheckUtils]: 77: Hoare triple {121493#(<= ~counter~0 8)} assume !(0 == ~cond); {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,299 INFO L290 TraceCheckUtils]: 78: Hoare triple {121493#(<= ~counter~0 8)} assume true; {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,300 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121493#(<= ~counter~0 8)} {121493#(<= ~counter~0 8)} #96#return; {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {121493#(<= ~counter~0 8)} assume !(~r~0 > 0); {121493#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,301 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-15 15:19:08,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {121518#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {121518#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,302 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-15 15:19:08,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {121518#(<= ~counter~0 9)} ~cond := #in~cond; {121518#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {121518#(<= ~counter~0 9)} assume !(0 == ~cond); {121518#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {121518#(<= ~counter~0 9)} assume true; {121518#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,303 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121518#(<= ~counter~0 9)} {121518#(<= ~counter~0 9)} #98#return; {121518#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,303 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-15 15:19:08,304 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-15 15:19:08,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {121543#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,305 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-15 15:19:08,305 INFO L290 TraceCheckUtils]: 92: Hoare triple {121543#(<= ~counter~0 10)} ~cond := #in~cond; {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {121543#(<= ~counter~0 10)} assume !(0 == ~cond); {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {121543#(<= ~counter~0 10)} assume true; {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,306 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121543#(<= ~counter~0 10)} {121543#(<= ~counter~0 10)} #98#return; {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {121543#(<= ~counter~0 10)} assume !(~r~0 < 0); {121543#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,308 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-15 15:19:08,308 INFO L290 TraceCheckUtils]: 98: Hoare triple {121568#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,308 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-15 15:19:08,309 INFO L290 TraceCheckUtils]: 100: Hoare triple {121568#(<= ~counter~0 11)} ~cond := #in~cond; {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,309 INFO L290 TraceCheckUtils]: 101: Hoare triple {121568#(<= ~counter~0 11)} assume !(0 == ~cond); {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,309 INFO L290 TraceCheckUtils]: 102: Hoare triple {121568#(<= ~counter~0 11)} assume true; {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,310 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121568#(<= ~counter~0 11)} {121568#(<= ~counter~0 11)} #94#return; {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,310 INFO L290 TraceCheckUtils]: 104: Hoare triple {121568#(<= ~counter~0 11)} assume !!(0 != ~r~0); {121568#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,311 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-15 15:19:08,311 INFO L290 TraceCheckUtils]: 106: Hoare triple {121593#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {121593#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,312 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-15 15:19:08,312 INFO L290 TraceCheckUtils]: 108: Hoare triple {121593#(<= ~counter~0 12)} ~cond := #in~cond; {121593#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,312 INFO L290 TraceCheckUtils]: 109: Hoare triple {121593#(<= ~counter~0 12)} assume !(0 == ~cond); {121593#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,312 INFO L290 TraceCheckUtils]: 110: Hoare triple {121593#(<= ~counter~0 12)} assume true; {121593#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,313 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121593#(<= ~counter~0 12)} {121593#(<= ~counter~0 12)} #96#return; {121593#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,313 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-15 15:19:08,314 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-15 15:19:08,314 INFO L290 TraceCheckUtils]: 114: Hoare triple {121618#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {121618#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,315 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-15 15:19:08,315 INFO L290 TraceCheckUtils]: 116: Hoare triple {121618#(<= ~counter~0 13)} ~cond := #in~cond; {121618#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,316 INFO L290 TraceCheckUtils]: 117: Hoare triple {121618#(<= ~counter~0 13)} assume !(0 == ~cond); {121618#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,316 INFO L290 TraceCheckUtils]: 118: Hoare triple {121618#(<= ~counter~0 13)} assume true; {121618#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,316 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121618#(<= ~counter~0 13)} {121618#(<= ~counter~0 13)} #96#return; {121618#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,317 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-15 15:19:08,317 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-15 15:19:08,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {121643#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,318 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-15 15:19:08,319 INFO L290 TraceCheckUtils]: 124: Hoare triple {121643#(<= ~counter~0 14)} ~cond := #in~cond; {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,319 INFO L290 TraceCheckUtils]: 125: Hoare triple {121643#(<= ~counter~0 14)} assume !(0 == ~cond); {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,319 INFO L290 TraceCheckUtils]: 126: Hoare triple {121643#(<= ~counter~0 14)} assume true; {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,320 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121643#(<= ~counter~0 14)} {121643#(<= ~counter~0 14)} #96#return; {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,320 INFO L290 TraceCheckUtils]: 128: Hoare triple {121643#(<= ~counter~0 14)} assume !(~r~0 > 0); {121643#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,321 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-15 15:19:08,321 INFO L290 TraceCheckUtils]: 130: Hoare triple {121668#(<= ~counter~0 15)} assume !(#t~post8 < 50);havoc #t~post8; {121668#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,321 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-15 15:19:08,322 INFO L290 TraceCheckUtils]: 132: Hoare triple {121675#(<= |main_#t~post6| 15)} assume !(#t~post6 < 50);havoc #t~post6; {121262#false} is VALID [2022-04-15 15:19:08,322 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-15 15:19:08,322 INFO L290 TraceCheckUtils]: 134: Hoare triple {121262#false} ~cond := #in~cond; {121262#false} is VALID [2022-04-15 15:19:08,322 INFO L290 TraceCheckUtils]: 135: Hoare triple {121262#false} assume 0 == ~cond; {121262#false} is VALID [2022-04-15 15:19:08,322 INFO L290 TraceCheckUtils]: 136: Hoare triple {121262#false} assume !false; {121262#false} is VALID [2022-04-15 15:19:08,322 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-15 15:19:08,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:09,242 INFO L290 TraceCheckUtils]: 136: Hoare triple {121262#false} assume !false; {121262#false} is VALID [2022-04-15 15:19:09,242 INFO L290 TraceCheckUtils]: 135: Hoare triple {121262#false} assume 0 == ~cond; {121262#false} is VALID [2022-04-15 15:19:09,242 INFO L290 TraceCheckUtils]: 134: Hoare triple {121262#false} ~cond := #in~cond; {121262#false} is VALID [2022-04-15 15:19:09,242 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-15 15:19:09,242 INFO L290 TraceCheckUtils]: 132: Hoare triple {121703#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {121262#false} is VALID [2022-04-15 15:19:09,243 INFO L290 TraceCheckUtils]: 131: Hoare triple {121707#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121703#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:19:09,243 INFO L290 TraceCheckUtils]: 130: Hoare triple {121707#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {121707#(< ~counter~0 50)} is VALID [2022-04-15 15:19:09,245 INFO L290 TraceCheckUtils]: 129: Hoare triple {121714#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121707#(< ~counter~0 50)} is VALID [2022-04-15 15:19:09,245 INFO L290 TraceCheckUtils]: 128: Hoare triple {121714#(< ~counter~0 49)} assume !(~r~0 > 0); {121714#(< ~counter~0 49)} is VALID [2022-04-15 15:19:09,246 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {121261#true} {121714#(< ~counter~0 49)} #96#return; {121714#(< ~counter~0 49)} is VALID [2022-04-15 15:19:09,246 INFO L290 TraceCheckUtils]: 126: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,246 INFO L290 TraceCheckUtils]: 125: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,246 INFO L290 TraceCheckUtils]: 124: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,246 INFO L272 TraceCheckUtils]: 123: Hoare triple {121714#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:19:09,247 INFO L290 TraceCheckUtils]: 122: Hoare triple {121714#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {121714#(< ~counter~0 49)} is VALID [2022-04-15 15:19:09,248 INFO L290 TraceCheckUtils]: 121: Hoare triple {121739#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121714#(< ~counter~0 49)} is VALID [2022-04-15 15:19:09,248 INFO L290 TraceCheckUtils]: 120: Hoare triple {121739#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121739#(< ~counter~0 48)} is VALID [2022-04-15 15:19:09,248 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {121261#true} {121739#(< ~counter~0 48)} #96#return; {121739#(< ~counter~0 48)} is VALID [2022-04-15 15:19:09,248 INFO L290 TraceCheckUtils]: 118: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,248 INFO L290 TraceCheckUtils]: 117: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,249 INFO L272 TraceCheckUtils]: 115: Hoare triple {121739#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:19:09,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {121739#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {121739#(< ~counter~0 48)} is VALID [2022-04-15 15:19:09,250 INFO L290 TraceCheckUtils]: 113: Hoare triple {121764#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121739#(< ~counter~0 48)} is VALID [2022-04-15 15:19:09,250 INFO L290 TraceCheckUtils]: 112: Hoare triple {121764#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121764#(< ~counter~0 47)} is VALID [2022-04-15 15:19:09,251 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {121261#true} {121764#(< ~counter~0 47)} #96#return; {121764#(< ~counter~0 47)} is VALID [2022-04-15 15:19:09,251 INFO L290 TraceCheckUtils]: 110: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,251 INFO L290 TraceCheckUtils]: 109: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,251 INFO L290 TraceCheckUtils]: 108: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,251 INFO L272 TraceCheckUtils]: 107: Hoare triple {121764#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:19:09,251 INFO L290 TraceCheckUtils]: 106: Hoare triple {121764#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {121764#(< ~counter~0 47)} is VALID [2022-04-15 15:19:09,252 INFO L290 TraceCheckUtils]: 105: Hoare triple {121789#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121764#(< ~counter~0 47)} is VALID [2022-04-15 15:19:09,252 INFO L290 TraceCheckUtils]: 104: Hoare triple {121789#(< ~counter~0 46)} assume !!(0 != ~r~0); {121789#(< ~counter~0 46)} is VALID [2022-04-15 15:19:09,253 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {121261#true} {121789#(< ~counter~0 46)} #94#return; {121789#(< ~counter~0 46)} is VALID [2022-04-15 15:19:09,253 INFO L290 TraceCheckUtils]: 102: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,253 INFO L290 TraceCheckUtils]: 101: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,253 INFO L290 TraceCheckUtils]: 100: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,253 INFO L272 TraceCheckUtils]: 99: Hoare triple {121789#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:19:09,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {121789#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {121789#(< ~counter~0 46)} is VALID [2022-04-15 15:19:09,255 INFO L290 TraceCheckUtils]: 97: Hoare triple {121814#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121789#(< ~counter~0 46)} is VALID [2022-04-15 15:19:09,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {121814#(< ~counter~0 45)} assume !(~r~0 < 0); {121814#(< ~counter~0 45)} is VALID [2022-04-15 15:19:09,255 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {121261#true} {121814#(< ~counter~0 45)} #98#return; {121814#(< ~counter~0 45)} is VALID [2022-04-15 15:19:09,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,256 INFO L290 TraceCheckUtils]: 92: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,256 INFO L272 TraceCheckUtils]: 91: Hoare triple {121814#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:19:09,256 INFO L290 TraceCheckUtils]: 90: Hoare triple {121814#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {121814#(< ~counter~0 45)} is VALID [2022-04-15 15:19:09,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {121839#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121814#(< ~counter~0 45)} is VALID [2022-04-15 15:19:09,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {121839#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121839#(< ~counter~0 44)} is VALID [2022-04-15 15:19:09,258 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {121261#true} {121839#(< ~counter~0 44)} #98#return; {121839#(< ~counter~0 44)} is VALID [2022-04-15 15:19:09,258 INFO L290 TraceCheckUtils]: 86: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,258 INFO L290 TraceCheckUtils]: 85: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,258 INFO L290 TraceCheckUtils]: 84: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,258 INFO L272 TraceCheckUtils]: 83: Hoare triple {121839#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:19:09,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {121839#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {121839#(< ~counter~0 44)} is VALID [2022-04-15 15:19:09,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {121864#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121839#(< ~counter~0 44)} is VALID [2022-04-15 15:19:09,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {121864#(< ~counter~0 43)} assume !(~r~0 > 0); {121864#(< ~counter~0 43)} is VALID [2022-04-15 15:19:09,260 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {121261#true} {121864#(< ~counter~0 43)} #96#return; {121864#(< ~counter~0 43)} is VALID [2022-04-15 15:19:09,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,260 INFO L290 TraceCheckUtils]: 77: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,260 INFO L290 TraceCheckUtils]: 76: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,260 INFO L272 TraceCheckUtils]: 75: Hoare triple {121864#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:19:09,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {121864#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {121864#(< ~counter~0 43)} is VALID [2022-04-15 15:19:09,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {121889#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121864#(< ~counter~0 43)} is VALID [2022-04-15 15:19:09,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {121889#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121889#(< ~counter~0 42)} is VALID [2022-04-15 15:19:09,262 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {121261#true} {121889#(< ~counter~0 42)} #96#return; {121889#(< ~counter~0 42)} is VALID [2022-04-15 15:19:09,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,263 INFO L272 TraceCheckUtils]: 67: Hoare triple {121889#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:19:09,263 INFO L290 TraceCheckUtils]: 66: Hoare triple {121889#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {121889#(< ~counter~0 42)} is VALID [2022-04-15 15:19:09,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {121914#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121889#(< ~counter~0 42)} is VALID [2022-04-15 15:19:09,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {121914#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {121914#(< ~counter~0 41)} is VALID [2022-04-15 15:19:09,265 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {121261#true} {121914#(< ~counter~0 41)} #96#return; {121914#(< ~counter~0 41)} is VALID [2022-04-15 15:19:09,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,265 INFO L272 TraceCheckUtils]: 59: Hoare triple {121914#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:19:09,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {121914#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {121914#(< ~counter~0 41)} is VALID [2022-04-15 15:19:09,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {121939#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {121914#(< ~counter~0 41)} is VALID [2022-04-15 15:19:09,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {121939#(< ~counter~0 40)} assume !!(0 != ~r~0); {121939#(< ~counter~0 40)} is VALID [2022-04-15 15:19:09,267 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {121261#true} {121939#(< ~counter~0 40)} #94#return; {121939#(< ~counter~0 40)} is VALID [2022-04-15 15:19:09,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,267 INFO L290 TraceCheckUtils]: 53: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,267 INFO L290 TraceCheckUtils]: 52: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,267 INFO L272 TraceCheckUtils]: 51: Hoare triple {121939#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:19:09,267 INFO L290 TraceCheckUtils]: 50: Hoare triple {121939#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {121939#(< ~counter~0 40)} is VALID [2022-04-15 15:19:09,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {121964#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {121939#(< ~counter~0 40)} is VALID [2022-04-15 15:19:09,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {121964#(< ~counter~0 39)} assume !(~r~0 < 0); {121964#(< ~counter~0 39)} is VALID [2022-04-15 15:19:09,269 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {121261#true} {121964#(< ~counter~0 39)} #98#return; {121964#(< ~counter~0 39)} is VALID [2022-04-15 15:19:09,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,269 INFO L272 TraceCheckUtils]: 43: Hoare triple {121964#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:19:09,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {121964#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {121964#(< ~counter~0 39)} is VALID [2022-04-15 15:19:09,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {121989#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121964#(< ~counter~0 39)} is VALID [2022-04-15 15:19:09,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {121989#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {121989#(< ~counter~0 38)} is VALID [2022-04-15 15:19:09,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {121261#true} {121989#(< ~counter~0 38)} #98#return; {121989#(< ~counter~0 38)} is VALID [2022-04-15 15:19:09,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,272 INFO L272 TraceCheckUtils]: 35: Hoare triple {121989#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:19:09,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {121989#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {121989#(< ~counter~0 38)} is VALID [2022-04-15 15:19:09,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {122014#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {121989#(< ~counter~0 38)} is VALID [2022-04-15 15:19:09,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {122014#(< ~counter~0 37)} assume !(~r~0 > 0); {122014#(< ~counter~0 37)} is VALID [2022-04-15 15:19:09,274 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {121261#true} {122014#(< ~counter~0 37)} #96#return; {122014#(< ~counter~0 37)} is VALID [2022-04-15 15:19:09,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,274 INFO L272 TraceCheckUtils]: 27: Hoare triple {122014#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:19:09,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {122014#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {122014#(< ~counter~0 37)} is VALID [2022-04-15 15:19:09,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {122039#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122014#(< ~counter~0 37)} is VALID [2022-04-15 15:19:09,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {122039#(< ~counter~0 36)} assume !!(0 != ~r~0); {122039#(< ~counter~0 36)} is VALID [2022-04-15 15:19:09,276 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {121261#true} {122039#(< ~counter~0 36)} #94#return; {122039#(< ~counter~0 36)} is VALID [2022-04-15 15:19:09,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,276 INFO L272 TraceCheckUtils]: 19: Hoare triple {122039#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:19:09,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {122039#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {122039#(< ~counter~0 36)} is VALID [2022-04-15 15:19:09,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {122064#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122039#(< ~counter~0 36)} is VALID [2022-04-15 15:19:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {122064#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {121261#true} {122064#(< ~counter~0 35)} #92#return; {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {122064#(< ~counter~0 35)} call assume_abort_if_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-15 15:19:09,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {121261#true} {122064#(< ~counter~0 35)} #90#return; {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {121261#true} assume true; {121261#true} is VALID [2022-04-15 15:19:09,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {121261#true} assume !(0 == ~cond); {121261#true} is VALID [2022-04-15 15:19:09,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {121261#true} ~cond := #in~cond; {121261#true} is VALID [2022-04-15 15:19:09,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {122064#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {121261#true} is VALID [2022-04-15 15:19:09,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {122064#(< ~counter~0 35)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 35)} is VALID [2022-04-15 15:19:09,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {122064#(< ~counter~0 35)} call #t~ret9 := main(); {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122064#(< ~counter~0 35)} {121261#true} #102#return; {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {122064#(< ~counter~0 35)} assume true; {122064#(< ~counter~0 35)} is VALID [2022-04-15 15:19:09,281 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 35)} is VALID [2022-04-15 15:19:09,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {121261#true} call ULTIMATE.init(); {121261#true} is VALID [2022-04-15 15:19:09,281 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-15 15:19:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199853168] [2022-04-15 15:19:09,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446262965] [2022-04-15 15:19:09,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446262965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:09,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:09,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:19:09,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1860314947] [2022-04-15 15:19:09,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1860314947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:09,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:09,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:19:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114497083] [2022-04-15 15:19:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:09,283 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-15 15:19:09,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:09,283 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-15 15:19:09,407 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-15 15:19:09,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:19:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:19:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:19:09,408 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-15 15:19:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:14,034 INFO L93 Difference]: Finished difference Result 807 states and 1089 transitions. [2022-04-15 15:19:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 15:19:14,034 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-15 15:19:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:14,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-15 15:19:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:19:14,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-15 15:19:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:19:14,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-15 15:19:14,376 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-15 15:19:14,403 INFO L225 Difference]: With dead ends: 807 [2022-04-15 15:19:14,404 INFO L226 Difference]: Without dead ends: 802 [2022-04-15 15:19:14,404 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-15 15:19:14,405 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 336 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 15:19:14,405 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.6s Time] [2022-04-15 15:19:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-04-15 15:19:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 775. [2022-04-15 15:19:17,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:17,116 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-15 15:19:17,117 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-15 15:19:17,117 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-15 15:19:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:17,138 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-15 15:19:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-15 15:19:17,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:17,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:17,139 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-15 15:19:17,140 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-15 15:19:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:17,161 INFO L93 Difference]: Finished difference Result 802 states and 1078 transitions. [2022-04-15 15:19:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1078 transitions. [2022-04-15 15:19:17,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:17,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:17,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:17,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:17,163 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-15 15:19:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1047 transitions. [2022-04-15 15:19:17,211 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1047 transitions. Word has length 137 [2022-04-15 15:19:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:17,211 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1047 transitions. [2022-04-15 15:19:17,211 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-15 15:19:17,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1047 transitions. [2022-04-15 15:19:26,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1047 edges. 1045 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1047 transitions. [2022-04-15 15:19:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 15:19:26,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:26,274 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-15 15:19:26,280 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-15 15:19:26,475 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-15 15:19:26,475 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-15 15:19:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155030827] [2022-04-15 15:19:26,476 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-15 15:19:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:26,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014313385] [2022-04-15 15:19:26,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:26,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:26,488 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:26,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996886931] [2022-04-15 15:19:26,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:19:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:26,490 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-15 15:19:26,490 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-15 15:19:26,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:19:26,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:26,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 15:19:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:26,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:27,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {126910#true} call ULTIMATE.init(); {126910#true} is VALID [2022-04-15 15:19:27,301 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-15 15:19:27,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126918#(<= ~counter~0 0)} {126910#true} #102#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {126918#(<= ~counter~0 0)} call #t~ret9 := main(); {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,302 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-15 15:19:27,302 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-15 15:19:27,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {126918#(<= ~counter~0 0)} ~cond := #in~cond; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {126918#(<= ~counter~0 0)} assume !(0 == ~cond); {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126918#(<= ~counter~0 0)} {126918#(<= ~counter~0 0)} #90#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,304 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-15 15:19:27,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {126918#(<= ~counter~0 0)} ~cond := #in~cond; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {126918#(<= ~counter~0 0)} assume !(0 == ~cond); {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {126918#(<= ~counter~0 0)} assume true; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126918#(<= ~counter~0 0)} {126918#(<= ~counter~0 0)} #92#return; {126918#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:27,306 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-15 15:19:27,308 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-15 15:19:27,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {126967#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,309 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-15 15:19:27,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {126967#(<= ~counter~0 1)} ~cond := #in~cond; {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {126967#(<= ~counter~0 1)} assume !(0 == ~cond); {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {126967#(<= ~counter~0 1)} assume true; {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,310 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126967#(<= ~counter~0 1)} {126967#(<= ~counter~0 1)} #94#return; {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {126967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {126967#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:27,311 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-15 15:19:27,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {126992#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,312 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-15 15:19:27,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {126992#(<= ~counter~0 2)} ~cond := #in~cond; {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {126992#(<= ~counter~0 2)} assume !(0 == ~cond); {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {126992#(<= ~counter~0 2)} assume true; {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,313 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126992#(<= ~counter~0 2)} {126992#(<= ~counter~0 2)} #96#return; {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {126992#(<= ~counter~0 2)} assume !(~r~0 > 0); {126992#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:27,315 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-15 15:19:27,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {127017#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {127017#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:27,315 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-15 15:19:27,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {127017#(<= ~counter~0 3)} ~cond := #in~cond; {127017#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:27,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {127017#(<= ~counter~0 3)} assume !(0 == ~cond); {127017#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:27,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {127017#(<= ~counter~0 3)} assume true; {127017#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:27,317 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127017#(<= ~counter~0 3)} {127017#(<= ~counter~0 3)} #98#return; {127017#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:27,317 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-15 15:19:27,318 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-15 15:19:27,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {127042#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,319 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-15 15:19:27,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {127042#(<= ~counter~0 4)} ~cond := #in~cond; {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,319 INFO L290 TraceCheckUtils]: 45: Hoare triple {127042#(<= ~counter~0 4)} assume !(0 == ~cond); {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,319 INFO L290 TraceCheckUtils]: 46: Hoare triple {127042#(<= ~counter~0 4)} assume true; {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,320 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127042#(<= ~counter~0 4)} {127042#(<= ~counter~0 4)} #98#return; {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {127042#(<= ~counter~0 4)} assume !(~r~0 < 0); {127042#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:27,321 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-15 15:19:27,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {127067#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,322 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-15 15:19:27,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {127067#(<= ~counter~0 5)} ~cond := #in~cond; {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,323 INFO L290 TraceCheckUtils]: 53: Hoare triple {127067#(<= ~counter~0 5)} assume !(0 == ~cond); {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,323 INFO L290 TraceCheckUtils]: 54: Hoare triple {127067#(<= ~counter~0 5)} assume true; {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,323 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127067#(<= ~counter~0 5)} {127067#(<= ~counter~0 5)} #94#return; {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,324 INFO L290 TraceCheckUtils]: 56: Hoare triple {127067#(<= ~counter~0 5)} assume !!(0 != ~r~0); {127067#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:27,325 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-15 15:19:27,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {127092#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {127092#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:27,325 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-15 15:19:27,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {127092#(<= ~counter~0 6)} ~cond := #in~cond; {127092#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:27,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {127092#(<= ~counter~0 6)} assume !(0 == ~cond); {127092#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:27,326 INFO L290 TraceCheckUtils]: 62: Hoare triple {127092#(<= ~counter~0 6)} assume true; {127092#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:27,327 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127092#(<= ~counter~0 6)} {127092#(<= ~counter~0 6)} #96#return; {127092#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:27,327 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-15 15:19:27,328 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-15 15:19:27,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {127117#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {127117#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:27,329 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-15 15:19:27,329 INFO L290 TraceCheckUtils]: 68: Hoare triple {127117#(<= ~counter~0 7)} ~cond := #in~cond; {127117#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:27,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {127117#(<= ~counter~0 7)} assume !(0 == ~cond); {127117#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:27,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {127117#(<= ~counter~0 7)} assume true; {127117#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:27,330 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127117#(<= ~counter~0 7)} {127117#(<= ~counter~0 7)} #96#return; {127117#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:27,330 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-15 15:19:27,331 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-15 15:19:27,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {127142#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,332 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-15 15:19:27,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {127142#(<= ~counter~0 8)} ~cond := #in~cond; {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,333 INFO L290 TraceCheckUtils]: 77: Hoare triple {127142#(<= ~counter~0 8)} assume !(0 == ~cond); {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {127142#(<= ~counter~0 8)} assume true; {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,333 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127142#(<= ~counter~0 8)} {127142#(<= ~counter~0 8)} #96#return; {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {127142#(<= ~counter~0 8)} assume !(~r~0 > 0); {127142#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:27,335 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-15 15:19:27,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {127167#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {127167#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:27,335 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-15 15:19:27,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {127167#(<= ~counter~0 9)} ~cond := #in~cond; {127167#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:27,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {127167#(<= ~counter~0 9)} assume !(0 == ~cond); {127167#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:27,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {127167#(<= ~counter~0 9)} assume true; {127167#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:27,337 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127167#(<= ~counter~0 9)} {127167#(<= ~counter~0 9)} #98#return; {127167#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:27,337 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-15 15:19:27,338 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-15 15:19:27,338 INFO L290 TraceCheckUtils]: 90: Hoare triple {127192#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,339 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-15 15:19:27,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {127192#(<= ~counter~0 10)} ~cond := #in~cond; {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {127192#(<= ~counter~0 10)} assume !(0 == ~cond); {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,340 INFO L290 TraceCheckUtils]: 94: Hoare triple {127192#(<= ~counter~0 10)} assume true; {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,340 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127192#(<= ~counter~0 10)} {127192#(<= ~counter~0 10)} #98#return; {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,340 INFO L290 TraceCheckUtils]: 96: Hoare triple {127192#(<= ~counter~0 10)} assume !(~r~0 < 0); {127192#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:27,341 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-15 15:19:27,342 INFO L290 TraceCheckUtils]: 98: Hoare triple {127217#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,342 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-15 15:19:27,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {127217#(<= ~counter~0 11)} ~cond := #in~cond; {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {127217#(<= ~counter~0 11)} assume !(0 == ~cond); {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {127217#(<= ~counter~0 11)} assume true; {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,343 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127217#(<= ~counter~0 11)} {127217#(<= ~counter~0 11)} #94#return; {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,344 INFO L290 TraceCheckUtils]: 104: Hoare triple {127217#(<= ~counter~0 11)} assume !!(0 != ~r~0); {127217#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:27,345 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-15 15:19:27,345 INFO L290 TraceCheckUtils]: 106: Hoare triple {127242#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {127242#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:27,345 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-15 15:19:27,346 INFO L290 TraceCheckUtils]: 108: Hoare triple {127242#(<= ~counter~0 12)} ~cond := #in~cond; {127242#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:27,346 INFO L290 TraceCheckUtils]: 109: Hoare triple {127242#(<= ~counter~0 12)} assume !(0 == ~cond); {127242#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:27,346 INFO L290 TraceCheckUtils]: 110: Hoare triple {127242#(<= ~counter~0 12)} assume true; {127242#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:27,347 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127242#(<= ~counter~0 12)} {127242#(<= ~counter~0 12)} #96#return; {127242#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:27,347 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-15 15:19:27,348 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-15 15:19:27,348 INFO L290 TraceCheckUtils]: 114: Hoare triple {127267#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {127267#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:27,349 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-15 15:19:27,349 INFO L290 TraceCheckUtils]: 116: Hoare triple {127267#(<= ~counter~0 13)} ~cond := #in~cond; {127267#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:27,349 INFO L290 TraceCheckUtils]: 117: Hoare triple {127267#(<= ~counter~0 13)} assume !(0 == ~cond); {127267#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:27,350 INFO L290 TraceCheckUtils]: 118: Hoare triple {127267#(<= ~counter~0 13)} assume true; {127267#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:27,350 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127267#(<= ~counter~0 13)} {127267#(<= ~counter~0 13)} #96#return; {127267#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:27,350 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-15 15:19:27,351 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-15 15:19:27,352 INFO L290 TraceCheckUtils]: 122: Hoare triple {127292#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {127292#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:27,352 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-15 15:19:27,352 INFO L290 TraceCheckUtils]: 124: Hoare triple {127292#(<= ~counter~0 14)} ~cond := #in~cond; {127292#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:27,353 INFO L290 TraceCheckUtils]: 125: Hoare triple {127292#(<= ~counter~0 14)} assume !(0 == ~cond); {127292#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:27,353 INFO L290 TraceCheckUtils]: 126: Hoare triple {127292#(<= ~counter~0 14)} assume true; {127292#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:27,353 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127292#(<= ~counter~0 14)} {127292#(<= ~counter~0 14)} #96#return; {127292#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:27,354 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-15 15:19:27,354 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-15 15:19:27,354 INFO L290 TraceCheckUtils]: 130: Hoare triple {127317#(<= |main_#t~post7| 14)} assume !(#t~post7 < 50);havoc #t~post7; {126911#false} is VALID [2022-04-15 15:19:27,354 INFO L290 TraceCheckUtils]: 131: Hoare triple {126911#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126911#false} is VALID [2022-04-15 15:19:27,354 INFO L290 TraceCheckUtils]: 132: Hoare triple {126911#false} assume !(#t~post8 < 50);havoc #t~post8; {126911#false} is VALID [2022-04-15 15:19:27,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {126911#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126911#false} is VALID [2022-04-15 15:19:27,355 INFO L290 TraceCheckUtils]: 134: Hoare triple {126911#false} assume !(#t~post6 < 50);havoc #t~post6; {126911#false} is VALID [2022-04-15 15:19:27,355 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-15 15:19:27,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {126911#false} ~cond := #in~cond; {126911#false} is VALID [2022-04-15 15:19:27,355 INFO L290 TraceCheckUtils]: 137: Hoare triple {126911#false} assume 0 == ~cond; {126911#false} is VALID [2022-04-15 15:19:27,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {126911#false} assume !false; {126911#false} is VALID [2022-04-15 15:19:27,355 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-15 15:19:27,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:28,180 INFO L290 TraceCheckUtils]: 138: Hoare triple {126911#false} assume !false; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {126911#false} assume 0 == ~cond; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {126911#false} ~cond := #in~cond; {126911#false} is VALID [2022-04-15 15:19:28,181 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-15 15:19:28,181 INFO L290 TraceCheckUtils]: 134: Hoare triple {126911#false} assume !(#t~post6 < 50);havoc #t~post6; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 133: Hoare triple {126911#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 132: Hoare triple {126911#false} assume !(#t~post8 < 50);havoc #t~post8; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 131: Hoare triple {126911#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126911#false} is VALID [2022-04-15 15:19:28,181 INFO L290 TraceCheckUtils]: 130: Hoare triple {127369#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {126911#false} is VALID [2022-04-15 15:19:28,182 INFO L290 TraceCheckUtils]: 129: Hoare triple {127373#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127369#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:19:28,182 INFO L290 TraceCheckUtils]: 128: Hoare triple {127373#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127373#(< ~counter~0 50)} is VALID [2022-04-15 15:19:28,182 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {126910#true} {127373#(< ~counter~0 50)} #96#return; {127373#(< ~counter~0 50)} is VALID [2022-04-15 15:19:28,183 INFO L290 TraceCheckUtils]: 126: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,183 INFO L290 TraceCheckUtils]: 125: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,183 INFO L290 TraceCheckUtils]: 124: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,183 INFO L272 TraceCheckUtils]: 123: Hoare triple {127373#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:19:28,183 INFO L290 TraceCheckUtils]: 122: Hoare triple {127373#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {127373#(< ~counter~0 50)} is VALID [2022-04-15 15:19:28,185 INFO L290 TraceCheckUtils]: 121: Hoare triple {127398#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127373#(< ~counter~0 50)} is VALID [2022-04-15 15:19:28,186 INFO L290 TraceCheckUtils]: 120: Hoare triple {127398#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127398#(< ~counter~0 49)} is VALID [2022-04-15 15:19:28,186 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {126910#true} {127398#(< ~counter~0 49)} #96#return; {127398#(< ~counter~0 49)} is VALID [2022-04-15 15:19:28,186 INFO L290 TraceCheckUtils]: 118: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,186 INFO L290 TraceCheckUtils]: 117: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,186 INFO L290 TraceCheckUtils]: 116: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,186 INFO L272 TraceCheckUtils]: 115: Hoare triple {127398#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:19:28,187 INFO L290 TraceCheckUtils]: 114: Hoare triple {127398#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {127398#(< ~counter~0 49)} is VALID [2022-04-15 15:19:28,188 INFO L290 TraceCheckUtils]: 113: Hoare triple {127423#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127398#(< ~counter~0 49)} is VALID [2022-04-15 15:19:28,188 INFO L290 TraceCheckUtils]: 112: Hoare triple {127423#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127423#(< ~counter~0 48)} is VALID [2022-04-15 15:19:28,188 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {126910#true} {127423#(< ~counter~0 48)} #96#return; {127423#(< ~counter~0 48)} is VALID [2022-04-15 15:19:28,188 INFO L290 TraceCheckUtils]: 110: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,189 INFO L290 TraceCheckUtils]: 109: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,189 INFO L290 TraceCheckUtils]: 108: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,189 INFO L272 TraceCheckUtils]: 107: Hoare triple {127423#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:19:28,189 INFO L290 TraceCheckUtils]: 106: Hoare triple {127423#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {127423#(< ~counter~0 48)} is VALID [2022-04-15 15:19:28,190 INFO L290 TraceCheckUtils]: 105: Hoare triple {127448#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127423#(< ~counter~0 48)} is VALID [2022-04-15 15:19:28,190 INFO L290 TraceCheckUtils]: 104: Hoare triple {127448#(< ~counter~0 47)} assume !!(0 != ~r~0); {127448#(< ~counter~0 47)} is VALID [2022-04-15 15:19:28,191 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {126910#true} {127448#(< ~counter~0 47)} #94#return; {127448#(< ~counter~0 47)} is VALID [2022-04-15 15:19:28,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,191 INFO L290 TraceCheckUtils]: 101: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,191 INFO L290 TraceCheckUtils]: 100: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,191 INFO L272 TraceCheckUtils]: 99: Hoare triple {127448#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:19:28,191 INFO L290 TraceCheckUtils]: 98: Hoare triple {127448#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {127448#(< ~counter~0 47)} is VALID [2022-04-15 15:19:28,192 INFO L290 TraceCheckUtils]: 97: Hoare triple {127473#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127448#(< ~counter~0 47)} is VALID [2022-04-15 15:19:28,193 INFO L290 TraceCheckUtils]: 96: Hoare triple {127473#(< ~counter~0 46)} assume !(~r~0 < 0); {127473#(< ~counter~0 46)} is VALID [2022-04-15 15:19:28,193 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {126910#true} {127473#(< ~counter~0 46)} #98#return; {127473#(< ~counter~0 46)} is VALID [2022-04-15 15:19:28,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,193 INFO L290 TraceCheckUtils]: 92: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,193 INFO L272 TraceCheckUtils]: 91: Hoare triple {127473#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:19:28,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {127473#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {127473#(< ~counter~0 46)} is VALID [2022-04-15 15:19:28,195 INFO L290 TraceCheckUtils]: 89: Hoare triple {127498#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127473#(< ~counter~0 46)} is VALID [2022-04-15 15:19:28,195 INFO L290 TraceCheckUtils]: 88: Hoare triple {127498#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127498#(< ~counter~0 45)} is VALID [2022-04-15 15:19:28,195 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {126910#true} {127498#(< ~counter~0 45)} #98#return; {127498#(< ~counter~0 45)} is VALID [2022-04-15 15:19:28,195 INFO L290 TraceCheckUtils]: 86: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,196 INFO L290 TraceCheckUtils]: 85: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,196 INFO L290 TraceCheckUtils]: 84: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,196 INFO L272 TraceCheckUtils]: 83: Hoare triple {127498#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:19:28,196 INFO L290 TraceCheckUtils]: 82: Hoare triple {127498#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {127498#(< ~counter~0 45)} is VALID [2022-04-15 15:19:28,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {127523#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127498#(< ~counter~0 45)} is VALID [2022-04-15 15:19:28,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {127523#(< ~counter~0 44)} assume !(~r~0 > 0); {127523#(< ~counter~0 44)} is VALID [2022-04-15 15:19:28,198 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {126910#true} {127523#(< ~counter~0 44)} #96#return; {127523#(< ~counter~0 44)} is VALID [2022-04-15 15:19:28,198 INFO L290 TraceCheckUtils]: 78: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,198 INFO L272 TraceCheckUtils]: 75: Hoare triple {127523#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:19:28,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {127523#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {127523#(< ~counter~0 44)} is VALID [2022-04-15 15:19:28,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {127548#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127523#(< ~counter~0 44)} is VALID [2022-04-15 15:19:28,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {127548#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127548#(< ~counter~0 43)} is VALID [2022-04-15 15:19:28,200 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {126910#true} {127548#(< ~counter~0 43)} #96#return; {127548#(< ~counter~0 43)} is VALID [2022-04-15 15:19:28,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,200 INFO L272 TraceCheckUtils]: 67: Hoare triple {127548#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:19:28,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {127548#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {127548#(< ~counter~0 43)} is VALID [2022-04-15 15:19:28,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {127573#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127548#(< ~counter~0 43)} is VALID [2022-04-15 15:19:28,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {127573#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127573#(< ~counter~0 42)} is VALID [2022-04-15 15:19:28,202 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126910#true} {127573#(< ~counter~0 42)} #96#return; {127573#(< ~counter~0 42)} is VALID [2022-04-15 15:19:28,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,203 INFO L272 TraceCheckUtils]: 59: Hoare triple {127573#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:19:28,203 INFO L290 TraceCheckUtils]: 58: Hoare triple {127573#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {127573#(< ~counter~0 42)} is VALID [2022-04-15 15:19:28,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {127598#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127573#(< ~counter~0 42)} is VALID [2022-04-15 15:19:28,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {127598#(< ~counter~0 41)} assume !!(0 != ~r~0); {127598#(< ~counter~0 41)} is VALID [2022-04-15 15:19:28,205 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {126910#true} {127598#(< ~counter~0 41)} #94#return; {127598#(< ~counter~0 41)} is VALID [2022-04-15 15:19:28,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,205 INFO L272 TraceCheckUtils]: 51: Hoare triple {127598#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:19:28,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {127598#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {127598#(< ~counter~0 41)} is VALID [2022-04-15 15:19:28,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {127623#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127598#(< ~counter~0 41)} is VALID [2022-04-15 15:19:28,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {127623#(< ~counter~0 40)} assume !(~r~0 < 0); {127623#(< ~counter~0 40)} is VALID [2022-04-15 15:19:28,207 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {126910#true} {127623#(< ~counter~0 40)} #98#return; {127623#(< ~counter~0 40)} is VALID [2022-04-15 15:19:28,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,207 INFO L272 TraceCheckUtils]: 43: Hoare triple {127623#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:19:28,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {127623#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {127623#(< ~counter~0 40)} is VALID [2022-04-15 15:19:28,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {127648#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127623#(< ~counter~0 40)} is VALID [2022-04-15 15:19:28,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {127648#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127648#(< ~counter~0 39)} is VALID [2022-04-15 15:19:28,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126910#true} {127648#(< ~counter~0 39)} #98#return; {127648#(< ~counter~0 39)} is VALID [2022-04-15 15:19:28,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,209 INFO L272 TraceCheckUtils]: 35: Hoare triple {127648#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:19:28,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {127648#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {127648#(< ~counter~0 39)} is VALID [2022-04-15 15:19:28,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {127673#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127648#(< ~counter~0 39)} is VALID [2022-04-15 15:19:28,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {127673#(< ~counter~0 38)} assume !(~r~0 > 0); {127673#(< ~counter~0 38)} is VALID [2022-04-15 15:19:28,211 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {126910#true} {127673#(< ~counter~0 38)} #96#return; {127673#(< ~counter~0 38)} is VALID [2022-04-15 15:19:28,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,212 INFO L272 TraceCheckUtils]: 27: Hoare triple {127673#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:19:28,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {127673#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {127673#(< ~counter~0 38)} is VALID [2022-04-15 15:19:28,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {127698#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127673#(< ~counter~0 38)} is VALID [2022-04-15 15:19:28,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {127698#(< ~counter~0 37)} assume !!(0 != ~r~0); {127698#(< ~counter~0 37)} is VALID [2022-04-15 15:19:28,214 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {126910#true} {127698#(< ~counter~0 37)} #94#return; {127698#(< ~counter~0 37)} is VALID [2022-04-15 15:19:28,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,214 INFO L272 TraceCheckUtils]: 19: Hoare triple {127698#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:19:28,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {127698#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {127698#(< ~counter~0 37)} is VALID [2022-04-15 15:19:28,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {127723#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127698#(< ~counter~0 37)} is VALID [2022-04-15 15:19:28,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {127723#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,216 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126910#true} {127723#(< ~counter~0 36)} #92#return; {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,216 INFO L272 TraceCheckUtils]: 11: Hoare triple {127723#(< ~counter~0 36)} call assume_abort_if_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-15 15:19:28,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126910#true} {127723#(< ~counter~0 36)} #90#return; {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {126910#true} assume true; {126910#true} is VALID [2022-04-15 15:19:28,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {126910#true} assume !(0 == ~cond); {126910#true} is VALID [2022-04-15 15:19:28,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {126910#true} ~cond := #in~cond; {126910#true} is VALID [2022-04-15 15:19:28,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {127723#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {126910#true} is VALID [2022-04-15 15:19:28,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {127723#(< ~counter~0 36)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 36)} is VALID [2022-04-15 15:19:28,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {127723#(< ~counter~0 36)} call #t~ret9 := main(); {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127723#(< ~counter~0 36)} {126910#true} #102#return; {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {127723#(< ~counter~0 36)} assume true; {127723#(< ~counter~0 36)} is VALID [2022-04-15 15:19:28,219 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 36)} is VALID [2022-04-15 15:19:28,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {126910#true} call ULTIMATE.init(); {126910#true} is VALID [2022-04-15 15:19:28,219 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-15 15:19:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014313385] [2022-04-15 15:19:28,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:28,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996886931] [2022-04-15 15:19:28,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996886931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:28,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:28,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-15 15:19:28,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155030827] [2022-04-15 15:19:28,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155030827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:28,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:28,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:19:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910059973] [2022-04-15 15:19:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:28,220 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-15 15:19:28,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:28,221 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-15 15:19:28,362 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-15 15:19:28,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:19:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:19:28,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:19:28,363 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-15 15:19:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:32,525 INFO L93 Difference]: Finished difference Result 945 states and 1302 transitions. [2022-04-15 15:19:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 15:19:32,525 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-15 15:19:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:32,526 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-15 15:19:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:19:32,529 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-15 15:19:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:19:32,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-15 15:19:32,851 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-15 15:19:32,877 INFO L225 Difference]: With dead ends: 945 [2022-04-15 15:19:32,877 INFO L226 Difference]: Without dead ends: 775 [2022-04-15 15:19:32,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 15:19:32,878 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-15 15:19:32,878 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-15 15:19:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-04-15 15:19:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-04-15 15:19:35,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:35,749 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-15 15:19:35,750 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-15 15:19:35,750 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-15 15:19:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:35,770 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-15 15:19:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-15 15:19:35,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:35,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:35,771 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-15 15:19:35,772 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-15 15:19:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:35,792 INFO L93 Difference]: Finished difference Result 775 states and 1041 transitions. [2022-04-15 15:19:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-15 15:19:35,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:35,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:35,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:35,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:35,795 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-15 15:19:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-04-15 15:19:35,835 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 139 [2022-04-15 15:19:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:35,835 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-04-15 15:19:35,835 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-15 15:19:35,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1041 transitions. [2022-04-15 15:19:45,143 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-15 15:19:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-04-15 15:19:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 15:19:45,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:45,144 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-15 15:19:45,162 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-15 15:19:45,345 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-15 15:19:45,345 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:45,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-15 15:19:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:45,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1231176488] [2022-04-15 15:19:45,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-15 15:19:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:45,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069034119] [2022-04-15 15:19:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:45,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015501789] [2022-04-15 15:19:45,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:19:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:45,361 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-15 15:19:45,362 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-15 15:19:45,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:19:45,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:45,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:19:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:45,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:46,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {132793#true} call ULTIMATE.init(); {132793#true} is VALID [2022-04-15 15:19:46,231 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-15 15:19:46,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132801#(<= ~counter~0 0)} {132793#true} #102#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {132801#(<= ~counter~0 0)} call #t~ret9 := main(); {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,232 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-15 15:19:46,233 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-15 15:19:46,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {132801#(<= ~counter~0 0)} ~cond := #in~cond; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {132801#(<= ~counter~0 0)} assume !(0 == ~cond); {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,234 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132801#(<= ~counter~0 0)} {132801#(<= ~counter~0 0)} #90#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,234 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-15 15:19:46,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {132801#(<= ~counter~0 0)} ~cond := #in~cond; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {132801#(<= ~counter~0 0)} assume !(0 == ~cond); {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {132801#(<= ~counter~0 0)} assume true; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132801#(<= ~counter~0 0)} {132801#(<= ~counter~0 0)} #92#return; {132801#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:46,236 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-15 15:19:46,238 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-15 15:19:46,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {132850#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,239 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-15 15:19:46,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {132850#(<= ~counter~0 1)} ~cond := #in~cond; {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {132850#(<= ~counter~0 1)} assume !(0 == ~cond); {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {132850#(<= ~counter~0 1)} assume true; {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,240 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132850#(<= ~counter~0 1)} {132850#(<= ~counter~0 1)} #94#return; {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {132850#(<= ~counter~0 1)} assume !!(0 != ~r~0); {132850#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:46,242 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-15 15:19:46,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {132875#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,242 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-15 15:19:46,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {132875#(<= ~counter~0 2)} ~cond := #in~cond; {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {132875#(<= ~counter~0 2)} assume !(0 == ~cond); {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {132875#(<= ~counter~0 2)} assume true; {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,244 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132875#(<= ~counter~0 2)} {132875#(<= ~counter~0 2)} #96#return; {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {132875#(<= ~counter~0 2)} assume !(~r~0 > 0); {132875#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:46,245 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-15 15:19:46,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {132900#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {132900#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:46,246 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-15 15:19:46,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {132900#(<= ~counter~0 3)} ~cond := #in~cond; {132900#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:46,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {132900#(<= ~counter~0 3)} assume !(0 == ~cond); {132900#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:46,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {132900#(<= ~counter~0 3)} assume true; {132900#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:46,247 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132900#(<= ~counter~0 3)} {132900#(<= ~counter~0 3)} #98#return; {132900#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:46,247 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-15 15:19:46,248 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-15 15:19:46,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {132925#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,249 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-15 15:19:46,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {132925#(<= ~counter~0 4)} ~cond := #in~cond; {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {132925#(<= ~counter~0 4)} assume !(0 == ~cond); {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {132925#(<= ~counter~0 4)} assume true; {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,250 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132925#(<= ~counter~0 4)} {132925#(<= ~counter~0 4)} #98#return; {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {132925#(<= ~counter~0 4)} assume !(~r~0 < 0); {132925#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:46,252 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-15 15:19:46,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {132950#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,253 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-15 15:19:46,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {132950#(<= ~counter~0 5)} ~cond := #in~cond; {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {132950#(<= ~counter~0 5)} assume !(0 == ~cond); {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {132950#(<= ~counter~0 5)} assume true; {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,254 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132950#(<= ~counter~0 5)} {132950#(<= ~counter~0 5)} #94#return; {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {132950#(<= ~counter~0 5)} assume !!(0 != ~r~0); {132950#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:46,255 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-15 15:19:46,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {132975#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {132975#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:46,256 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-15 15:19:46,256 INFO L290 TraceCheckUtils]: 60: Hoare triple {132975#(<= ~counter~0 6)} ~cond := #in~cond; {132975#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:46,257 INFO L290 TraceCheckUtils]: 61: Hoare triple {132975#(<= ~counter~0 6)} assume !(0 == ~cond); {132975#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:46,257 INFO L290 TraceCheckUtils]: 62: Hoare triple {132975#(<= ~counter~0 6)} assume true; {132975#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:46,257 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132975#(<= ~counter~0 6)} {132975#(<= ~counter~0 6)} #96#return; {132975#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:46,258 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-15 15:19:46,259 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-15 15:19:46,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {133000#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {133000#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:46,259 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-15 15:19:46,260 INFO L290 TraceCheckUtils]: 68: Hoare triple {133000#(<= ~counter~0 7)} ~cond := #in~cond; {133000#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:46,260 INFO L290 TraceCheckUtils]: 69: Hoare triple {133000#(<= ~counter~0 7)} assume !(0 == ~cond); {133000#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:46,260 INFO L290 TraceCheckUtils]: 70: Hoare triple {133000#(<= ~counter~0 7)} assume true; {133000#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:46,261 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {133000#(<= ~counter~0 7)} {133000#(<= ~counter~0 7)} #96#return; {133000#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:46,261 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-15 15:19:46,262 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-15 15:19:46,262 INFO L290 TraceCheckUtils]: 74: Hoare triple {133025#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,263 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-15 15:19:46,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {133025#(<= ~counter~0 8)} ~cond := #in~cond; {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,263 INFO L290 TraceCheckUtils]: 77: Hoare triple {133025#(<= ~counter~0 8)} assume !(0 == ~cond); {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,264 INFO L290 TraceCheckUtils]: 78: Hoare triple {133025#(<= ~counter~0 8)} assume true; {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,264 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {133025#(<= ~counter~0 8)} {133025#(<= ~counter~0 8)} #96#return; {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {133025#(<= ~counter~0 8)} assume !(~r~0 > 0); {133025#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:46,265 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-15 15:19:46,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {133050#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {133050#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:46,266 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-15 15:19:46,266 INFO L290 TraceCheckUtils]: 84: Hoare triple {133050#(<= ~counter~0 9)} ~cond := #in~cond; {133050#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:46,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {133050#(<= ~counter~0 9)} assume !(0 == ~cond); {133050#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:46,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {133050#(<= ~counter~0 9)} assume true; {133050#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:46,267 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {133050#(<= ~counter~0 9)} {133050#(<= ~counter~0 9)} #98#return; {133050#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:46,268 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-15 15:19:46,269 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-15 15:19:46,269 INFO L290 TraceCheckUtils]: 90: Hoare triple {133075#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,270 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-15 15:19:46,270 INFO L290 TraceCheckUtils]: 92: Hoare triple {133075#(<= ~counter~0 10)} ~cond := #in~cond; {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,270 INFO L290 TraceCheckUtils]: 93: Hoare triple {133075#(<= ~counter~0 10)} assume !(0 == ~cond); {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,270 INFO L290 TraceCheckUtils]: 94: Hoare triple {133075#(<= ~counter~0 10)} assume true; {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,271 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {133075#(<= ~counter~0 10)} {133075#(<= ~counter~0 10)} #98#return; {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,271 INFO L290 TraceCheckUtils]: 96: Hoare triple {133075#(<= ~counter~0 10)} assume !(~r~0 < 0); {133075#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:46,272 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-15 15:19:46,272 INFO L290 TraceCheckUtils]: 98: Hoare triple {133100#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,273 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-15 15:19:46,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {133100#(<= ~counter~0 11)} ~cond := #in~cond; {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,274 INFO L290 TraceCheckUtils]: 101: Hoare triple {133100#(<= ~counter~0 11)} assume !(0 == ~cond); {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,274 INFO L290 TraceCheckUtils]: 102: Hoare triple {133100#(<= ~counter~0 11)} assume true; {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,274 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {133100#(<= ~counter~0 11)} {133100#(<= ~counter~0 11)} #94#return; {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,275 INFO L290 TraceCheckUtils]: 104: Hoare triple {133100#(<= ~counter~0 11)} assume !!(0 != ~r~0); {133100#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:46,276 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-15 15:19:46,276 INFO L290 TraceCheckUtils]: 106: Hoare triple {133125#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {133125#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:46,276 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-15 15:19:46,277 INFO L290 TraceCheckUtils]: 108: Hoare triple {133125#(<= ~counter~0 12)} ~cond := #in~cond; {133125#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:46,277 INFO L290 TraceCheckUtils]: 109: Hoare triple {133125#(<= ~counter~0 12)} assume !(0 == ~cond); {133125#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:46,277 INFO L290 TraceCheckUtils]: 110: Hoare triple {133125#(<= ~counter~0 12)} assume true; {133125#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:46,278 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {133125#(<= ~counter~0 12)} {133125#(<= ~counter~0 12)} #96#return; {133125#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:46,278 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-15 15:19:46,279 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-15 15:19:46,279 INFO L290 TraceCheckUtils]: 114: Hoare triple {133150#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {133150#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:46,280 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-15 15:19:46,280 INFO L290 TraceCheckUtils]: 116: Hoare triple {133150#(<= ~counter~0 13)} ~cond := #in~cond; {133150#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:46,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {133150#(<= ~counter~0 13)} assume !(0 == ~cond); {133150#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:46,281 INFO L290 TraceCheckUtils]: 118: Hoare triple {133150#(<= ~counter~0 13)} assume true; {133150#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:46,281 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {133150#(<= ~counter~0 13)} {133150#(<= ~counter~0 13)} #96#return; {133150#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:46,281 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-15 15:19:46,282 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-15 15:19:46,283 INFO L290 TraceCheckUtils]: 122: Hoare triple {133175#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,283 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-15 15:19:46,283 INFO L290 TraceCheckUtils]: 124: Hoare triple {133175#(<= ~counter~0 14)} ~cond := #in~cond; {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,284 INFO L290 TraceCheckUtils]: 125: Hoare triple {133175#(<= ~counter~0 14)} assume !(0 == ~cond); {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,284 INFO L290 TraceCheckUtils]: 126: Hoare triple {133175#(<= ~counter~0 14)} assume true; {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,284 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {133175#(<= ~counter~0 14)} {133175#(<= ~counter~0 14)} #96#return; {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,285 INFO L290 TraceCheckUtils]: 128: Hoare triple {133175#(<= ~counter~0 14)} assume !(~r~0 > 0); {133175#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:46,286 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-15 15:19:46,286 INFO L290 TraceCheckUtils]: 130: Hoare triple {133200#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {133200#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:46,287 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-15 15:19:46,287 INFO L290 TraceCheckUtils]: 132: Hoare triple {133200#(<= ~counter~0 15)} ~cond := #in~cond; {133200#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:46,287 INFO L290 TraceCheckUtils]: 133: Hoare triple {133200#(<= ~counter~0 15)} assume !(0 == ~cond); {133200#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:46,287 INFO L290 TraceCheckUtils]: 134: Hoare triple {133200#(<= ~counter~0 15)} assume true; {133200#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:46,288 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {133200#(<= ~counter~0 15)} {133200#(<= ~counter~0 15)} #98#return; {133200#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:46,288 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-15 15:19:46,289 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-15 15:19:46,289 INFO L290 TraceCheckUtils]: 138: Hoare triple {133225#(<= |main_#t~post8| 15)} assume !(#t~post8 < 50);havoc #t~post8; {132794#false} is VALID [2022-04-15 15:19:46,289 INFO L290 TraceCheckUtils]: 139: Hoare triple {132794#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132794#false} is VALID [2022-04-15 15:19:46,289 INFO L290 TraceCheckUtils]: 140: Hoare triple {132794#false} assume !(#t~post6 < 50);havoc #t~post6; {132794#false} is VALID [2022-04-15 15:19:46,289 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-15 15:19:46,289 INFO L290 TraceCheckUtils]: 142: Hoare triple {132794#false} ~cond := #in~cond; {132794#false} is VALID [2022-04-15 15:19:46,289 INFO L290 TraceCheckUtils]: 143: Hoare triple {132794#false} assume 0 == ~cond; {132794#false} is VALID [2022-04-15 15:19:46,289 INFO L290 TraceCheckUtils]: 144: Hoare triple {132794#false} assume !false; {132794#false} is VALID [2022-04-15 15:19:46,290 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-15 15:19:46,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:47,184 INFO L290 TraceCheckUtils]: 144: Hoare triple {132794#false} assume !false; {132794#false} is VALID [2022-04-15 15:19:47,184 INFO L290 TraceCheckUtils]: 143: Hoare triple {132794#false} assume 0 == ~cond; {132794#false} is VALID [2022-04-15 15:19:47,185 INFO L290 TraceCheckUtils]: 142: Hoare triple {132794#false} ~cond := #in~cond; {132794#false} is VALID [2022-04-15 15:19:47,185 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-15 15:19:47,185 INFO L290 TraceCheckUtils]: 140: Hoare triple {132794#false} assume !(#t~post6 < 50);havoc #t~post6; {132794#false} is VALID [2022-04-15 15:19:47,185 INFO L290 TraceCheckUtils]: 139: Hoare triple {132794#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {132794#false} is VALID [2022-04-15 15:19:47,185 INFO L290 TraceCheckUtils]: 138: Hoare triple {133265#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {132794#false} is VALID [2022-04-15 15:19:47,185 INFO L290 TraceCheckUtils]: 137: Hoare triple {133269#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133265#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:19:47,186 INFO L290 TraceCheckUtils]: 136: Hoare triple {133269#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133269#(< ~counter~0 50)} is VALID [2022-04-15 15:19:47,186 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {132793#true} {133269#(< ~counter~0 50)} #98#return; {133269#(< ~counter~0 50)} is VALID [2022-04-15 15:19:47,186 INFO L290 TraceCheckUtils]: 134: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,186 INFO L290 TraceCheckUtils]: 133: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,186 INFO L290 TraceCheckUtils]: 132: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,186 INFO L272 TraceCheckUtils]: 131: Hoare triple {133269#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:19:47,187 INFO L290 TraceCheckUtils]: 130: Hoare triple {133269#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {133269#(< ~counter~0 50)} is VALID [2022-04-15 15:19:47,189 INFO L290 TraceCheckUtils]: 129: Hoare triple {133294#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133269#(< ~counter~0 50)} is VALID [2022-04-15 15:19:47,189 INFO L290 TraceCheckUtils]: 128: Hoare triple {133294#(< ~counter~0 49)} assume !(~r~0 > 0); {133294#(< ~counter~0 49)} is VALID [2022-04-15 15:19:47,190 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {132793#true} {133294#(< ~counter~0 49)} #96#return; {133294#(< ~counter~0 49)} is VALID [2022-04-15 15:19:47,190 INFO L290 TraceCheckUtils]: 126: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,190 INFO L290 TraceCheckUtils]: 125: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,190 INFO L290 TraceCheckUtils]: 124: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,190 INFO L272 TraceCheckUtils]: 123: Hoare triple {133294#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:19:47,190 INFO L290 TraceCheckUtils]: 122: Hoare triple {133294#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {133294#(< ~counter~0 49)} is VALID [2022-04-15 15:19:47,192 INFO L290 TraceCheckUtils]: 121: Hoare triple {133319#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133294#(< ~counter~0 49)} is VALID [2022-04-15 15:19:47,192 INFO L290 TraceCheckUtils]: 120: Hoare triple {133319#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133319#(< ~counter~0 48)} is VALID [2022-04-15 15:19:47,192 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {132793#true} {133319#(< ~counter~0 48)} #96#return; {133319#(< ~counter~0 48)} is VALID [2022-04-15 15:19:47,192 INFO L290 TraceCheckUtils]: 118: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,192 INFO L290 TraceCheckUtils]: 117: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,193 INFO L290 TraceCheckUtils]: 116: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,193 INFO L272 TraceCheckUtils]: 115: Hoare triple {133319#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:19:47,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {133319#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {133319#(< ~counter~0 48)} is VALID [2022-04-15 15:19:47,194 INFO L290 TraceCheckUtils]: 113: Hoare triple {133344#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133319#(< ~counter~0 48)} is VALID [2022-04-15 15:19:47,194 INFO L290 TraceCheckUtils]: 112: Hoare triple {133344#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133344#(< ~counter~0 47)} is VALID [2022-04-15 15:19:47,195 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {132793#true} {133344#(< ~counter~0 47)} #96#return; {133344#(< ~counter~0 47)} is VALID [2022-04-15 15:19:47,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,195 INFO L290 TraceCheckUtils]: 109: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,195 INFO L290 TraceCheckUtils]: 108: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,195 INFO L272 TraceCheckUtils]: 107: Hoare triple {133344#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:19:47,195 INFO L290 TraceCheckUtils]: 106: Hoare triple {133344#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {133344#(< ~counter~0 47)} is VALID [2022-04-15 15:19:47,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {133369#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133344#(< ~counter~0 47)} is VALID [2022-04-15 15:19:47,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {133369#(< ~counter~0 46)} assume !!(0 != ~r~0); {133369#(< ~counter~0 46)} is VALID [2022-04-15 15:19:47,197 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {132793#true} {133369#(< ~counter~0 46)} #94#return; {133369#(< ~counter~0 46)} is VALID [2022-04-15 15:19:47,197 INFO L290 TraceCheckUtils]: 102: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,197 INFO L290 TraceCheckUtils]: 101: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,197 INFO L290 TraceCheckUtils]: 100: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,197 INFO L272 TraceCheckUtils]: 99: Hoare triple {133369#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:19:47,198 INFO L290 TraceCheckUtils]: 98: Hoare triple {133369#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {133369#(< ~counter~0 46)} is VALID [2022-04-15 15:19:47,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {133394#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133369#(< ~counter~0 46)} is VALID [2022-04-15 15:19:47,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {133394#(< ~counter~0 45)} assume !(~r~0 < 0); {133394#(< ~counter~0 45)} is VALID [2022-04-15 15:19:47,199 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {132793#true} {133394#(< ~counter~0 45)} #98#return; {133394#(< ~counter~0 45)} is VALID [2022-04-15 15:19:47,200 INFO L290 TraceCheckUtils]: 94: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,200 INFO L290 TraceCheckUtils]: 93: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,200 INFO L290 TraceCheckUtils]: 92: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,200 INFO L272 TraceCheckUtils]: 91: Hoare triple {133394#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:19:47,200 INFO L290 TraceCheckUtils]: 90: Hoare triple {133394#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {133394#(< ~counter~0 45)} is VALID [2022-04-15 15:19:47,201 INFO L290 TraceCheckUtils]: 89: Hoare triple {133419#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133394#(< ~counter~0 45)} is VALID [2022-04-15 15:19:47,201 INFO L290 TraceCheckUtils]: 88: Hoare triple {133419#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133419#(< ~counter~0 44)} is VALID [2022-04-15 15:19:47,202 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {132793#true} {133419#(< ~counter~0 44)} #98#return; {133419#(< ~counter~0 44)} is VALID [2022-04-15 15:19:47,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,202 INFO L290 TraceCheckUtils]: 84: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,202 INFO L272 TraceCheckUtils]: 83: Hoare triple {133419#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:19:47,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {133419#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {133419#(< ~counter~0 44)} is VALID [2022-04-15 15:19:47,203 INFO L290 TraceCheckUtils]: 81: Hoare triple {133444#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133419#(< ~counter~0 44)} is VALID [2022-04-15 15:19:47,204 INFO L290 TraceCheckUtils]: 80: Hoare triple {133444#(< ~counter~0 43)} assume !(~r~0 > 0); {133444#(< ~counter~0 43)} is VALID [2022-04-15 15:19:47,204 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {132793#true} {133444#(< ~counter~0 43)} #96#return; {133444#(< ~counter~0 43)} is VALID [2022-04-15 15:19:47,204 INFO L290 TraceCheckUtils]: 78: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,204 INFO L290 TraceCheckUtils]: 77: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,204 INFO L290 TraceCheckUtils]: 76: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,204 INFO L272 TraceCheckUtils]: 75: Hoare triple {133444#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:19:47,205 INFO L290 TraceCheckUtils]: 74: Hoare triple {133444#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {133444#(< ~counter~0 43)} is VALID [2022-04-15 15:19:47,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {133469#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133444#(< ~counter~0 43)} is VALID [2022-04-15 15:19:47,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {133469#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133469#(< ~counter~0 42)} is VALID [2022-04-15 15:19:47,207 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132793#true} {133469#(< ~counter~0 42)} #96#return; {133469#(< ~counter~0 42)} is VALID [2022-04-15 15:19:47,207 INFO L290 TraceCheckUtils]: 70: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,207 INFO L290 TraceCheckUtils]: 69: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,207 INFO L290 TraceCheckUtils]: 68: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,207 INFO L272 TraceCheckUtils]: 67: Hoare triple {133469#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:19:47,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {133469#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {133469#(< ~counter~0 42)} is VALID [2022-04-15 15:19:47,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {133494#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133469#(< ~counter~0 42)} is VALID [2022-04-15 15:19:47,208 INFO L290 TraceCheckUtils]: 64: Hoare triple {133494#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133494#(< ~counter~0 41)} is VALID [2022-04-15 15:19:47,209 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {132793#true} {133494#(< ~counter~0 41)} #96#return; {133494#(< ~counter~0 41)} is VALID [2022-04-15 15:19:47,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,209 INFO L272 TraceCheckUtils]: 59: Hoare triple {133494#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:19:47,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {133494#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {133494#(< ~counter~0 41)} is VALID [2022-04-15 15:19:47,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {133519#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133494#(< ~counter~0 41)} is VALID [2022-04-15 15:19:47,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {133519#(< ~counter~0 40)} assume !!(0 != ~r~0); {133519#(< ~counter~0 40)} is VALID [2022-04-15 15:19:47,211 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {132793#true} {133519#(< ~counter~0 40)} #94#return; {133519#(< ~counter~0 40)} is VALID [2022-04-15 15:19:47,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,212 INFO L272 TraceCheckUtils]: 51: Hoare triple {133519#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:19:47,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {133519#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {133519#(< ~counter~0 40)} is VALID [2022-04-15 15:19:47,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {133544#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133519#(< ~counter~0 40)} is VALID [2022-04-15 15:19:47,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {133544#(< ~counter~0 39)} assume !(~r~0 < 0); {133544#(< ~counter~0 39)} is VALID [2022-04-15 15:19:47,214 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {132793#true} {133544#(< ~counter~0 39)} #98#return; {133544#(< ~counter~0 39)} is VALID [2022-04-15 15:19:47,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,214 INFO L272 TraceCheckUtils]: 43: Hoare triple {133544#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:19:47,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {133544#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {133544#(< ~counter~0 39)} is VALID [2022-04-15 15:19:47,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {133569#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133544#(< ~counter~0 39)} is VALID [2022-04-15 15:19:47,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {133569#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133569#(< ~counter~0 38)} is VALID [2022-04-15 15:19:47,216 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132793#true} {133569#(< ~counter~0 38)} #98#return; {133569#(< ~counter~0 38)} is VALID [2022-04-15 15:19:47,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,216 INFO L272 TraceCheckUtils]: 35: Hoare triple {133569#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:19:47,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {133569#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {133569#(< ~counter~0 38)} is VALID [2022-04-15 15:19:47,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {133594#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133569#(< ~counter~0 38)} is VALID [2022-04-15 15:19:47,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {133594#(< ~counter~0 37)} assume !(~r~0 > 0); {133594#(< ~counter~0 37)} is VALID [2022-04-15 15:19:47,218 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {132793#true} {133594#(< ~counter~0 37)} #96#return; {133594#(< ~counter~0 37)} is VALID [2022-04-15 15:19:47,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {133594#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:19:47,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {133594#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {133594#(< ~counter~0 37)} is VALID [2022-04-15 15:19:47,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {133619#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133594#(< ~counter~0 37)} is VALID [2022-04-15 15:19:47,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {133619#(< ~counter~0 36)} assume !!(0 != ~r~0); {133619#(< ~counter~0 36)} is VALID [2022-04-15 15:19:47,221 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {132793#true} {133619#(< ~counter~0 36)} #94#return; {133619#(< ~counter~0 36)} is VALID [2022-04-15 15:19:47,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,221 INFO L272 TraceCheckUtils]: 19: Hoare triple {133619#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:19:47,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {133619#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {133619#(< ~counter~0 36)} is VALID [2022-04-15 15:19:47,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {133644#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133619#(< ~counter~0 36)} is VALID [2022-04-15 15:19:47,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {133644#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {132793#true} {133644#(< ~counter~0 35)} #92#return; {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,223 INFO L272 TraceCheckUtils]: 11: Hoare triple {133644#(< ~counter~0 35)} call assume_abort_if_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-15 15:19:47,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {132793#true} {133644#(< ~counter~0 35)} #90#return; {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {132793#true} assume true; {132793#true} is VALID [2022-04-15 15:19:47,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {132793#true} assume !(0 == ~cond); {132793#true} is VALID [2022-04-15 15:19:47,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {132793#true} ~cond := #in~cond; {132793#true} is VALID [2022-04-15 15:19:47,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {133644#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {132793#true} is VALID [2022-04-15 15:19:47,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {133644#(< ~counter~0 35)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 35)} is VALID [2022-04-15 15:19:47,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {133644#(< ~counter~0 35)} call #t~ret9 := main(); {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133644#(< ~counter~0 35)} {132793#true} #102#return; {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {133644#(< ~counter~0 35)} assume true; {133644#(< ~counter~0 35)} is VALID [2022-04-15 15:19:47,226 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 35)} is VALID [2022-04-15 15:19:47,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {132793#true} call ULTIMATE.init(); {132793#true} is VALID [2022-04-15 15:19:47,226 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-15 15:19:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069034119] [2022-04-15 15:19:47,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015501789] [2022-04-15 15:19:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015501789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:47,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:47,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:19:47,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1231176488] [2022-04-15 15:19:47,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1231176488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:47,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:47,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:19:47,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396552269] [2022-04-15 15:19:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:47,227 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-15 15:19:47,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:47,228 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-15 15:19:47,368 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-15 15:19:47,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:19:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:47,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:19:47,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:19:47,369 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-15 15:19:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:51,974 INFO L93 Difference]: Finished difference Result 981 states and 1345 transitions. [2022-04-15 15:19:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 15:19:51,974 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-15 15:19:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:51,974 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-15 15:19:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-15 15:19:51,976 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-15 15:19:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-15 15:19:51,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-15 15:19:52,339 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-15 15:19:52,371 INFO L225 Difference]: With dead ends: 981 [2022-04-15 15:19:52,371 INFO L226 Difference]: Without dead ends: 789 [2022-04-15 15:19:52,372 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-15 15:19:52,372 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-15 15:19:52,373 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-15 15:19:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-04-15 15:19:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 778. [2022-04-15 15:19:55,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:55,233 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-15 15:19:55,233 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-15 15:19:55,234 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-15 15:19:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:55,254 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-15 15:19:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-15 15:19:55,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:55,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:55,255 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-15 15:19:55,255 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-15 15:19:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:55,275 INFO L93 Difference]: Finished difference Result 789 states and 1052 transitions. [2022-04-15 15:19:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1052 transitions. [2022-04-15 15:19:55,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:55,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:55,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:55,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:55,277 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-15 15:19:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1041 transitions. [2022-04-15 15:19:55,305 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1041 transitions. Word has length 145 [2022-04-15 15:19:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:55,305 INFO L478 AbstractCegarLoop]: Abstraction has 778 states and 1041 transitions. [2022-04-15 15:19:55,305 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-15 15:19:55,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 778 states and 1041 transitions. [2022-04-15 15:20:07,499 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-15 15:20:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1041 transitions. [2022-04-15 15:20:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 15:20:07,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:07,500 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-15 15:20:07,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:07,701 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-15 15:20:07,701 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:07,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-15 15:20:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:07,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813774365] [2022-04-15 15:20:07,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-15 15:20:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:07,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672747486] [2022-04-15 15:20:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:07,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193860098] [2022-04-15 15:20:07,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:20:07,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:07,716 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-15 15:20:07,716 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-15 15:20:07,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:20:07,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:07,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:20:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:07,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:08,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {138820#true} call ULTIMATE.init(); {138820#true} is VALID [2022-04-15 15:20:08,650 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-15 15:20:08,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138828#(<= ~counter~0 0)} {138820#true} #102#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {138828#(<= ~counter~0 0)} call #t~ret9 := main(); {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,651 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-15 15:20:08,652 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-15 15:20:08,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {138828#(<= ~counter~0 0)} ~cond := #in~cond; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {138828#(<= ~counter~0 0)} assume !(0 == ~cond); {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,653 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138828#(<= ~counter~0 0)} {138828#(<= ~counter~0 0)} #90#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,653 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-15 15:20:08,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {138828#(<= ~counter~0 0)} ~cond := #in~cond; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {138828#(<= ~counter~0 0)} assume !(0 == ~cond); {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {138828#(<= ~counter~0 0)} assume true; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138828#(<= ~counter~0 0)} {138828#(<= ~counter~0 0)} #92#return; {138828#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:08,655 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-15 15:20:08,658 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-15 15:20:08,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {138877#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,659 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-15 15:20:08,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {138877#(<= ~counter~0 1)} ~cond := #in~cond; {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {138877#(<= ~counter~0 1)} assume !(0 == ~cond); {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {138877#(<= ~counter~0 1)} assume true; {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,660 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138877#(<= ~counter~0 1)} {138877#(<= ~counter~0 1)} #94#return; {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {138877#(<= ~counter~0 1)} assume !!(0 != ~r~0); {138877#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:08,662 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-15 15:20:08,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {138902#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,662 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-15 15:20:08,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {138902#(<= ~counter~0 2)} ~cond := #in~cond; {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {138902#(<= ~counter~0 2)} assume !(0 == ~cond); {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {138902#(<= ~counter~0 2)} assume true; {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,664 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138902#(<= ~counter~0 2)} {138902#(<= ~counter~0 2)} #96#return; {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {138902#(<= ~counter~0 2)} assume !(~r~0 > 0); {138902#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:08,665 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-15 15:20:08,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {138927#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {138927#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:08,666 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-15 15:20:08,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {138927#(<= ~counter~0 3)} ~cond := #in~cond; {138927#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:08,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {138927#(<= ~counter~0 3)} assume !(0 == ~cond); {138927#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:08,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {138927#(<= ~counter~0 3)} assume true; {138927#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:08,667 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138927#(<= ~counter~0 3)} {138927#(<= ~counter~0 3)} #98#return; {138927#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:08,668 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-15 15:20:08,669 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-15 15:20:08,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {138952#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,670 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-15 15:20:08,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {138952#(<= ~counter~0 4)} ~cond := #in~cond; {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {138952#(<= ~counter~0 4)} assume !(0 == ~cond); {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {138952#(<= ~counter~0 4)} assume true; {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,671 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138952#(<= ~counter~0 4)} {138952#(<= ~counter~0 4)} #98#return; {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {138952#(<= ~counter~0 4)} assume !(~r~0 < 0); {138952#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:08,673 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-15 15:20:08,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {138977#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,673 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-15 15:20:08,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {138977#(<= ~counter~0 5)} ~cond := #in~cond; {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {138977#(<= ~counter~0 5)} assume !(0 == ~cond); {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {138977#(<= ~counter~0 5)} assume true; {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,675 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138977#(<= ~counter~0 5)} {138977#(<= ~counter~0 5)} #94#return; {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {138977#(<= ~counter~0 5)} assume !!(0 != ~r~0); {138977#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:08,676 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-15 15:20:08,676 INFO L290 TraceCheckUtils]: 58: Hoare triple {139002#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {139002#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:08,677 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-15 15:20:08,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {139002#(<= ~counter~0 6)} ~cond := #in~cond; {139002#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:08,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {139002#(<= ~counter~0 6)} assume !(0 == ~cond); {139002#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:08,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {139002#(<= ~counter~0 6)} assume true; {139002#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:08,678 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {139002#(<= ~counter~0 6)} {139002#(<= ~counter~0 6)} #96#return; {139002#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:08,678 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-15 15:20:08,680 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-15 15:20:08,680 INFO L290 TraceCheckUtils]: 66: Hoare triple {139027#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {139027#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,681 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-15 15:20:08,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {139027#(<= ~counter~0 7)} ~cond := #in~cond; {139027#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {139027#(<= ~counter~0 7)} assume !(0 == ~cond); {139027#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {139027#(<= ~counter~0 7)} assume true; {139027#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,682 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {139027#(<= ~counter~0 7)} {139027#(<= ~counter~0 7)} #96#return; {139027#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:08,682 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-15 15:20:08,684 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-15 15:20:08,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {139052#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,685 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-15 15:20:08,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {139052#(<= ~counter~0 8)} ~cond := #in~cond; {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {139052#(<= ~counter~0 8)} assume !(0 == ~cond); {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {139052#(<= ~counter~0 8)} assume true; {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,686 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {139052#(<= ~counter~0 8)} {139052#(<= ~counter~0 8)} #96#return; {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {139052#(<= ~counter~0 8)} assume !(~r~0 > 0); {139052#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:08,687 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-15 15:20:08,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {139077#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {139077#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,688 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-15 15:20:08,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {139077#(<= ~counter~0 9)} ~cond := #in~cond; {139077#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,689 INFO L290 TraceCheckUtils]: 85: Hoare triple {139077#(<= ~counter~0 9)} assume !(0 == ~cond); {139077#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,689 INFO L290 TraceCheckUtils]: 86: Hoare triple {139077#(<= ~counter~0 9)} assume true; {139077#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,689 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {139077#(<= ~counter~0 9)} {139077#(<= ~counter~0 9)} #98#return; {139077#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:08,690 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-15 15:20:08,691 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-15 15:20:08,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {139102#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,692 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-15 15:20:08,692 INFO L290 TraceCheckUtils]: 92: Hoare triple {139102#(<= ~counter~0 10)} ~cond := #in~cond; {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {139102#(<= ~counter~0 10)} assume !(0 == ~cond); {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,692 INFO L290 TraceCheckUtils]: 94: Hoare triple {139102#(<= ~counter~0 10)} assume true; {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,693 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {139102#(<= ~counter~0 10)} {139102#(<= ~counter~0 10)} #98#return; {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,693 INFO L290 TraceCheckUtils]: 96: Hoare triple {139102#(<= ~counter~0 10)} assume !(~r~0 < 0); {139102#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:08,694 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-15 15:20:08,695 INFO L290 TraceCheckUtils]: 98: Hoare triple {139127#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,695 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-15 15:20:08,695 INFO L290 TraceCheckUtils]: 100: Hoare triple {139127#(<= ~counter~0 11)} ~cond := #in~cond; {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,696 INFO L290 TraceCheckUtils]: 101: Hoare triple {139127#(<= ~counter~0 11)} assume !(0 == ~cond); {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,696 INFO L290 TraceCheckUtils]: 102: Hoare triple {139127#(<= ~counter~0 11)} assume true; {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,696 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {139127#(<= ~counter~0 11)} {139127#(<= ~counter~0 11)} #94#return; {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,697 INFO L290 TraceCheckUtils]: 104: Hoare triple {139127#(<= ~counter~0 11)} assume !!(0 != ~r~0); {139127#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:08,698 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-15 15:20:08,698 INFO L290 TraceCheckUtils]: 106: Hoare triple {139152#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {139152#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,698 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-15 15:20:08,699 INFO L290 TraceCheckUtils]: 108: Hoare triple {139152#(<= ~counter~0 12)} ~cond := #in~cond; {139152#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,699 INFO L290 TraceCheckUtils]: 109: Hoare triple {139152#(<= ~counter~0 12)} assume !(0 == ~cond); {139152#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,699 INFO L290 TraceCheckUtils]: 110: Hoare triple {139152#(<= ~counter~0 12)} assume true; {139152#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,700 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {139152#(<= ~counter~0 12)} {139152#(<= ~counter~0 12)} #96#return; {139152#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:08,700 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-15 15:20:08,701 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-15 15:20:08,702 INFO L290 TraceCheckUtils]: 114: Hoare triple {139177#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {139177#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:08,702 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-15 15:20:08,702 INFO L290 TraceCheckUtils]: 116: Hoare triple {139177#(<= ~counter~0 13)} ~cond := #in~cond; {139177#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:08,703 INFO L290 TraceCheckUtils]: 117: Hoare triple {139177#(<= ~counter~0 13)} assume !(0 == ~cond); {139177#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:08,703 INFO L290 TraceCheckUtils]: 118: Hoare triple {139177#(<= ~counter~0 13)} assume true; {139177#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:08,703 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {139177#(<= ~counter~0 13)} {139177#(<= ~counter~0 13)} #96#return; {139177#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:08,704 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-15 15:20:08,705 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-15 15:20:08,705 INFO L290 TraceCheckUtils]: 122: Hoare triple {139202#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {139202#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:08,706 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-15 15:20:08,706 INFO L290 TraceCheckUtils]: 124: Hoare triple {139202#(<= ~counter~0 14)} ~cond := #in~cond; {139202#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:08,707 INFO L290 TraceCheckUtils]: 125: Hoare triple {139202#(<= ~counter~0 14)} assume !(0 == ~cond); {139202#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:08,707 INFO L290 TraceCheckUtils]: 126: Hoare triple {139202#(<= ~counter~0 14)} assume true; {139202#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:08,707 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {139202#(<= ~counter~0 14)} {139202#(<= ~counter~0 14)} #96#return; {139202#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:08,708 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-15 15:20:08,709 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-15 15:20:08,709 INFO L290 TraceCheckUtils]: 130: Hoare triple {139227#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {139227#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:08,710 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-15 15:20:08,710 INFO L290 TraceCheckUtils]: 132: Hoare triple {139227#(<= ~counter~0 15)} ~cond := #in~cond; {139227#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:08,711 INFO L290 TraceCheckUtils]: 133: Hoare triple {139227#(<= ~counter~0 15)} assume !(0 == ~cond); {139227#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:08,711 INFO L290 TraceCheckUtils]: 134: Hoare triple {139227#(<= ~counter~0 15)} assume true; {139227#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:08,711 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {139227#(<= ~counter~0 15)} {139227#(<= ~counter~0 15)} #96#return; {139227#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:08,712 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-15 15:20:08,712 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-15 15:20:08,712 INFO L290 TraceCheckUtils]: 138: Hoare triple {139252#(<= |main_#t~post7| 15)} assume !(#t~post7 < 50);havoc #t~post7; {138821#false} is VALID [2022-04-15 15:20:08,712 INFO L290 TraceCheckUtils]: 139: Hoare triple {138821#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138821#false} is VALID [2022-04-15 15:20:08,712 INFO L290 TraceCheckUtils]: 140: Hoare triple {138821#false} assume !(#t~post8 < 50);havoc #t~post8; {138821#false} is VALID [2022-04-15 15:20:08,712 INFO L290 TraceCheckUtils]: 141: Hoare triple {138821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138821#false} is VALID [2022-04-15 15:20:08,713 INFO L290 TraceCheckUtils]: 142: Hoare triple {138821#false} assume !(#t~post6 < 50);havoc #t~post6; {138821#false} is VALID [2022-04-15 15:20:08,713 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-15 15:20:08,713 INFO L290 TraceCheckUtils]: 144: Hoare triple {138821#false} ~cond := #in~cond; {138821#false} is VALID [2022-04-15 15:20:08,713 INFO L290 TraceCheckUtils]: 145: Hoare triple {138821#false} assume 0 == ~cond; {138821#false} is VALID [2022-04-15 15:20:08,713 INFO L290 TraceCheckUtils]: 146: Hoare triple {138821#false} assume !false; {138821#false} is VALID [2022-04-15 15:20:08,713 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-15 15:20:08,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:09,683 INFO L290 TraceCheckUtils]: 146: Hoare triple {138821#false} assume !false; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 145: Hoare triple {138821#false} assume 0 == ~cond; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 144: Hoare triple {138821#false} ~cond := #in~cond; {138821#false} is VALID [2022-04-15 15:20:09,684 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-15 15:20:09,684 INFO L290 TraceCheckUtils]: 142: Hoare triple {138821#false} assume !(#t~post6 < 50);havoc #t~post6; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 141: Hoare triple {138821#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 140: Hoare triple {138821#false} assume !(#t~post8 < 50);havoc #t~post8; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 139: Hoare triple {138821#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {138821#false} is VALID [2022-04-15 15:20:09,684 INFO L290 TraceCheckUtils]: 138: Hoare triple {139304#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {138821#false} is VALID [2022-04-15 15:20:09,685 INFO L290 TraceCheckUtils]: 137: Hoare triple {139308#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139304#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:20:09,685 INFO L290 TraceCheckUtils]: 136: Hoare triple {139308#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139308#(< ~counter~0 50)} is VALID [2022-04-15 15:20:09,686 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {138820#true} {139308#(< ~counter~0 50)} #96#return; {139308#(< ~counter~0 50)} is VALID [2022-04-15 15:20:09,686 INFO L290 TraceCheckUtils]: 134: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,686 INFO L290 TraceCheckUtils]: 133: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,686 INFO L290 TraceCheckUtils]: 132: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,686 INFO L272 TraceCheckUtils]: 131: Hoare triple {139308#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:20:09,686 INFO L290 TraceCheckUtils]: 130: Hoare triple {139308#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {139308#(< ~counter~0 50)} is VALID [2022-04-15 15:20:09,689 INFO L290 TraceCheckUtils]: 129: Hoare triple {139333#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139308#(< ~counter~0 50)} is VALID [2022-04-15 15:20:09,689 INFO L290 TraceCheckUtils]: 128: Hoare triple {139333#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139333#(< ~counter~0 49)} is VALID [2022-04-15 15:20:09,690 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {138820#true} {139333#(< ~counter~0 49)} #96#return; {139333#(< ~counter~0 49)} is VALID [2022-04-15 15:20:09,690 INFO L290 TraceCheckUtils]: 126: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,690 INFO L290 TraceCheckUtils]: 125: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,690 INFO L290 TraceCheckUtils]: 124: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,690 INFO L272 TraceCheckUtils]: 123: Hoare triple {139333#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:20:09,690 INFO L290 TraceCheckUtils]: 122: Hoare triple {139333#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {139333#(< ~counter~0 49)} is VALID [2022-04-15 15:20:09,691 INFO L290 TraceCheckUtils]: 121: Hoare triple {139358#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139333#(< ~counter~0 49)} is VALID [2022-04-15 15:20:09,692 INFO L290 TraceCheckUtils]: 120: Hoare triple {139358#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139358#(< ~counter~0 48)} is VALID [2022-04-15 15:20:09,692 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {138820#true} {139358#(< ~counter~0 48)} #96#return; {139358#(< ~counter~0 48)} is VALID [2022-04-15 15:20:09,692 INFO L290 TraceCheckUtils]: 118: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,692 INFO L290 TraceCheckUtils]: 117: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,692 INFO L290 TraceCheckUtils]: 116: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,693 INFO L272 TraceCheckUtils]: 115: Hoare triple {139358#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:20:09,693 INFO L290 TraceCheckUtils]: 114: Hoare triple {139358#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {139358#(< ~counter~0 48)} is VALID [2022-04-15 15:20:09,694 INFO L290 TraceCheckUtils]: 113: Hoare triple {139383#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139358#(< ~counter~0 48)} is VALID [2022-04-15 15:20:09,694 INFO L290 TraceCheckUtils]: 112: Hoare triple {139383#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139383#(< ~counter~0 47)} is VALID [2022-04-15 15:20:09,695 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {138820#true} {139383#(< ~counter~0 47)} #96#return; {139383#(< ~counter~0 47)} is VALID [2022-04-15 15:20:09,695 INFO L290 TraceCheckUtils]: 110: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,695 INFO L290 TraceCheckUtils]: 109: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,695 INFO L290 TraceCheckUtils]: 108: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,695 INFO L272 TraceCheckUtils]: 107: Hoare triple {139383#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:20:09,695 INFO L290 TraceCheckUtils]: 106: Hoare triple {139383#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {139383#(< ~counter~0 47)} is VALID [2022-04-15 15:20:09,696 INFO L290 TraceCheckUtils]: 105: Hoare triple {139408#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139383#(< ~counter~0 47)} is VALID [2022-04-15 15:20:09,697 INFO L290 TraceCheckUtils]: 104: Hoare triple {139408#(< ~counter~0 46)} assume !!(0 != ~r~0); {139408#(< ~counter~0 46)} is VALID [2022-04-15 15:20:09,697 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {138820#true} {139408#(< ~counter~0 46)} #94#return; {139408#(< ~counter~0 46)} is VALID [2022-04-15 15:20:09,697 INFO L290 TraceCheckUtils]: 102: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,697 INFO L290 TraceCheckUtils]: 101: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,697 INFO L290 TraceCheckUtils]: 100: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,697 INFO L272 TraceCheckUtils]: 99: Hoare triple {139408#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:20:09,698 INFO L290 TraceCheckUtils]: 98: Hoare triple {139408#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {139408#(< ~counter~0 46)} is VALID [2022-04-15 15:20:09,699 INFO L290 TraceCheckUtils]: 97: Hoare triple {139433#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139408#(< ~counter~0 46)} is VALID [2022-04-15 15:20:09,699 INFO L290 TraceCheckUtils]: 96: Hoare triple {139433#(< ~counter~0 45)} assume !(~r~0 < 0); {139433#(< ~counter~0 45)} is VALID [2022-04-15 15:20:09,700 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {138820#true} {139433#(< ~counter~0 45)} #98#return; {139433#(< ~counter~0 45)} is VALID [2022-04-15 15:20:09,700 INFO L290 TraceCheckUtils]: 94: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,700 INFO L290 TraceCheckUtils]: 93: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,700 INFO L290 TraceCheckUtils]: 92: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,700 INFO L272 TraceCheckUtils]: 91: Hoare triple {139433#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:20:09,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {139433#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {139433#(< ~counter~0 45)} is VALID [2022-04-15 15:20:09,701 INFO L290 TraceCheckUtils]: 89: Hoare triple {139458#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139433#(< ~counter~0 45)} is VALID [2022-04-15 15:20:09,701 INFO L290 TraceCheckUtils]: 88: Hoare triple {139458#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139458#(< ~counter~0 44)} is VALID [2022-04-15 15:20:09,702 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {138820#true} {139458#(< ~counter~0 44)} #98#return; {139458#(< ~counter~0 44)} is VALID [2022-04-15 15:20:09,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,702 INFO L272 TraceCheckUtils]: 83: Hoare triple {139458#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:20:09,703 INFO L290 TraceCheckUtils]: 82: Hoare triple {139458#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {139458#(< ~counter~0 44)} is VALID [2022-04-15 15:20:09,704 INFO L290 TraceCheckUtils]: 81: Hoare triple {139483#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139458#(< ~counter~0 44)} is VALID [2022-04-15 15:20:09,704 INFO L290 TraceCheckUtils]: 80: Hoare triple {139483#(< ~counter~0 43)} assume !(~r~0 > 0); {139483#(< ~counter~0 43)} is VALID [2022-04-15 15:20:09,704 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {138820#true} {139483#(< ~counter~0 43)} #96#return; {139483#(< ~counter~0 43)} is VALID [2022-04-15 15:20:09,704 INFO L290 TraceCheckUtils]: 78: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,705 INFO L272 TraceCheckUtils]: 75: Hoare triple {139483#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:20:09,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {139483#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {139483#(< ~counter~0 43)} is VALID [2022-04-15 15:20:09,706 INFO L290 TraceCheckUtils]: 73: Hoare triple {139508#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139483#(< ~counter~0 43)} is VALID [2022-04-15 15:20:09,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {139508#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139508#(< ~counter~0 42)} is VALID [2022-04-15 15:20:09,707 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {138820#true} {139508#(< ~counter~0 42)} #96#return; {139508#(< ~counter~0 42)} is VALID [2022-04-15 15:20:09,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,707 INFO L272 TraceCheckUtils]: 67: Hoare triple {139508#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:20:09,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {139508#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {139508#(< ~counter~0 42)} is VALID [2022-04-15 15:20:09,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {139533#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139508#(< ~counter~0 42)} is VALID [2022-04-15 15:20:09,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {139533#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {139533#(< ~counter~0 41)} is VALID [2022-04-15 15:20:09,709 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {138820#true} {139533#(< ~counter~0 41)} #96#return; {139533#(< ~counter~0 41)} is VALID [2022-04-15 15:20:09,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,710 INFO L272 TraceCheckUtils]: 59: Hoare triple {139533#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:20:09,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {139533#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {139533#(< ~counter~0 41)} is VALID [2022-04-15 15:20:09,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {139558#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139533#(< ~counter~0 41)} is VALID [2022-04-15 15:20:09,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {139558#(< ~counter~0 40)} assume !!(0 != ~r~0); {139558#(< ~counter~0 40)} is VALID [2022-04-15 15:20:09,712 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {138820#true} {139558#(< ~counter~0 40)} #94#return; {139558#(< ~counter~0 40)} is VALID [2022-04-15 15:20:09,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,712 INFO L272 TraceCheckUtils]: 51: Hoare triple {139558#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:20:09,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {139558#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {139558#(< ~counter~0 40)} is VALID [2022-04-15 15:20:09,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {139583#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139558#(< ~counter~0 40)} is VALID [2022-04-15 15:20:09,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {139583#(< ~counter~0 39)} assume !(~r~0 < 0); {139583#(< ~counter~0 39)} is VALID [2022-04-15 15:20:09,714 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {138820#true} {139583#(< ~counter~0 39)} #98#return; {139583#(< ~counter~0 39)} is VALID [2022-04-15 15:20:09,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,714 INFO L272 TraceCheckUtils]: 43: Hoare triple {139583#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:20:09,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {139583#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {139583#(< ~counter~0 39)} is VALID [2022-04-15 15:20:09,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {139608#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139583#(< ~counter~0 39)} is VALID [2022-04-15 15:20:09,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {139608#(< ~counter~0 38)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139608#(< ~counter~0 38)} is VALID [2022-04-15 15:20:09,717 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {138820#true} {139608#(< ~counter~0 38)} #98#return; {139608#(< ~counter~0 38)} is VALID [2022-04-15 15:20:09,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,717 INFO L272 TraceCheckUtils]: 35: Hoare triple {139608#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:20:09,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {139608#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {139608#(< ~counter~0 38)} is VALID [2022-04-15 15:20:09,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {139633#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139608#(< ~counter~0 38)} is VALID [2022-04-15 15:20:09,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {139633#(< ~counter~0 37)} assume !(~r~0 > 0); {139633#(< ~counter~0 37)} is VALID [2022-04-15 15:20:09,719 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {138820#true} {139633#(< ~counter~0 37)} #96#return; {139633#(< ~counter~0 37)} is VALID [2022-04-15 15:20:09,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,719 INFO L272 TraceCheckUtils]: 27: Hoare triple {139633#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:20:09,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {139633#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {139633#(< ~counter~0 37)} is VALID [2022-04-15 15:20:09,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {139658#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139633#(< ~counter~0 37)} is VALID [2022-04-15 15:20:09,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {139658#(< ~counter~0 36)} assume !!(0 != ~r~0); {139658#(< ~counter~0 36)} is VALID [2022-04-15 15:20:09,721 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {138820#true} {139658#(< ~counter~0 36)} #94#return; {139658#(< ~counter~0 36)} is VALID [2022-04-15 15:20:09,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,722 INFO L272 TraceCheckUtils]: 19: Hoare triple {139658#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:20:09,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {139658#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {139658#(< ~counter~0 36)} is VALID [2022-04-15 15:20:09,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {139683#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139658#(< ~counter~0 36)} is VALID [2022-04-15 15:20:09,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {139683#(< ~counter~0 35)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,724 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {138820#true} {139683#(< ~counter~0 35)} #92#return; {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {139683#(< ~counter~0 35)} call assume_abort_if_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-15 15:20:09,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {138820#true} {139683#(< ~counter~0 35)} #90#return; {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {138820#true} assume true; {138820#true} is VALID [2022-04-15 15:20:09,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {138820#true} assume !(0 == ~cond); {138820#true} is VALID [2022-04-15 15:20:09,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {138820#true} ~cond := #in~cond; {138820#true} is VALID [2022-04-15 15:20:09,725 INFO L272 TraceCheckUtils]: 6: Hoare triple {139683#(< ~counter~0 35)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {138820#true} is VALID [2022-04-15 15:20:09,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {139683#(< ~counter~0 35)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 35)} is VALID [2022-04-15 15:20:09,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {139683#(< ~counter~0 35)} call #t~ret9 := main(); {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139683#(< ~counter~0 35)} {138820#true} #102#return; {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {139683#(< ~counter~0 35)} assume true; {139683#(< ~counter~0 35)} is VALID [2022-04-15 15:20:09,726 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 35)} is VALID [2022-04-15 15:20:09,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {138820#true} call ULTIMATE.init(); {138820#true} is VALID [2022-04-15 15:20:09,727 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-15 15:20:09,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:09,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672747486] [2022-04-15 15:20:09,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:09,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193860098] [2022-04-15 15:20:09,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193860098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:09,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:09,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:20:09,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:09,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813774365] [2022-04-15 15:20:09,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813774365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:09,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:09,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:20:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74869602] [2022-04-15 15:20:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:09,728 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-15 15:20:09,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:09,728 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-15 15:20:09,893 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-15 15:20:09,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:20:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:09,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:20:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:20:09,894 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-15 15:20:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:14,539 INFO L93 Difference]: Finished difference Result 965 states and 1319 transitions. [2022-04-15 15:20:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 15:20:14,539 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-15 15:20:14,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:14,540 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-15 15:20:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-15 15:20:14,543 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-15 15:20:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-15 15:20:14,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-15 15:20:14,977 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-15 15:20:15,003 INFO L225 Difference]: With dead ends: 965 [2022-04-15 15:20:15,003 INFO L226 Difference]: Without dead ends: 795 [2022-04-15 15:20:15,004 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-15 15:20:15,004 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-15 15:20:15,004 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-15 15:20:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-15 15:20:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-04-15 15:20:17,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:17,984 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-15 15:20:17,985 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-15 15:20:17,985 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-15 15:20:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:18,006 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-15 15:20:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-15 15:20:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:18,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:18,007 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-15 15:20:18,007 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-15 15:20:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:18,028 INFO L93 Difference]: Finished difference Result 795 states and 1058 transitions. [2022-04-15 15:20:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-15 15:20:18,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:18,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:18,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:18,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:18,030 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-15 15:20:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1058 transitions. [2022-04-15 15:20:18,058 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1058 transitions. Word has length 147 [2022-04-15 15:20:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:18,058 INFO L478 AbstractCegarLoop]: Abstraction has 795 states and 1058 transitions. [2022-04-15 15:20:18,058 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-15 15:20:18,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 795 states and 1058 transitions. [2022-04-15 15:20:29,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1058 edges. 1055 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1058 transitions. [2022-04-15 15:20:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 15:20:29,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:29,751 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-15 15:20:29,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:29,951 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-15 15:20:29,952 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-15 15:20:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177741735] [2022-04-15 15:20:29,953 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-15 15:20:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:29,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427431399] [2022-04-15 15:20:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:29,967 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:29,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218753650] [2022-04-15 15:20:29,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:20:29,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:29,968 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-15 15:20:29,969 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-15 15:20:30,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:20:30,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:30,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:20:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:30,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:30,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {144875#true} call ULTIMATE.init(); {144875#true} is VALID [2022-04-15 15:20:30,913 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-15 15:20:30,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144883#(<= ~counter~0 0)} {144875#true} #102#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {144883#(<= ~counter~0 0)} call #t~ret9 := main(); {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,914 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-15 15:20:30,915 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-15 15:20:30,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {144883#(<= ~counter~0 0)} ~cond := #in~cond; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {144883#(<= ~counter~0 0)} assume !(0 == ~cond); {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144883#(<= ~counter~0 0)} {144883#(<= ~counter~0 0)} #90#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,916 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-15 15:20:30,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {144883#(<= ~counter~0 0)} ~cond := #in~cond; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {144883#(<= ~counter~0 0)} assume !(0 == ~cond); {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {144883#(<= ~counter~0 0)} assume true; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144883#(<= ~counter~0 0)} {144883#(<= ~counter~0 0)} #92#return; {144883#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:30,918 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-15 15:20:30,921 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-15 15:20:30,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {144932#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,921 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-15 15:20:30,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {144932#(<= ~counter~0 1)} ~cond := #in~cond; {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {144932#(<= ~counter~0 1)} assume !(0 == ~cond); {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {144932#(<= ~counter~0 1)} assume true; {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,923 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144932#(<= ~counter~0 1)} {144932#(<= ~counter~0 1)} #94#return; {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {144932#(<= ~counter~0 1)} assume !!(0 != ~r~0); {144932#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:30,924 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-15 15:20:30,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {144957#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,925 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-15 15:20:30,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {144957#(<= ~counter~0 2)} ~cond := #in~cond; {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {144957#(<= ~counter~0 2)} assume !(0 == ~cond); {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {144957#(<= ~counter~0 2)} assume true; {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,927 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144957#(<= ~counter~0 2)} {144957#(<= ~counter~0 2)} #96#return; {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {144957#(<= ~counter~0 2)} assume !(~r~0 > 0); {144957#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:30,928 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-15 15:20:30,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {144982#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {144982#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:30,929 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-15 15:20:30,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {144982#(<= ~counter~0 3)} ~cond := #in~cond; {144982#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:30,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {144982#(<= ~counter~0 3)} assume !(0 == ~cond); {144982#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:30,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {144982#(<= ~counter~0 3)} assume true; {144982#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:30,930 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144982#(<= ~counter~0 3)} {144982#(<= ~counter~0 3)} #98#return; {144982#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:30,931 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-15 15:20:30,935 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-15 15:20:30,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {145007#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,935 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-15 15:20:30,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {145007#(<= ~counter~0 4)} ~cond := #in~cond; {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {145007#(<= ~counter~0 4)} assume !(0 == ~cond); {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {145007#(<= ~counter~0 4)} assume true; {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,937 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {145007#(<= ~counter~0 4)} {145007#(<= ~counter~0 4)} #98#return; {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {145007#(<= ~counter~0 4)} assume !(~r~0 < 0); {145007#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:30,938 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-15 15:20:30,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {145032#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,939 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-15 15:20:30,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {145032#(<= ~counter~0 5)} ~cond := #in~cond; {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {145032#(<= ~counter~0 5)} assume !(0 == ~cond); {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {145032#(<= ~counter~0 5)} assume true; {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,940 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {145032#(<= ~counter~0 5)} {145032#(<= ~counter~0 5)} #94#return; {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {145032#(<= ~counter~0 5)} assume !!(0 != ~r~0); {145032#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:30,942 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-15 15:20:30,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {145057#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {145057#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:30,942 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-15 15:20:30,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {145057#(<= ~counter~0 6)} ~cond := #in~cond; {145057#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:30,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {145057#(<= ~counter~0 6)} assume !(0 == ~cond); {145057#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:30,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {145057#(<= ~counter~0 6)} assume true; {145057#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:30,944 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {145057#(<= ~counter~0 6)} {145057#(<= ~counter~0 6)} #96#return; {145057#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:30,944 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-15 15:20:30,945 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-15 15:20:30,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {145082#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {145082#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:30,946 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-15 15:20:30,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {145082#(<= ~counter~0 7)} ~cond := #in~cond; {145082#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:30,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {145082#(<= ~counter~0 7)} assume !(0 == ~cond); {145082#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:30,947 INFO L290 TraceCheckUtils]: 70: Hoare triple {145082#(<= ~counter~0 7)} assume true; {145082#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:30,947 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {145082#(<= ~counter~0 7)} {145082#(<= ~counter~0 7)} #96#return; {145082#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:30,947 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-15 15:20:30,949 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-15 15:20:30,949 INFO L290 TraceCheckUtils]: 74: Hoare triple {145107#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,949 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-15 15:20:30,950 INFO L290 TraceCheckUtils]: 76: Hoare triple {145107#(<= ~counter~0 8)} ~cond := #in~cond; {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {145107#(<= ~counter~0 8)} assume !(0 == ~cond); {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {145107#(<= ~counter~0 8)} assume true; {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,951 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {145107#(<= ~counter~0 8)} {145107#(<= ~counter~0 8)} #96#return; {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,951 INFO L290 TraceCheckUtils]: 80: Hoare triple {145107#(<= ~counter~0 8)} assume !(~r~0 > 0); {145107#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:30,952 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-15 15:20:30,952 INFO L290 TraceCheckUtils]: 82: Hoare triple {145132#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {145132#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:30,953 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-15 15:20:30,953 INFO L290 TraceCheckUtils]: 84: Hoare triple {145132#(<= ~counter~0 9)} ~cond := #in~cond; {145132#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:30,953 INFO L290 TraceCheckUtils]: 85: Hoare triple {145132#(<= ~counter~0 9)} assume !(0 == ~cond); {145132#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:30,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {145132#(<= ~counter~0 9)} assume true; {145132#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:30,954 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {145132#(<= ~counter~0 9)} {145132#(<= ~counter~0 9)} #98#return; {145132#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:30,954 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-15 15:20:30,956 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-15 15:20:30,956 INFO L290 TraceCheckUtils]: 90: Hoare triple {145157#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,956 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-15 15:20:30,957 INFO L290 TraceCheckUtils]: 92: Hoare triple {145157#(<= ~counter~0 10)} ~cond := #in~cond; {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,957 INFO L290 TraceCheckUtils]: 93: Hoare triple {145157#(<= ~counter~0 10)} assume !(0 == ~cond); {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,957 INFO L290 TraceCheckUtils]: 94: Hoare triple {145157#(<= ~counter~0 10)} assume true; {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,958 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {145157#(<= ~counter~0 10)} {145157#(<= ~counter~0 10)} #98#return; {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,958 INFO L290 TraceCheckUtils]: 96: Hoare triple {145157#(<= ~counter~0 10)} assume !(~r~0 < 0); {145157#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:30,959 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-15 15:20:30,960 INFO L290 TraceCheckUtils]: 98: Hoare triple {145182#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,960 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-15 15:20:30,961 INFO L290 TraceCheckUtils]: 100: Hoare triple {145182#(<= ~counter~0 11)} ~cond := #in~cond; {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,961 INFO L290 TraceCheckUtils]: 101: Hoare triple {145182#(<= ~counter~0 11)} assume !(0 == ~cond); {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,961 INFO L290 TraceCheckUtils]: 102: Hoare triple {145182#(<= ~counter~0 11)} assume true; {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,962 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {145182#(<= ~counter~0 11)} {145182#(<= ~counter~0 11)} #94#return; {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,962 INFO L290 TraceCheckUtils]: 104: Hoare triple {145182#(<= ~counter~0 11)} assume !!(0 != ~r~0); {145182#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:30,963 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-15 15:20:30,963 INFO L290 TraceCheckUtils]: 106: Hoare triple {145207#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {145207#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:30,964 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-15 15:20:30,964 INFO L290 TraceCheckUtils]: 108: Hoare triple {145207#(<= ~counter~0 12)} ~cond := #in~cond; {145207#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:30,964 INFO L290 TraceCheckUtils]: 109: Hoare triple {145207#(<= ~counter~0 12)} assume !(0 == ~cond); {145207#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:30,965 INFO L290 TraceCheckUtils]: 110: Hoare triple {145207#(<= ~counter~0 12)} assume true; {145207#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:30,965 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {145207#(<= ~counter~0 12)} {145207#(<= ~counter~0 12)} #96#return; {145207#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:30,966 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-15 15:20:30,967 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-15 15:20:30,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {145232#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {145232#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:30,968 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-15 15:20:30,968 INFO L290 TraceCheckUtils]: 116: Hoare triple {145232#(<= ~counter~0 13)} ~cond := #in~cond; {145232#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:30,968 INFO L290 TraceCheckUtils]: 117: Hoare triple {145232#(<= ~counter~0 13)} assume !(0 == ~cond); {145232#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:30,968 INFO L290 TraceCheckUtils]: 118: Hoare triple {145232#(<= ~counter~0 13)} assume true; {145232#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:30,969 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {145232#(<= ~counter~0 13)} {145232#(<= ~counter~0 13)} #96#return; {145232#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:30,969 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-15 15:20:30,970 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-15 15:20:30,971 INFO L290 TraceCheckUtils]: 122: Hoare triple {145257#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,971 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-15 15:20:30,971 INFO L290 TraceCheckUtils]: 124: Hoare triple {145257#(<= ~counter~0 14)} ~cond := #in~cond; {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,972 INFO L290 TraceCheckUtils]: 125: Hoare triple {145257#(<= ~counter~0 14)} assume !(0 == ~cond); {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,972 INFO L290 TraceCheckUtils]: 126: Hoare triple {145257#(<= ~counter~0 14)} assume true; {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,972 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {145257#(<= ~counter~0 14)} {145257#(<= ~counter~0 14)} #96#return; {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,973 INFO L290 TraceCheckUtils]: 128: Hoare triple {145257#(<= ~counter~0 14)} assume !(~r~0 > 0); {145257#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:30,974 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-15 15:20:30,974 INFO L290 TraceCheckUtils]: 130: Hoare triple {145282#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {145282#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:30,974 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-15 15:20:30,975 INFO L290 TraceCheckUtils]: 132: Hoare triple {145282#(<= ~counter~0 15)} ~cond := #in~cond; {145282#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:30,975 INFO L290 TraceCheckUtils]: 133: Hoare triple {145282#(<= ~counter~0 15)} assume !(0 == ~cond); {145282#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:30,975 INFO L290 TraceCheckUtils]: 134: Hoare triple {145282#(<= ~counter~0 15)} assume true; {145282#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:30,976 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {145282#(<= ~counter~0 15)} {145282#(<= ~counter~0 15)} #98#return; {145282#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:30,976 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-15 15:20:30,977 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-15 15:20:30,977 INFO L290 TraceCheckUtils]: 138: Hoare triple {145307#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,978 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-15 15:20:30,978 INFO L290 TraceCheckUtils]: 140: Hoare triple {145307#(<= ~counter~0 16)} ~cond := #in~cond; {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,978 INFO L290 TraceCheckUtils]: 141: Hoare triple {145307#(<= ~counter~0 16)} assume !(0 == ~cond); {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,979 INFO L290 TraceCheckUtils]: 142: Hoare triple {145307#(<= ~counter~0 16)} assume true; {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,979 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {145307#(<= ~counter~0 16)} {145307#(<= ~counter~0 16)} #98#return; {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,979 INFO L290 TraceCheckUtils]: 144: Hoare triple {145307#(<= ~counter~0 16)} assume !(~r~0 < 0); {145307#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:30,980 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-15 15:20:30,980 INFO L290 TraceCheckUtils]: 146: Hoare triple {145332#(<= |main_#t~post6| 16)} assume !(#t~post6 < 50);havoc #t~post6; {144876#false} is VALID [2022-04-15 15:20:30,980 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-15 15:20:30,980 INFO L290 TraceCheckUtils]: 148: Hoare triple {144876#false} ~cond := #in~cond; {144876#false} is VALID [2022-04-15 15:20:30,980 INFO L290 TraceCheckUtils]: 149: Hoare triple {144876#false} assume 0 == ~cond; {144876#false} is VALID [2022-04-15 15:20:30,980 INFO L290 TraceCheckUtils]: 150: Hoare triple {144876#false} assume !false; {144876#false} is VALID [2022-04-15 15:20:30,981 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-15 15:20:30,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:32,091 INFO L290 TraceCheckUtils]: 150: Hoare triple {144876#false} assume !false; {144876#false} is VALID [2022-04-15 15:20:32,092 INFO L290 TraceCheckUtils]: 149: Hoare triple {144876#false} assume 0 == ~cond; {144876#false} is VALID [2022-04-15 15:20:32,092 INFO L290 TraceCheckUtils]: 148: Hoare triple {144876#false} ~cond := #in~cond; {144876#false} is VALID [2022-04-15 15:20:32,092 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-15 15:20:32,092 INFO L290 TraceCheckUtils]: 146: Hoare triple {145360#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {144876#false} is VALID [2022-04-15 15:20:32,093 INFO L290 TraceCheckUtils]: 145: Hoare triple {145364#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145360#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:20:32,093 INFO L290 TraceCheckUtils]: 144: Hoare triple {145364#(< ~counter~0 50)} assume !(~r~0 < 0); {145364#(< ~counter~0 50)} is VALID [2022-04-15 15:20:32,094 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {144875#true} {145364#(< ~counter~0 50)} #98#return; {145364#(< ~counter~0 50)} is VALID [2022-04-15 15:20:32,094 INFO L290 TraceCheckUtils]: 142: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,094 INFO L290 TraceCheckUtils]: 141: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,094 INFO L290 TraceCheckUtils]: 140: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,094 INFO L272 TraceCheckUtils]: 139: Hoare triple {145364#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:20:32,094 INFO L290 TraceCheckUtils]: 138: Hoare triple {145364#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {145364#(< ~counter~0 50)} is VALID [2022-04-15 15:20:32,098 INFO L290 TraceCheckUtils]: 137: Hoare triple {145389#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145364#(< ~counter~0 50)} is VALID [2022-04-15 15:20:32,098 INFO L290 TraceCheckUtils]: 136: Hoare triple {145389#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145389#(< ~counter~0 49)} is VALID [2022-04-15 15:20:32,099 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {144875#true} {145389#(< ~counter~0 49)} #98#return; {145389#(< ~counter~0 49)} is VALID [2022-04-15 15:20:32,099 INFO L290 TraceCheckUtils]: 134: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,099 INFO L290 TraceCheckUtils]: 133: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,099 INFO L290 TraceCheckUtils]: 132: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,099 INFO L272 TraceCheckUtils]: 131: Hoare triple {145389#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:20:32,100 INFO L290 TraceCheckUtils]: 130: Hoare triple {145389#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {145389#(< ~counter~0 49)} is VALID [2022-04-15 15:20:32,101 INFO L290 TraceCheckUtils]: 129: Hoare triple {145414#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145389#(< ~counter~0 49)} is VALID [2022-04-15 15:20:32,102 INFO L290 TraceCheckUtils]: 128: Hoare triple {145414#(< ~counter~0 48)} assume !(~r~0 > 0); {145414#(< ~counter~0 48)} is VALID [2022-04-15 15:20:32,102 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {144875#true} {145414#(< ~counter~0 48)} #96#return; {145414#(< ~counter~0 48)} is VALID [2022-04-15 15:20:32,103 INFO L290 TraceCheckUtils]: 126: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,103 INFO L290 TraceCheckUtils]: 125: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,103 INFO L290 TraceCheckUtils]: 124: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,103 INFO L272 TraceCheckUtils]: 123: Hoare triple {145414#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:20:32,103 INFO L290 TraceCheckUtils]: 122: Hoare triple {145414#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {145414#(< ~counter~0 48)} is VALID [2022-04-15 15:20:32,105 INFO L290 TraceCheckUtils]: 121: Hoare triple {145439#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145414#(< ~counter~0 48)} is VALID [2022-04-15 15:20:32,105 INFO L290 TraceCheckUtils]: 120: Hoare triple {145439#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145439#(< ~counter~0 47)} is VALID [2022-04-15 15:20:32,106 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {144875#true} {145439#(< ~counter~0 47)} #96#return; {145439#(< ~counter~0 47)} is VALID [2022-04-15 15:20:32,106 INFO L290 TraceCheckUtils]: 118: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,106 INFO L290 TraceCheckUtils]: 117: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,106 INFO L290 TraceCheckUtils]: 116: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,106 INFO L272 TraceCheckUtils]: 115: Hoare triple {145439#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:20:32,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {145439#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {145439#(< ~counter~0 47)} is VALID [2022-04-15 15:20:32,108 INFO L290 TraceCheckUtils]: 113: Hoare triple {145464#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145439#(< ~counter~0 47)} is VALID [2022-04-15 15:20:32,109 INFO L290 TraceCheckUtils]: 112: Hoare triple {145464#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145464#(< ~counter~0 46)} is VALID [2022-04-15 15:20:32,109 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {144875#true} {145464#(< ~counter~0 46)} #96#return; {145464#(< ~counter~0 46)} is VALID [2022-04-15 15:20:32,109 INFO L290 TraceCheckUtils]: 110: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,109 INFO L290 TraceCheckUtils]: 109: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,110 INFO L290 TraceCheckUtils]: 108: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,110 INFO L272 TraceCheckUtils]: 107: Hoare triple {145464#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:20:32,110 INFO L290 TraceCheckUtils]: 106: Hoare triple {145464#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {145464#(< ~counter~0 46)} is VALID [2022-04-15 15:20:32,112 INFO L290 TraceCheckUtils]: 105: Hoare triple {145489#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145464#(< ~counter~0 46)} is VALID [2022-04-15 15:20:32,112 INFO L290 TraceCheckUtils]: 104: Hoare triple {145489#(< ~counter~0 45)} assume !!(0 != ~r~0); {145489#(< ~counter~0 45)} is VALID [2022-04-15 15:20:32,113 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {144875#true} {145489#(< ~counter~0 45)} #94#return; {145489#(< ~counter~0 45)} is VALID [2022-04-15 15:20:32,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,113 INFO L290 TraceCheckUtils]: 101: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,113 INFO L272 TraceCheckUtils]: 99: Hoare triple {145489#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:20:32,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {145489#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {145489#(< ~counter~0 45)} is VALID [2022-04-15 15:20:32,115 INFO L290 TraceCheckUtils]: 97: Hoare triple {145514#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145489#(< ~counter~0 45)} is VALID [2022-04-15 15:20:32,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {145514#(< ~counter~0 44)} assume !(~r~0 < 0); {145514#(< ~counter~0 44)} is VALID [2022-04-15 15:20:32,116 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {144875#true} {145514#(< ~counter~0 44)} #98#return; {145514#(< ~counter~0 44)} is VALID [2022-04-15 15:20:32,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,117 INFO L272 TraceCheckUtils]: 91: Hoare triple {145514#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:20:32,117 INFO L290 TraceCheckUtils]: 90: Hoare triple {145514#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {145514#(< ~counter~0 44)} is VALID [2022-04-15 15:20:32,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {145539#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145514#(< ~counter~0 44)} is VALID [2022-04-15 15:20:32,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {145539#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145539#(< ~counter~0 43)} is VALID [2022-04-15 15:20:32,120 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {144875#true} {145539#(< ~counter~0 43)} #98#return; {145539#(< ~counter~0 43)} is VALID [2022-04-15 15:20:32,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,120 INFO L290 TraceCheckUtils]: 84: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,120 INFO L272 TraceCheckUtils]: 83: Hoare triple {145539#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:20:32,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {145539#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {145539#(< ~counter~0 43)} is VALID [2022-04-15 15:20:32,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {145564#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145539#(< ~counter~0 43)} is VALID [2022-04-15 15:20:32,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {145564#(< ~counter~0 42)} assume !(~r~0 > 0); {145564#(< ~counter~0 42)} is VALID [2022-04-15 15:20:32,123 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {144875#true} {145564#(< ~counter~0 42)} #96#return; {145564#(< ~counter~0 42)} is VALID [2022-04-15 15:20:32,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,123 INFO L272 TraceCheckUtils]: 75: Hoare triple {145564#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:20:32,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {145564#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {145564#(< ~counter~0 42)} is VALID [2022-04-15 15:20:32,125 INFO L290 TraceCheckUtils]: 73: Hoare triple {145589#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145564#(< ~counter~0 42)} is VALID [2022-04-15 15:20:32,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {145589#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145589#(< ~counter~0 41)} is VALID [2022-04-15 15:20:32,126 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {144875#true} {145589#(< ~counter~0 41)} #96#return; {145589#(< ~counter~0 41)} is VALID [2022-04-15 15:20:32,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,126 INFO L272 TraceCheckUtils]: 67: Hoare triple {145589#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:20:32,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {145589#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {145589#(< ~counter~0 41)} is VALID [2022-04-15 15:20:32,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {145614#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145589#(< ~counter~0 41)} is VALID [2022-04-15 15:20:32,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {145614#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {145614#(< ~counter~0 40)} is VALID [2022-04-15 15:20:32,130 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {144875#true} {145614#(< ~counter~0 40)} #96#return; {145614#(< ~counter~0 40)} is VALID [2022-04-15 15:20:32,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,130 INFO L272 TraceCheckUtils]: 59: Hoare triple {145614#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:20:32,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {145614#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {145614#(< ~counter~0 40)} is VALID [2022-04-15 15:20:32,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {145639#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145614#(< ~counter~0 40)} is VALID [2022-04-15 15:20:32,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {145639#(< ~counter~0 39)} assume !!(0 != ~r~0); {145639#(< ~counter~0 39)} is VALID [2022-04-15 15:20:32,133 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {144875#true} {145639#(< ~counter~0 39)} #94#return; {145639#(< ~counter~0 39)} is VALID [2022-04-15 15:20:32,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,134 INFO L272 TraceCheckUtils]: 51: Hoare triple {145639#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:20:32,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {145639#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {145639#(< ~counter~0 39)} is VALID [2022-04-15 15:20:32,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {145664#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145639#(< ~counter~0 39)} is VALID [2022-04-15 15:20:32,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {145664#(< ~counter~0 38)} assume !(~r~0 < 0); {145664#(< ~counter~0 38)} is VALID [2022-04-15 15:20:32,136 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {144875#true} {145664#(< ~counter~0 38)} #98#return; {145664#(< ~counter~0 38)} is VALID [2022-04-15 15:20:32,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,137 INFO L290 TraceCheckUtils]: 45: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,137 INFO L272 TraceCheckUtils]: 43: Hoare triple {145664#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:20:32,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {145664#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {145664#(< ~counter~0 38)} is VALID [2022-04-15 15:20:32,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {145689#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145664#(< ~counter~0 38)} is VALID [2022-04-15 15:20:32,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {145689#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {145689#(< ~counter~0 37)} is VALID [2022-04-15 15:20:32,140 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {144875#true} {145689#(< ~counter~0 37)} #98#return; {145689#(< ~counter~0 37)} is VALID [2022-04-15 15:20:32,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,140 INFO L272 TraceCheckUtils]: 35: Hoare triple {145689#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:20:32,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {145689#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {145689#(< ~counter~0 37)} is VALID [2022-04-15 15:20:32,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {145714#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {145689#(< ~counter~0 37)} is VALID [2022-04-15 15:20:32,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {145714#(< ~counter~0 36)} assume !(~r~0 > 0); {145714#(< ~counter~0 36)} is VALID [2022-04-15 15:20:32,143 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {144875#true} {145714#(< ~counter~0 36)} #96#return; {145714#(< ~counter~0 36)} is VALID [2022-04-15 15:20:32,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,144 INFO L272 TraceCheckUtils]: 27: Hoare triple {145714#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:20:32,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {145714#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {145714#(< ~counter~0 36)} is VALID [2022-04-15 15:20:32,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {145739#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {145714#(< ~counter~0 36)} is VALID [2022-04-15 15:20:32,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {145739#(< ~counter~0 35)} assume !!(0 != ~r~0); {145739#(< ~counter~0 35)} is VALID [2022-04-15 15:20:32,147 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {144875#true} {145739#(< ~counter~0 35)} #94#return; {145739#(< ~counter~0 35)} is VALID [2022-04-15 15:20:32,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {145739#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:20:32,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {145739#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {145739#(< ~counter~0 35)} is VALID [2022-04-15 15:20:32,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {145764#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145739#(< ~counter~0 35)} is VALID [2022-04-15 15:20:32,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {145764#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,150 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {144875#true} {145764#(< ~counter~0 34)} #92#return; {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,150 INFO L272 TraceCheckUtils]: 11: Hoare triple {145764#(< ~counter~0 34)} call assume_abort_if_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-15 15:20:32,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {144875#true} {145764#(< ~counter~0 34)} #90#return; {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {144875#true} assume true; {144875#true} is VALID [2022-04-15 15:20:32,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {144875#true} assume !(0 == ~cond); {144875#true} is VALID [2022-04-15 15:20:32,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {144875#true} ~cond := #in~cond; {144875#true} is VALID [2022-04-15 15:20:32,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {145764#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {144875#true} is VALID [2022-04-15 15:20:32,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {145764#(< ~counter~0 34)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 34)} is VALID [2022-04-15 15:20:32,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {145764#(< ~counter~0 34)} call #t~ret9 := main(); {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145764#(< ~counter~0 34)} {144875#true} #102#return; {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {145764#(< ~counter~0 34)} assume true; {145764#(< ~counter~0 34)} is VALID [2022-04-15 15:20:32,153 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 34)} is VALID [2022-04-15 15:20:32,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {144875#true} call ULTIMATE.init(); {144875#true} is VALID [2022-04-15 15:20:32,154 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-15 15:20:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427431399] [2022-04-15 15:20:32,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:32,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218753650] [2022-04-15 15:20:32,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218753650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:32,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:32,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:20:32,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177741735] [2022-04-15 15:20:32,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177741735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:32,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:32,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:20:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816440177] [2022-04-15 15:20:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:32,156 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-15 15:20:32,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:32,156 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-15 15:20:32,342 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-15 15:20:32,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:20:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:32,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:20:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:20:32,344 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-15 15:20:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:37,618 INFO L93 Difference]: Finished difference Result 846 states and 1128 transitions. [2022-04-15 15:20:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 15:20:37,618 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-15 15:20:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:37,618 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-15 15:20:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-15 15:20:37,620 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-15 15:20:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-15 15:20:37,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-15 15:20:38,003 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-15 15:20:38,033 INFO L225 Difference]: With dead ends: 846 [2022-04-15 15:20:38,033 INFO L226 Difference]: Without dead ends: 841 [2022-04-15 15:20:38,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1080, Invalid=1470, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 15:20:38,034 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 289 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:38,034 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.7s Time] [2022-04-15 15:20:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-04-15 15:20:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2022-04-15 15:20:41,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:41,095 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-15 15:20:41,096 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-15 15:20:41,096 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-15 15:20:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:41,119 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-15 15:20:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-15 15:20:41,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:41,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:41,121 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-15 15:20:41,121 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-15 15:20:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:41,143 INFO L93 Difference]: Finished difference Result 841 states and 1122 transitions. [2022-04-15 15:20:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1122 transitions. [2022-04-15 15:20:41,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:41,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:41,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:41,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:41,145 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-15 15:20:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1096 transitions. [2022-04-15 15:20:41,174 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1096 transitions. Word has length 151 [2022-04-15 15:20:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:41,175 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1096 transitions. [2022-04-15 15:20:41,175 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-15 15:20:41,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 819 states and 1096 transitions. [2022-04-15 15:20:51,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1093 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1096 transitions. [2022-04-15 15:20:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 15:20:51,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:51,207 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-15 15:20:51,223 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-15 15:20:51,407 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-15 15:20:51,408 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-15 15:20:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1816994070] [2022-04-15 15:20:51,408 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-15 15:20:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299592537] [2022-04-15 15:20:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:51,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:51,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976758623] [2022-04-15 15:20:51,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:20:51,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:51,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:51,426 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-15 15:20:51,447 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-15 15:20:51,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:20:51,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:51,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:20:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:51,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:52,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {150856#true} call ULTIMATE.init(); {150856#true} is VALID [2022-04-15 15:20:52,330 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-15 15:20:52,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150864#(<= ~counter~0 0)} {150856#true} #102#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {150864#(<= ~counter~0 0)} call #t~ret9 := main(); {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,331 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-15 15:20:52,331 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-15 15:20:52,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {150864#(<= ~counter~0 0)} ~cond := #in~cond; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {150864#(<= ~counter~0 0)} assume !(0 == ~cond); {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150864#(<= ~counter~0 0)} {150864#(<= ~counter~0 0)} #90#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,334 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-15 15:20:52,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {150864#(<= ~counter~0 0)} ~cond := #in~cond; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {150864#(<= ~counter~0 0)} assume !(0 == ~cond); {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {150864#(<= ~counter~0 0)} assume true; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150864#(<= ~counter~0 0)} {150864#(<= ~counter~0 0)} #92#return; {150864#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:52,336 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-15 15:20:52,339 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-15 15:20:52,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {150913#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,340 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-15 15:20:52,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {150913#(<= ~counter~0 1)} ~cond := #in~cond; {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {150913#(<= ~counter~0 1)} assume !(0 == ~cond); {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {150913#(<= ~counter~0 1)} assume true; {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150913#(<= ~counter~0 1)} {150913#(<= ~counter~0 1)} #94#return; {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {150913#(<= ~counter~0 1)} assume !!(0 != ~r~0); {150913#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:52,343 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-15 15:20:52,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {150938#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,343 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-15 15:20:52,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {150938#(<= ~counter~0 2)} ~cond := #in~cond; {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {150938#(<= ~counter~0 2)} assume !(0 == ~cond); {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {150938#(<= ~counter~0 2)} assume true; {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,345 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150938#(<= ~counter~0 2)} {150938#(<= ~counter~0 2)} #96#return; {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {150938#(<= ~counter~0 2)} assume !(~r~0 > 0); {150938#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:52,346 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-15 15:20:52,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {150963#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {150963#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:52,347 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-15 15:20:52,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {150963#(<= ~counter~0 3)} ~cond := #in~cond; {150963#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:52,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {150963#(<= ~counter~0 3)} assume !(0 == ~cond); {150963#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:52,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {150963#(<= ~counter~0 3)} assume true; {150963#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:52,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150963#(<= ~counter~0 3)} {150963#(<= ~counter~0 3)} #98#return; {150963#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:52,348 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-15 15:20:52,350 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-15 15:20:52,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {150988#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,351 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-15 15:20:52,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {150988#(<= ~counter~0 4)} ~cond := #in~cond; {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {150988#(<= ~counter~0 4)} assume !(0 == ~cond); {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {150988#(<= ~counter~0 4)} assume true; {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,352 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150988#(<= ~counter~0 4)} {150988#(<= ~counter~0 4)} #98#return; {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {150988#(<= ~counter~0 4)} assume !(~r~0 < 0); {150988#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:52,353 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-15 15:20:52,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {151013#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,354 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-15 15:20:52,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {151013#(<= ~counter~0 5)} ~cond := #in~cond; {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {151013#(<= ~counter~0 5)} assume !(0 == ~cond); {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {151013#(<= ~counter~0 5)} assume true; {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,355 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {151013#(<= ~counter~0 5)} {151013#(<= ~counter~0 5)} #94#return; {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,356 INFO L290 TraceCheckUtils]: 56: Hoare triple {151013#(<= ~counter~0 5)} assume !!(0 != ~r~0); {151013#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:52,357 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-15 15:20:52,357 INFO L290 TraceCheckUtils]: 58: Hoare triple {151038#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {151038#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:52,358 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-15 15:20:52,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {151038#(<= ~counter~0 6)} ~cond := #in~cond; {151038#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:52,358 INFO L290 TraceCheckUtils]: 61: Hoare triple {151038#(<= ~counter~0 6)} assume !(0 == ~cond); {151038#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:52,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {151038#(<= ~counter~0 6)} assume true; {151038#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:52,359 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {151038#(<= ~counter~0 6)} {151038#(<= ~counter~0 6)} #96#return; {151038#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:52,359 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-15 15:20:52,360 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-15 15:20:52,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {151063#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {151063#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:52,361 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-15 15:20:52,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {151063#(<= ~counter~0 7)} ~cond := #in~cond; {151063#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:52,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {151063#(<= ~counter~0 7)} assume !(0 == ~cond); {151063#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:52,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {151063#(<= ~counter~0 7)} assume true; {151063#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:52,362 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {151063#(<= ~counter~0 7)} {151063#(<= ~counter~0 7)} #96#return; {151063#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:52,363 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-15 15:20:52,364 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-15 15:20:52,364 INFO L290 TraceCheckUtils]: 74: Hoare triple {151088#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,365 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-15 15:20:52,365 INFO L290 TraceCheckUtils]: 76: Hoare triple {151088#(<= ~counter~0 8)} ~cond := #in~cond; {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {151088#(<= ~counter~0 8)} assume !(0 == ~cond); {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,365 INFO L290 TraceCheckUtils]: 78: Hoare triple {151088#(<= ~counter~0 8)} assume true; {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,366 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {151088#(<= ~counter~0 8)} {151088#(<= ~counter~0 8)} #96#return; {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,366 INFO L290 TraceCheckUtils]: 80: Hoare triple {151088#(<= ~counter~0 8)} assume !(~r~0 > 0); {151088#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:52,368 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-15 15:20:52,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {151113#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {151113#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:52,368 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-15 15:20:52,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {151113#(<= ~counter~0 9)} ~cond := #in~cond; {151113#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:52,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {151113#(<= ~counter~0 9)} assume !(0 == ~cond); {151113#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:52,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {151113#(<= ~counter~0 9)} assume true; {151113#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:52,370 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {151113#(<= ~counter~0 9)} {151113#(<= ~counter~0 9)} #98#return; {151113#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:52,370 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-15 15:20:52,371 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-15 15:20:52,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {151138#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,372 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-15 15:20:52,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {151138#(<= ~counter~0 10)} ~cond := #in~cond; {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,373 INFO L290 TraceCheckUtils]: 93: Hoare triple {151138#(<= ~counter~0 10)} assume !(0 == ~cond); {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {151138#(<= ~counter~0 10)} assume true; {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,374 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {151138#(<= ~counter~0 10)} {151138#(<= ~counter~0 10)} #98#return; {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {151138#(<= ~counter~0 10)} assume !(~r~0 < 0); {151138#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:52,375 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-15 15:20:52,376 INFO L290 TraceCheckUtils]: 98: Hoare triple {151163#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,376 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-15 15:20:52,377 INFO L290 TraceCheckUtils]: 100: Hoare triple {151163#(<= ~counter~0 11)} ~cond := #in~cond; {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,377 INFO L290 TraceCheckUtils]: 101: Hoare triple {151163#(<= ~counter~0 11)} assume !(0 == ~cond); {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,377 INFO L290 TraceCheckUtils]: 102: Hoare triple {151163#(<= ~counter~0 11)} assume true; {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,378 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {151163#(<= ~counter~0 11)} {151163#(<= ~counter~0 11)} #94#return; {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,378 INFO L290 TraceCheckUtils]: 104: Hoare triple {151163#(<= ~counter~0 11)} assume !!(0 != ~r~0); {151163#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:52,379 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-15 15:20:52,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {151188#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {151188#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:52,380 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-15 15:20:52,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {151188#(<= ~counter~0 12)} ~cond := #in~cond; {151188#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:52,381 INFO L290 TraceCheckUtils]: 109: Hoare triple {151188#(<= ~counter~0 12)} assume !(0 == ~cond); {151188#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:52,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {151188#(<= ~counter~0 12)} assume true; {151188#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:52,381 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {151188#(<= ~counter~0 12)} {151188#(<= ~counter~0 12)} #96#return; {151188#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:52,382 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-15 15:20:52,383 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-15 15:20:52,383 INFO L290 TraceCheckUtils]: 114: Hoare triple {151213#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {151213#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:52,384 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-15 15:20:52,384 INFO L290 TraceCheckUtils]: 116: Hoare triple {151213#(<= ~counter~0 13)} ~cond := #in~cond; {151213#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:52,384 INFO L290 TraceCheckUtils]: 117: Hoare triple {151213#(<= ~counter~0 13)} assume !(0 == ~cond); {151213#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:52,384 INFO L290 TraceCheckUtils]: 118: Hoare triple {151213#(<= ~counter~0 13)} assume true; {151213#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:52,385 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {151213#(<= ~counter~0 13)} {151213#(<= ~counter~0 13)} #96#return; {151213#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:52,385 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-15 15:20:52,386 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-15 15:20:52,387 INFO L290 TraceCheckUtils]: 122: Hoare triple {151238#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {151238#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:52,387 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-15 15:20:52,387 INFO L290 TraceCheckUtils]: 124: Hoare triple {151238#(<= ~counter~0 14)} ~cond := #in~cond; {151238#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:52,388 INFO L290 TraceCheckUtils]: 125: Hoare triple {151238#(<= ~counter~0 14)} assume !(0 == ~cond); {151238#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:52,388 INFO L290 TraceCheckUtils]: 126: Hoare triple {151238#(<= ~counter~0 14)} assume true; {151238#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:52,388 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {151238#(<= ~counter~0 14)} {151238#(<= ~counter~0 14)} #96#return; {151238#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:52,389 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-15 15:20:52,390 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-15 15:20:52,390 INFO L290 TraceCheckUtils]: 130: Hoare triple {151263#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,391 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-15 15:20:52,391 INFO L290 TraceCheckUtils]: 132: Hoare triple {151263#(<= ~counter~0 15)} ~cond := #in~cond; {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,391 INFO L290 TraceCheckUtils]: 133: Hoare triple {151263#(<= ~counter~0 15)} assume !(0 == ~cond); {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,391 INFO L290 TraceCheckUtils]: 134: Hoare triple {151263#(<= ~counter~0 15)} assume true; {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,392 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {151263#(<= ~counter~0 15)} {151263#(<= ~counter~0 15)} #96#return; {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,392 INFO L290 TraceCheckUtils]: 136: Hoare triple {151263#(<= ~counter~0 15)} assume !(~r~0 > 0); {151263#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:52,393 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-15 15:20:52,394 INFO L290 TraceCheckUtils]: 138: Hoare triple {151288#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {151288#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:52,395 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-15 15:20:52,395 INFO L290 TraceCheckUtils]: 140: Hoare triple {151288#(<= ~counter~0 16)} ~cond := #in~cond; {151288#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:52,395 INFO L290 TraceCheckUtils]: 141: Hoare triple {151288#(<= ~counter~0 16)} assume !(0 == ~cond); {151288#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:52,396 INFO L290 TraceCheckUtils]: 142: Hoare triple {151288#(<= ~counter~0 16)} assume true; {151288#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:52,397 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {151288#(<= ~counter~0 16)} {151288#(<= ~counter~0 16)} #98#return; {151288#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:52,397 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-15 15:20:52,397 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-15 15:20:52,398 INFO L290 TraceCheckUtils]: 146: Hoare triple {151313#(<= |main_#t~post8| 16)} assume !(#t~post8 < 50);havoc #t~post8; {150857#false} is VALID [2022-04-15 15:20:52,398 INFO L290 TraceCheckUtils]: 147: Hoare triple {150857#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150857#false} is VALID [2022-04-15 15:20:52,398 INFO L290 TraceCheckUtils]: 148: Hoare triple {150857#false} assume !(#t~post6 < 50);havoc #t~post6; {150857#false} is VALID [2022-04-15 15:20:52,398 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-15 15:20:52,398 INFO L290 TraceCheckUtils]: 150: Hoare triple {150857#false} ~cond := #in~cond; {150857#false} is VALID [2022-04-15 15:20:52,398 INFO L290 TraceCheckUtils]: 151: Hoare triple {150857#false} assume 0 == ~cond; {150857#false} is VALID [2022-04-15 15:20:52,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {150857#false} assume !false; {150857#false} is VALID [2022-04-15 15:20:52,399 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-15 15:20:52,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:53,498 INFO L290 TraceCheckUtils]: 152: Hoare triple {150857#false} assume !false; {150857#false} is VALID [2022-04-15 15:20:53,498 INFO L290 TraceCheckUtils]: 151: Hoare triple {150857#false} assume 0 == ~cond; {150857#false} is VALID [2022-04-15 15:20:53,498 INFO L290 TraceCheckUtils]: 150: Hoare triple {150857#false} ~cond := #in~cond; {150857#false} is VALID [2022-04-15 15:20:53,498 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-15 15:20:53,498 INFO L290 TraceCheckUtils]: 148: Hoare triple {150857#false} assume !(#t~post6 < 50);havoc #t~post6; {150857#false} is VALID [2022-04-15 15:20:53,498 INFO L290 TraceCheckUtils]: 147: Hoare triple {150857#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {150857#false} is VALID [2022-04-15 15:20:53,499 INFO L290 TraceCheckUtils]: 146: Hoare triple {151353#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {150857#false} is VALID [2022-04-15 15:20:53,499 INFO L290 TraceCheckUtils]: 145: Hoare triple {151357#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151353#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:20:53,500 INFO L290 TraceCheckUtils]: 144: Hoare triple {151357#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151357#(< ~counter~0 50)} is VALID [2022-04-15 15:20:53,500 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {150856#true} {151357#(< ~counter~0 50)} #98#return; {151357#(< ~counter~0 50)} is VALID [2022-04-15 15:20:53,500 INFO L290 TraceCheckUtils]: 142: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,501 INFO L290 TraceCheckUtils]: 141: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,501 INFO L290 TraceCheckUtils]: 140: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,501 INFO L272 TraceCheckUtils]: 139: Hoare triple {151357#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:20:53,501 INFO L290 TraceCheckUtils]: 138: Hoare triple {151357#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {151357#(< ~counter~0 50)} is VALID [2022-04-15 15:20:53,505 INFO L290 TraceCheckUtils]: 137: Hoare triple {151382#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151357#(< ~counter~0 50)} is VALID [2022-04-15 15:20:53,505 INFO L290 TraceCheckUtils]: 136: Hoare triple {151382#(< ~counter~0 49)} assume !(~r~0 > 0); {151382#(< ~counter~0 49)} is VALID [2022-04-15 15:20:53,506 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {150856#true} {151382#(< ~counter~0 49)} #96#return; {151382#(< ~counter~0 49)} is VALID [2022-04-15 15:20:53,506 INFO L290 TraceCheckUtils]: 134: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,506 INFO L290 TraceCheckUtils]: 133: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,506 INFO L290 TraceCheckUtils]: 132: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,506 INFO L272 TraceCheckUtils]: 131: Hoare triple {151382#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:20:53,507 INFO L290 TraceCheckUtils]: 130: Hoare triple {151382#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {151382#(< ~counter~0 49)} is VALID [2022-04-15 15:20:53,508 INFO L290 TraceCheckUtils]: 129: Hoare triple {151407#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151382#(< ~counter~0 49)} is VALID [2022-04-15 15:20:53,509 INFO L290 TraceCheckUtils]: 128: Hoare triple {151407#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151407#(< ~counter~0 48)} is VALID [2022-04-15 15:20:53,509 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {150856#true} {151407#(< ~counter~0 48)} #96#return; {151407#(< ~counter~0 48)} is VALID [2022-04-15 15:20:53,509 INFO L290 TraceCheckUtils]: 126: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,509 INFO L290 TraceCheckUtils]: 125: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,509 INFO L290 TraceCheckUtils]: 124: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,509 INFO L272 TraceCheckUtils]: 123: Hoare triple {151407#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:20:53,510 INFO L290 TraceCheckUtils]: 122: Hoare triple {151407#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {151407#(< ~counter~0 48)} is VALID [2022-04-15 15:20:53,511 INFO L290 TraceCheckUtils]: 121: Hoare triple {151432#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151407#(< ~counter~0 48)} is VALID [2022-04-15 15:20:53,511 INFO L290 TraceCheckUtils]: 120: Hoare triple {151432#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151432#(< ~counter~0 47)} is VALID [2022-04-15 15:20:53,512 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {150856#true} {151432#(< ~counter~0 47)} #96#return; {151432#(< ~counter~0 47)} is VALID [2022-04-15 15:20:53,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,512 INFO L272 TraceCheckUtils]: 115: Hoare triple {151432#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:20:53,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {151432#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {151432#(< ~counter~0 47)} is VALID [2022-04-15 15:20:53,513 INFO L290 TraceCheckUtils]: 113: Hoare triple {151457#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151432#(< ~counter~0 47)} is VALID [2022-04-15 15:20:53,514 INFO L290 TraceCheckUtils]: 112: Hoare triple {151457#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151457#(< ~counter~0 46)} is VALID [2022-04-15 15:20:53,514 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {150856#true} {151457#(< ~counter~0 46)} #96#return; {151457#(< ~counter~0 46)} is VALID [2022-04-15 15:20:53,514 INFO L290 TraceCheckUtils]: 110: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,514 INFO L290 TraceCheckUtils]: 109: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,514 INFO L290 TraceCheckUtils]: 108: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,514 INFO L272 TraceCheckUtils]: 107: Hoare triple {151457#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:20:53,515 INFO L290 TraceCheckUtils]: 106: Hoare triple {151457#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {151457#(< ~counter~0 46)} is VALID [2022-04-15 15:20:53,516 INFO L290 TraceCheckUtils]: 105: Hoare triple {151482#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151457#(< ~counter~0 46)} is VALID [2022-04-15 15:20:53,516 INFO L290 TraceCheckUtils]: 104: Hoare triple {151482#(< ~counter~0 45)} assume !!(0 != ~r~0); {151482#(< ~counter~0 45)} is VALID [2022-04-15 15:20:53,517 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {150856#true} {151482#(< ~counter~0 45)} #94#return; {151482#(< ~counter~0 45)} is VALID [2022-04-15 15:20:53,517 INFO L290 TraceCheckUtils]: 102: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,517 INFO L290 TraceCheckUtils]: 101: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,517 INFO L290 TraceCheckUtils]: 100: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,517 INFO L272 TraceCheckUtils]: 99: Hoare triple {151482#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:20:53,517 INFO L290 TraceCheckUtils]: 98: Hoare triple {151482#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {151482#(< ~counter~0 45)} is VALID [2022-04-15 15:20:53,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {151507#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151482#(< ~counter~0 45)} is VALID [2022-04-15 15:20:53,519 INFO L290 TraceCheckUtils]: 96: Hoare triple {151507#(< ~counter~0 44)} assume !(~r~0 < 0); {151507#(< ~counter~0 44)} is VALID [2022-04-15 15:20:53,519 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {150856#true} {151507#(< ~counter~0 44)} #98#return; {151507#(< ~counter~0 44)} is VALID [2022-04-15 15:20:53,519 INFO L290 TraceCheckUtils]: 94: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,519 INFO L290 TraceCheckUtils]: 93: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,519 INFO L290 TraceCheckUtils]: 92: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,520 INFO L272 TraceCheckUtils]: 91: Hoare triple {151507#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:20:53,520 INFO L290 TraceCheckUtils]: 90: Hoare triple {151507#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {151507#(< ~counter~0 44)} is VALID [2022-04-15 15:20:53,521 INFO L290 TraceCheckUtils]: 89: Hoare triple {151532#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151507#(< ~counter~0 44)} is VALID [2022-04-15 15:20:53,521 INFO L290 TraceCheckUtils]: 88: Hoare triple {151532#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151532#(< ~counter~0 43)} is VALID [2022-04-15 15:20:53,522 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {150856#true} {151532#(< ~counter~0 43)} #98#return; {151532#(< ~counter~0 43)} is VALID [2022-04-15 15:20:53,522 INFO L290 TraceCheckUtils]: 86: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,522 INFO L272 TraceCheckUtils]: 83: Hoare triple {151532#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:20:53,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {151532#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {151532#(< ~counter~0 43)} is VALID [2022-04-15 15:20:53,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {151557#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151532#(< ~counter~0 43)} is VALID [2022-04-15 15:20:53,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {151557#(< ~counter~0 42)} assume !(~r~0 > 0); {151557#(< ~counter~0 42)} is VALID [2022-04-15 15:20:53,524 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {150856#true} {151557#(< ~counter~0 42)} #96#return; {151557#(< ~counter~0 42)} is VALID [2022-04-15 15:20:53,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,525 INFO L272 TraceCheckUtils]: 75: Hoare triple {151557#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:20:53,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {151557#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {151557#(< ~counter~0 42)} is VALID [2022-04-15 15:20:53,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {151582#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151557#(< ~counter~0 42)} is VALID [2022-04-15 15:20:53,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {151582#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151582#(< ~counter~0 41)} is VALID [2022-04-15 15:20:53,527 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {150856#true} {151582#(< ~counter~0 41)} #96#return; {151582#(< ~counter~0 41)} is VALID [2022-04-15 15:20:53,527 INFO L290 TraceCheckUtils]: 70: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,528 INFO L290 TraceCheckUtils]: 69: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,528 INFO L290 TraceCheckUtils]: 68: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,528 INFO L272 TraceCheckUtils]: 67: Hoare triple {151582#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:20:53,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {151582#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {151582#(< ~counter~0 41)} is VALID [2022-04-15 15:20:53,529 INFO L290 TraceCheckUtils]: 65: Hoare triple {151607#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151582#(< ~counter~0 41)} is VALID [2022-04-15 15:20:53,530 INFO L290 TraceCheckUtils]: 64: Hoare triple {151607#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {151607#(< ~counter~0 40)} is VALID [2022-04-15 15:20:53,530 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {150856#true} {151607#(< ~counter~0 40)} #96#return; {151607#(< ~counter~0 40)} is VALID [2022-04-15 15:20:53,530 INFO L290 TraceCheckUtils]: 62: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,531 INFO L272 TraceCheckUtils]: 59: Hoare triple {151607#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:20:53,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {151607#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {151607#(< ~counter~0 40)} is VALID [2022-04-15 15:20:53,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {151632#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151607#(< ~counter~0 40)} is VALID [2022-04-15 15:20:53,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {151632#(< ~counter~0 39)} assume !!(0 != ~r~0); {151632#(< ~counter~0 39)} is VALID [2022-04-15 15:20:53,533 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {150856#true} {151632#(< ~counter~0 39)} #94#return; {151632#(< ~counter~0 39)} is VALID [2022-04-15 15:20:53,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,533 INFO L272 TraceCheckUtils]: 51: Hoare triple {151632#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:20:53,533 INFO L290 TraceCheckUtils]: 50: Hoare triple {151632#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {151632#(< ~counter~0 39)} is VALID [2022-04-15 15:20:53,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {151657#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151632#(< ~counter~0 39)} is VALID [2022-04-15 15:20:53,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {151657#(< ~counter~0 38)} assume !(~r~0 < 0); {151657#(< ~counter~0 38)} is VALID [2022-04-15 15:20:53,535 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {150856#true} {151657#(< ~counter~0 38)} #98#return; {151657#(< ~counter~0 38)} is VALID [2022-04-15 15:20:53,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,536 INFO L272 TraceCheckUtils]: 43: Hoare triple {151657#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:20:53,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {151657#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {151657#(< ~counter~0 38)} is VALID [2022-04-15 15:20:53,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {151682#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151657#(< ~counter~0 38)} is VALID [2022-04-15 15:20:53,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {151682#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {151682#(< ~counter~0 37)} is VALID [2022-04-15 15:20:53,538 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {150856#true} {151682#(< ~counter~0 37)} #98#return; {151682#(< ~counter~0 37)} is VALID [2022-04-15 15:20:53,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,539 INFO L272 TraceCheckUtils]: 35: Hoare triple {151682#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:20:53,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {151682#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {151682#(< ~counter~0 37)} is VALID [2022-04-15 15:20:53,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {151707#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {151682#(< ~counter~0 37)} is VALID [2022-04-15 15:20:53,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {151707#(< ~counter~0 36)} assume !(~r~0 > 0); {151707#(< ~counter~0 36)} is VALID [2022-04-15 15:20:53,541 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {150856#true} {151707#(< ~counter~0 36)} #96#return; {151707#(< ~counter~0 36)} is VALID [2022-04-15 15:20:53,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,542 INFO L272 TraceCheckUtils]: 27: Hoare triple {151707#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:20:53,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {151707#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {151707#(< ~counter~0 36)} is VALID [2022-04-15 15:20:53,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {151732#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {151707#(< ~counter~0 36)} is VALID [2022-04-15 15:20:53,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {151732#(< ~counter~0 35)} assume !!(0 != ~r~0); {151732#(< ~counter~0 35)} is VALID [2022-04-15 15:20:53,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {150856#true} {151732#(< ~counter~0 35)} #94#return; {151732#(< ~counter~0 35)} is VALID [2022-04-15 15:20:53,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {151732#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:20:53,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {151732#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {151732#(< ~counter~0 35)} is VALID [2022-04-15 15:20:53,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {151757#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151732#(< ~counter~0 35)} is VALID [2022-04-15 15:20:53,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {151757#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,547 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {150856#true} {151757#(< ~counter~0 34)} #92#return; {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,547 INFO L272 TraceCheckUtils]: 11: Hoare triple {151757#(< ~counter~0 34)} call assume_abort_if_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-15 15:20:53,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150856#true} {151757#(< ~counter~0 34)} #90#return; {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {150856#true} assume true; {150856#true} is VALID [2022-04-15 15:20:53,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {150856#true} assume !(0 == ~cond); {150856#true} is VALID [2022-04-15 15:20:53,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {150856#true} ~cond := #in~cond; {150856#true} is VALID [2022-04-15 15:20:53,548 INFO L272 TraceCheckUtils]: 6: Hoare triple {151757#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {150856#true} is VALID [2022-04-15 15:20:53,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {151757#(< ~counter~0 34)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 34)} is VALID [2022-04-15 15:20:53,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {151757#(< ~counter~0 34)} call #t~ret9 := main(); {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151757#(< ~counter~0 34)} {150856#true} #102#return; {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {151757#(< ~counter~0 34)} assume true; {151757#(< ~counter~0 34)} is VALID [2022-04-15 15:20:53,550 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 34)} is VALID [2022-04-15 15:20:53,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {150856#true} call ULTIMATE.init(); {150856#true} is VALID [2022-04-15 15:20:53,550 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-15 15:20:53,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:53,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299592537] [2022-04-15 15:20:53,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976758623] [2022-04-15 15:20:53,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976758623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:53,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:20:53,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1816994070] [2022-04-15 15:20:53,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1816994070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:53,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:20:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271039350] [2022-04-15 15:20:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:53,552 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-15 15:20:53,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:53,552 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-15 15:20:53,757 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-15 15:20:53,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:20:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:20:53,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:20:53,759 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-15 15:20:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:59,163 INFO L93 Difference]: Finished difference Result 1023 states and 1398 transitions. [2022-04-15 15:20:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 15:20:59,163 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-15 15:20:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:59,163 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-15 15:20:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-15 15:20:59,166 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-15 15:20:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-15 15:20:59,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-15 15:20:59,626 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-15 15:20:59,661 INFO L225 Difference]: With dead ends: 1023 [2022-04-15 15:20:59,661 INFO L226 Difference]: Without dead ends: 845 [2022-04-15 15:20:59,661 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-15 15:20:59,662 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 351 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:59,662 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.7s Time] [2022-04-15 15:20:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-15 15:21:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2022-04-15 15:21:02,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:02,736 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-15 15:21:02,737 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-15 15:21:02,737 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-15 15:21:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:02,759 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-15 15:21:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-15 15:21:02,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:02,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:02,768 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-15 15:21:02,768 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-15 15:21:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:02,791 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-15 15:21:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-15 15:21:02,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:02,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:02,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:02,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:02,793 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-15 15:21:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1114 transitions. [2022-04-15 15:21:02,825 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1114 transitions. Word has length 153 [2022-04-15 15:21:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:02,825 INFO L478 AbstractCegarLoop]: Abstraction has 834 states and 1114 transitions. [2022-04-15 15:21:02,825 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-15 15:21:02,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 834 states and 1114 transitions. [2022-04-15 15:21:16,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1111 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1114 transitions. [2022-04-15 15:21:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 15:21:16,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:16,387 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-15 15:21:16,406 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-15 15:21:16,591 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-15 15:21:16,591 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-15 15:21:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:16,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1581626989] [2022-04-15 15:21:16,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-15 15:21:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:16,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046338018] [2022-04-15 15:21:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:16,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036502955] [2022-04-15 15:21:16,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:21:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:16,608 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-15 15:21:16,608 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-15 15:21:16,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:21:16,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:16,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:21:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:16,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:17,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {157243#true} call ULTIMATE.init(); {157243#true} is VALID [2022-04-15 15:21:17,662 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-15 15:21:17,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157251#(<= ~counter~0 0)} {157243#true} #102#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {157251#(<= ~counter~0 0)} call #t~ret9 := main(); {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,663 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-15 15:21:17,664 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-15 15:21:17,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {157251#(<= ~counter~0 0)} ~cond := #in~cond; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {157251#(<= ~counter~0 0)} assume !(0 == ~cond); {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {157251#(<= ~counter~0 0)} {157251#(<= ~counter~0 0)} #90#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,665 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-15 15:21:17,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {157251#(<= ~counter~0 0)} ~cond := #in~cond; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {157251#(<= ~counter~0 0)} assume !(0 == ~cond); {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {157251#(<= ~counter~0 0)} assume true; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,667 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {157251#(<= ~counter~0 0)} {157251#(<= ~counter~0 0)} #92#return; {157251#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:17,667 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-15 15:21:17,670 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-15 15:21:17,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {157300#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,671 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-15 15:21:17,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {157300#(<= ~counter~0 1)} ~cond := #in~cond; {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {157300#(<= ~counter~0 1)} assume !(0 == ~cond); {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {157300#(<= ~counter~0 1)} assume true; {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {157300#(<= ~counter~0 1)} {157300#(<= ~counter~0 1)} #94#return; {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {157300#(<= ~counter~0 1)} assume !!(0 != ~r~0); {157300#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:17,673 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-15 15:21:17,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {157325#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,674 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-15 15:21:17,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {157325#(<= ~counter~0 2)} ~cond := #in~cond; {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {157325#(<= ~counter~0 2)} assume !(0 == ~cond); {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {157325#(<= ~counter~0 2)} assume true; {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,676 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {157325#(<= ~counter~0 2)} {157325#(<= ~counter~0 2)} #96#return; {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {157325#(<= ~counter~0 2)} assume !(~r~0 > 0); {157325#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:17,677 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-15 15:21:17,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {157350#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {157350#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:17,678 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-15 15:21:17,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {157350#(<= ~counter~0 3)} ~cond := #in~cond; {157350#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:17,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {157350#(<= ~counter~0 3)} assume !(0 == ~cond); {157350#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:17,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {157350#(<= ~counter~0 3)} assume true; {157350#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:17,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {157350#(<= ~counter~0 3)} {157350#(<= ~counter~0 3)} #98#return; {157350#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:17,679 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-15 15:21:17,681 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-15 15:21:17,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {157375#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,681 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-15 15:21:17,682 INFO L290 TraceCheckUtils]: 44: Hoare triple {157375#(<= ~counter~0 4)} ~cond := #in~cond; {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {157375#(<= ~counter~0 4)} assume !(0 == ~cond); {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,682 INFO L290 TraceCheckUtils]: 46: Hoare triple {157375#(<= ~counter~0 4)} assume true; {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,683 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {157375#(<= ~counter~0 4)} {157375#(<= ~counter~0 4)} #98#return; {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {157375#(<= ~counter~0 4)} assume !(~r~0 < 0); {157375#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:17,684 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-15 15:21:17,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {157400#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,685 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-15 15:21:17,685 INFO L290 TraceCheckUtils]: 52: Hoare triple {157400#(<= ~counter~0 5)} ~cond := #in~cond; {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {157400#(<= ~counter~0 5)} assume !(0 == ~cond); {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {157400#(<= ~counter~0 5)} assume true; {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,686 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {157400#(<= ~counter~0 5)} {157400#(<= ~counter~0 5)} #94#return; {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {157400#(<= ~counter~0 5)} assume !!(0 != ~r~0); {157400#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:17,688 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-15 15:21:17,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {157425#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {157425#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:17,689 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-15 15:21:17,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {157425#(<= ~counter~0 6)} ~cond := #in~cond; {157425#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:17,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {157425#(<= ~counter~0 6)} assume !(0 == ~cond); {157425#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:17,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {157425#(<= ~counter~0 6)} assume true; {157425#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:17,690 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157425#(<= ~counter~0 6)} {157425#(<= ~counter~0 6)} #96#return; {157425#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:17,690 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-15 15:21:17,691 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-15 15:21:17,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {157450#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {157450#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:17,692 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-15 15:21:17,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {157450#(<= ~counter~0 7)} ~cond := #in~cond; {157450#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:17,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {157450#(<= ~counter~0 7)} assume !(0 == ~cond); {157450#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:17,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {157450#(<= ~counter~0 7)} assume true; {157450#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:17,693 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157450#(<= ~counter~0 7)} {157450#(<= ~counter~0 7)} #96#return; {157450#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:17,694 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-15 15:21:17,695 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-15 15:21:17,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {157475#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,696 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-15 15:21:17,696 INFO L290 TraceCheckUtils]: 76: Hoare triple {157475#(<= ~counter~0 8)} ~cond := #in~cond; {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,696 INFO L290 TraceCheckUtils]: 77: Hoare triple {157475#(<= ~counter~0 8)} assume !(0 == ~cond); {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,697 INFO L290 TraceCheckUtils]: 78: Hoare triple {157475#(<= ~counter~0 8)} assume true; {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,697 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157475#(<= ~counter~0 8)} {157475#(<= ~counter~0 8)} #96#return; {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,697 INFO L290 TraceCheckUtils]: 80: Hoare triple {157475#(<= ~counter~0 8)} assume !(~r~0 > 0); {157475#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:17,698 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-15 15:21:17,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {157500#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {157500#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:17,699 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-15 15:21:17,700 INFO L290 TraceCheckUtils]: 84: Hoare triple {157500#(<= ~counter~0 9)} ~cond := #in~cond; {157500#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:17,700 INFO L290 TraceCheckUtils]: 85: Hoare triple {157500#(<= ~counter~0 9)} assume !(0 == ~cond); {157500#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:17,700 INFO L290 TraceCheckUtils]: 86: Hoare triple {157500#(<= ~counter~0 9)} assume true; {157500#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:17,701 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157500#(<= ~counter~0 9)} {157500#(<= ~counter~0 9)} #98#return; {157500#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:17,701 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-15 15:21:17,702 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-15 15:21:17,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {157525#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,703 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-15 15:21:17,703 INFO L290 TraceCheckUtils]: 92: Hoare triple {157525#(<= ~counter~0 10)} ~cond := #in~cond; {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {157525#(<= ~counter~0 10)} assume !(0 == ~cond); {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {157525#(<= ~counter~0 10)} assume true; {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,704 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157525#(<= ~counter~0 10)} {157525#(<= ~counter~0 10)} #98#return; {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {157525#(<= ~counter~0 10)} assume !(~r~0 < 0); {157525#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:17,706 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-15 15:21:17,706 INFO L290 TraceCheckUtils]: 98: Hoare triple {157550#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,706 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-15 15:21:17,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {157550#(<= ~counter~0 11)} ~cond := #in~cond; {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,707 INFO L290 TraceCheckUtils]: 101: Hoare triple {157550#(<= ~counter~0 11)} assume !(0 == ~cond); {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,707 INFO L290 TraceCheckUtils]: 102: Hoare triple {157550#(<= ~counter~0 11)} assume true; {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,708 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157550#(<= ~counter~0 11)} {157550#(<= ~counter~0 11)} #94#return; {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {157550#(<= ~counter~0 11)} assume !!(0 != ~r~0); {157550#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:17,709 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-15 15:21:17,709 INFO L290 TraceCheckUtils]: 106: Hoare triple {157575#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {157575#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:17,710 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-15 15:21:17,710 INFO L290 TraceCheckUtils]: 108: Hoare triple {157575#(<= ~counter~0 12)} ~cond := #in~cond; {157575#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:17,711 INFO L290 TraceCheckUtils]: 109: Hoare triple {157575#(<= ~counter~0 12)} assume !(0 == ~cond); {157575#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:17,711 INFO L290 TraceCheckUtils]: 110: Hoare triple {157575#(<= ~counter~0 12)} assume true; {157575#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:17,711 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157575#(<= ~counter~0 12)} {157575#(<= ~counter~0 12)} #96#return; {157575#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:17,712 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-15 15:21:17,713 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-15 15:21:17,713 INFO L290 TraceCheckUtils]: 114: Hoare triple {157600#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {157600#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:17,714 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-15 15:21:17,714 INFO L290 TraceCheckUtils]: 116: Hoare triple {157600#(<= ~counter~0 13)} ~cond := #in~cond; {157600#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:17,714 INFO L290 TraceCheckUtils]: 117: Hoare triple {157600#(<= ~counter~0 13)} assume !(0 == ~cond); {157600#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:17,714 INFO L290 TraceCheckUtils]: 118: Hoare triple {157600#(<= ~counter~0 13)} assume true; {157600#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:17,715 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157600#(<= ~counter~0 13)} {157600#(<= ~counter~0 13)} #96#return; {157600#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:17,715 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-15 15:21:17,716 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-15 15:21:17,717 INFO L290 TraceCheckUtils]: 122: Hoare triple {157625#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {157625#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:17,717 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-15 15:21:17,717 INFO L290 TraceCheckUtils]: 124: Hoare triple {157625#(<= ~counter~0 14)} ~cond := #in~cond; {157625#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:17,718 INFO L290 TraceCheckUtils]: 125: Hoare triple {157625#(<= ~counter~0 14)} assume !(0 == ~cond); {157625#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:17,718 INFO L290 TraceCheckUtils]: 126: Hoare triple {157625#(<= ~counter~0 14)} assume true; {157625#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:17,718 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157625#(<= ~counter~0 14)} {157625#(<= ~counter~0 14)} #96#return; {157625#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:17,719 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-15 15:21:17,720 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-15 15:21:17,720 INFO L290 TraceCheckUtils]: 130: Hoare triple {157650#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {157650#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:17,721 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-15 15:21:17,721 INFO L290 TraceCheckUtils]: 132: Hoare triple {157650#(<= ~counter~0 15)} ~cond := #in~cond; {157650#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:17,721 INFO L290 TraceCheckUtils]: 133: Hoare triple {157650#(<= ~counter~0 15)} assume !(0 == ~cond); {157650#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:17,722 INFO L290 TraceCheckUtils]: 134: Hoare triple {157650#(<= ~counter~0 15)} assume true; {157650#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:17,722 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157650#(<= ~counter~0 15)} {157650#(<= ~counter~0 15)} #96#return; {157650#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:17,722 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-15 15:21:17,723 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-15 15:21:17,724 INFO L290 TraceCheckUtils]: 138: Hoare triple {157675#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {157675#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:17,724 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-15 15:21:17,725 INFO L290 TraceCheckUtils]: 140: Hoare triple {157675#(<= ~counter~0 16)} ~cond := #in~cond; {157675#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:17,725 INFO L290 TraceCheckUtils]: 141: Hoare triple {157675#(<= ~counter~0 16)} assume !(0 == ~cond); {157675#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:17,725 INFO L290 TraceCheckUtils]: 142: Hoare triple {157675#(<= ~counter~0 16)} assume true; {157675#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:17,726 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157675#(<= ~counter~0 16)} {157675#(<= ~counter~0 16)} #96#return; {157675#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:17,726 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-15 15:21:17,726 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-15 15:21:17,727 INFO L290 TraceCheckUtils]: 146: Hoare triple {157700#(<= |main_#t~post7| 16)} assume !(#t~post7 < 50);havoc #t~post7; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 147: Hoare triple {157244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 148: Hoare triple {157244#false} assume !(#t~post8 < 50);havoc #t~post8; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 149: Hoare triple {157244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 150: Hoare triple {157244#false} assume !(#t~post6 < 50);havoc #t~post6; {157244#false} is VALID [2022-04-15 15:21:17,727 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-15 15:21:17,727 INFO L290 TraceCheckUtils]: 152: Hoare triple {157244#false} ~cond := #in~cond; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 153: Hoare triple {157244#false} assume 0 == ~cond; {157244#false} is VALID [2022-04-15 15:21:17,727 INFO L290 TraceCheckUtils]: 154: Hoare triple {157244#false} assume !false; {157244#false} is VALID [2022-04-15 15:21:17,728 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-15 15:21:17,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:18,740 INFO L290 TraceCheckUtils]: 154: Hoare triple {157244#false} assume !false; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 153: Hoare triple {157244#false} assume 0 == ~cond; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 152: Hoare triple {157244#false} ~cond := #in~cond; {157244#false} is VALID [2022-04-15 15:21:18,741 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-15 15:21:18,741 INFO L290 TraceCheckUtils]: 150: Hoare triple {157244#false} assume !(#t~post6 < 50);havoc #t~post6; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 149: Hoare triple {157244#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 148: Hoare triple {157244#false} assume !(#t~post8 < 50);havoc #t~post8; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 147: Hoare triple {157244#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157244#false} is VALID [2022-04-15 15:21:18,741 INFO L290 TraceCheckUtils]: 146: Hoare triple {157752#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {157244#false} is VALID [2022-04-15 15:21:18,742 INFO L290 TraceCheckUtils]: 145: Hoare triple {157756#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157752#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:21:18,742 INFO L290 TraceCheckUtils]: 144: Hoare triple {157756#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157756#(< ~counter~0 50)} is VALID [2022-04-15 15:21:18,743 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {157243#true} {157756#(< ~counter~0 50)} #96#return; {157756#(< ~counter~0 50)} is VALID [2022-04-15 15:21:18,743 INFO L290 TraceCheckUtils]: 142: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,743 INFO L290 TraceCheckUtils]: 141: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,743 INFO L290 TraceCheckUtils]: 140: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,743 INFO L272 TraceCheckUtils]: 139: Hoare triple {157756#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:21:18,743 INFO L290 TraceCheckUtils]: 138: Hoare triple {157756#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {157756#(< ~counter~0 50)} is VALID [2022-04-15 15:21:18,746 INFO L290 TraceCheckUtils]: 137: Hoare triple {157781#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157756#(< ~counter~0 50)} is VALID [2022-04-15 15:21:18,746 INFO L290 TraceCheckUtils]: 136: Hoare triple {157781#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157781#(< ~counter~0 49)} is VALID [2022-04-15 15:21:18,747 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {157243#true} {157781#(< ~counter~0 49)} #96#return; {157781#(< ~counter~0 49)} is VALID [2022-04-15 15:21:18,747 INFO L290 TraceCheckUtils]: 134: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,747 INFO L290 TraceCheckUtils]: 133: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,747 INFO L290 TraceCheckUtils]: 132: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,747 INFO L272 TraceCheckUtils]: 131: Hoare triple {157781#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:21:18,747 INFO L290 TraceCheckUtils]: 130: Hoare triple {157781#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {157781#(< ~counter~0 49)} is VALID [2022-04-15 15:21:18,749 INFO L290 TraceCheckUtils]: 129: Hoare triple {157806#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157781#(< ~counter~0 49)} is VALID [2022-04-15 15:21:18,749 INFO L290 TraceCheckUtils]: 128: Hoare triple {157806#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157806#(< ~counter~0 48)} is VALID [2022-04-15 15:21:18,749 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {157243#true} {157806#(< ~counter~0 48)} #96#return; {157806#(< ~counter~0 48)} is VALID [2022-04-15 15:21:18,749 INFO L290 TraceCheckUtils]: 126: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,750 INFO L290 TraceCheckUtils]: 125: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,750 INFO L290 TraceCheckUtils]: 124: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,750 INFO L272 TraceCheckUtils]: 123: Hoare triple {157806#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:21:18,750 INFO L290 TraceCheckUtils]: 122: Hoare triple {157806#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {157806#(< ~counter~0 48)} is VALID [2022-04-15 15:21:18,751 INFO L290 TraceCheckUtils]: 121: Hoare triple {157831#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157806#(< ~counter~0 48)} is VALID [2022-04-15 15:21:18,751 INFO L290 TraceCheckUtils]: 120: Hoare triple {157831#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157831#(< ~counter~0 47)} is VALID [2022-04-15 15:21:18,752 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {157243#true} {157831#(< ~counter~0 47)} #96#return; {157831#(< ~counter~0 47)} is VALID [2022-04-15 15:21:18,752 INFO L290 TraceCheckUtils]: 118: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,752 INFO L290 TraceCheckUtils]: 117: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,752 INFO L290 TraceCheckUtils]: 116: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,752 INFO L272 TraceCheckUtils]: 115: Hoare triple {157831#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:21:18,752 INFO L290 TraceCheckUtils]: 114: Hoare triple {157831#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {157831#(< ~counter~0 47)} is VALID [2022-04-15 15:21:18,754 INFO L290 TraceCheckUtils]: 113: Hoare triple {157856#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157831#(< ~counter~0 47)} is VALID [2022-04-15 15:21:18,754 INFO L290 TraceCheckUtils]: 112: Hoare triple {157856#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157856#(< ~counter~0 46)} is VALID [2022-04-15 15:21:18,754 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {157243#true} {157856#(< ~counter~0 46)} #96#return; {157856#(< ~counter~0 46)} is VALID [2022-04-15 15:21:18,755 INFO L290 TraceCheckUtils]: 110: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,755 INFO L290 TraceCheckUtils]: 109: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,755 INFO L290 TraceCheckUtils]: 108: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,755 INFO L272 TraceCheckUtils]: 107: Hoare triple {157856#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:21:18,755 INFO L290 TraceCheckUtils]: 106: Hoare triple {157856#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {157856#(< ~counter~0 46)} is VALID [2022-04-15 15:21:18,756 INFO L290 TraceCheckUtils]: 105: Hoare triple {157881#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157856#(< ~counter~0 46)} is VALID [2022-04-15 15:21:18,756 INFO L290 TraceCheckUtils]: 104: Hoare triple {157881#(< ~counter~0 45)} assume !!(0 != ~r~0); {157881#(< ~counter~0 45)} is VALID [2022-04-15 15:21:18,757 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {157243#true} {157881#(< ~counter~0 45)} #94#return; {157881#(< ~counter~0 45)} is VALID [2022-04-15 15:21:18,757 INFO L290 TraceCheckUtils]: 102: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,757 INFO L290 TraceCheckUtils]: 101: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,757 INFO L290 TraceCheckUtils]: 100: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,757 INFO L272 TraceCheckUtils]: 99: Hoare triple {157881#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:21:18,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {157881#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {157881#(< ~counter~0 45)} is VALID [2022-04-15 15:21:18,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {157906#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {157881#(< ~counter~0 45)} is VALID [2022-04-15 15:21:18,759 INFO L290 TraceCheckUtils]: 96: Hoare triple {157906#(< ~counter~0 44)} assume !(~r~0 < 0); {157906#(< ~counter~0 44)} is VALID [2022-04-15 15:21:18,760 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {157243#true} {157906#(< ~counter~0 44)} #98#return; {157906#(< ~counter~0 44)} is VALID [2022-04-15 15:21:18,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,760 INFO L272 TraceCheckUtils]: 91: Hoare triple {157906#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:21:18,760 INFO L290 TraceCheckUtils]: 90: Hoare triple {157906#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {157906#(< ~counter~0 44)} is VALID [2022-04-15 15:21:18,761 INFO L290 TraceCheckUtils]: 89: Hoare triple {157931#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157906#(< ~counter~0 44)} is VALID [2022-04-15 15:21:18,762 INFO L290 TraceCheckUtils]: 88: Hoare triple {157931#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {157931#(< ~counter~0 43)} is VALID [2022-04-15 15:21:18,762 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {157243#true} {157931#(< ~counter~0 43)} #98#return; {157931#(< ~counter~0 43)} is VALID [2022-04-15 15:21:18,762 INFO L290 TraceCheckUtils]: 86: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,762 INFO L290 TraceCheckUtils]: 85: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,762 INFO L272 TraceCheckUtils]: 83: Hoare triple {157931#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:21:18,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {157931#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {157931#(< ~counter~0 43)} is VALID [2022-04-15 15:21:18,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {157956#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {157931#(< ~counter~0 43)} is VALID [2022-04-15 15:21:18,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {157956#(< ~counter~0 42)} assume !(~r~0 > 0); {157956#(< ~counter~0 42)} is VALID [2022-04-15 15:21:18,765 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {157243#true} {157956#(< ~counter~0 42)} #96#return; {157956#(< ~counter~0 42)} is VALID [2022-04-15 15:21:18,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,765 INFO L290 TraceCheckUtils]: 77: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,765 INFO L272 TraceCheckUtils]: 75: Hoare triple {157956#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:21:18,765 INFO L290 TraceCheckUtils]: 74: Hoare triple {157956#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {157956#(< ~counter~0 42)} is VALID [2022-04-15 15:21:18,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {157981#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157956#(< ~counter~0 42)} is VALID [2022-04-15 15:21:18,767 INFO L290 TraceCheckUtils]: 72: Hoare triple {157981#(< ~counter~0 41)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {157981#(< ~counter~0 41)} is VALID [2022-04-15 15:21:18,767 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {157243#true} {157981#(< ~counter~0 41)} #96#return; {157981#(< ~counter~0 41)} is VALID [2022-04-15 15:21:18,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,767 INFO L272 TraceCheckUtils]: 67: Hoare triple {157981#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:21:18,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {157981#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {157981#(< ~counter~0 41)} is VALID [2022-04-15 15:21:18,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {158006#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {157981#(< ~counter~0 41)} is VALID [2022-04-15 15:21:18,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {158006#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158006#(< ~counter~0 40)} is VALID [2022-04-15 15:21:18,770 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {157243#true} {158006#(< ~counter~0 40)} #96#return; {158006#(< ~counter~0 40)} is VALID [2022-04-15 15:21:18,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,770 INFO L272 TraceCheckUtils]: 59: Hoare triple {158006#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:21:18,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {158006#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {158006#(< ~counter~0 40)} is VALID [2022-04-15 15:21:18,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {158031#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158006#(< ~counter~0 40)} is VALID [2022-04-15 15:21:18,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {158031#(< ~counter~0 39)} assume !!(0 != ~r~0); {158031#(< ~counter~0 39)} is VALID [2022-04-15 15:21:18,772 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {157243#true} {158031#(< ~counter~0 39)} #94#return; {158031#(< ~counter~0 39)} is VALID [2022-04-15 15:21:18,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,772 INFO L290 TraceCheckUtils]: 53: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,772 INFO L290 TraceCheckUtils]: 52: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,773 INFO L272 TraceCheckUtils]: 51: Hoare triple {158031#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:21:18,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {158031#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {158031#(< ~counter~0 39)} is VALID [2022-04-15 15:21:18,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {158056#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158031#(< ~counter~0 39)} is VALID [2022-04-15 15:21:18,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {158056#(< ~counter~0 38)} assume !(~r~0 < 0); {158056#(< ~counter~0 38)} is VALID [2022-04-15 15:21:18,775 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {157243#true} {158056#(< ~counter~0 38)} #98#return; {158056#(< ~counter~0 38)} is VALID [2022-04-15 15:21:18,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,775 INFO L272 TraceCheckUtils]: 43: Hoare triple {158056#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:21:18,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {158056#(< ~counter~0 38)} assume !!(#t~post8 < 50);havoc #t~post8; {158056#(< ~counter~0 38)} is VALID [2022-04-15 15:21:18,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {158081#(< ~counter~0 37)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158056#(< ~counter~0 38)} is VALID [2022-04-15 15:21:18,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {158081#(< ~counter~0 37)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {158081#(< ~counter~0 37)} is VALID [2022-04-15 15:21:18,777 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {157243#true} {158081#(< ~counter~0 37)} #98#return; {158081#(< ~counter~0 37)} is VALID [2022-04-15 15:21:18,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,778 INFO L272 TraceCheckUtils]: 35: Hoare triple {158081#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:21:18,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {158081#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {158081#(< ~counter~0 37)} is VALID [2022-04-15 15:21:18,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {158106#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158081#(< ~counter~0 37)} is VALID [2022-04-15 15:21:18,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {158106#(< ~counter~0 36)} assume !(~r~0 > 0); {158106#(< ~counter~0 36)} is VALID [2022-04-15 15:21:18,780 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {157243#true} {158106#(< ~counter~0 36)} #96#return; {158106#(< ~counter~0 36)} is VALID [2022-04-15 15:21:18,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,780 INFO L272 TraceCheckUtils]: 27: Hoare triple {158106#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:21:18,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {158106#(< ~counter~0 36)} assume !!(#t~post7 < 50);havoc #t~post7; {158106#(< ~counter~0 36)} is VALID [2022-04-15 15:21:18,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {158131#(< ~counter~0 35)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158106#(< ~counter~0 36)} is VALID [2022-04-15 15:21:18,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {158131#(< ~counter~0 35)} assume !!(0 != ~r~0); {158131#(< ~counter~0 35)} is VALID [2022-04-15 15:21:18,782 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {157243#true} {158131#(< ~counter~0 35)} #94#return; {158131#(< ~counter~0 35)} is VALID [2022-04-15 15:21:18,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,783 INFO L272 TraceCheckUtils]: 19: Hoare triple {158131#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:21:18,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {158131#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {158131#(< ~counter~0 35)} is VALID [2022-04-15 15:21:18,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {158156#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158131#(< ~counter~0 35)} is VALID [2022-04-15 15:21:18,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {158156#(< ~counter~0 34)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,785 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {157243#true} {158156#(< ~counter~0 34)} #92#return; {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,785 INFO L272 TraceCheckUtils]: 11: Hoare triple {158156#(< ~counter~0 34)} call assume_abort_if_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-15 15:21:18,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {157243#true} {158156#(< ~counter~0 34)} #90#return; {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {157243#true} assume true; {157243#true} is VALID [2022-04-15 15:21:18,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {157243#true} assume !(0 == ~cond); {157243#true} is VALID [2022-04-15 15:21:18,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {157243#true} ~cond := #in~cond; {157243#true} is VALID [2022-04-15 15:21:18,786 INFO L272 TraceCheckUtils]: 6: Hoare triple {158156#(< ~counter~0 34)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {157243#true} is VALID [2022-04-15 15:21:18,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {158156#(< ~counter~0 34)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 34)} is VALID [2022-04-15 15:21:18,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {158156#(< ~counter~0 34)} call #t~ret9 := main(); {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158156#(< ~counter~0 34)} {157243#true} #102#return; {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {158156#(< ~counter~0 34)} assume true; {158156#(< ~counter~0 34)} is VALID [2022-04-15 15:21:18,787 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 34)} is VALID [2022-04-15 15:21:18,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {157243#true} call ULTIMATE.init(); {157243#true} is VALID [2022-04-15 15:21:18,788 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-15 15:21:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046338018] [2022-04-15 15:21:18,788 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036502955] [2022-04-15 15:21:18,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036502955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:18,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:18,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:21:18,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1581626989] [2022-04-15 15:21:18,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1581626989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:18,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:18,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:21:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684739590] [2022-04-15 15:21:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:18,789 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-15 15:21:18,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:18,789 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-15 15:21:18,954 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-15 15:21:18,954 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:21:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:21:18,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:21:18,955 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-15 15:21:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:24,181 INFO L93 Difference]: Finished difference Result 1021 states and 1392 transitions. [2022-04-15 15:21:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 15:21:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 19 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 155 [2022-04-15 15:21:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:24,181 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-15 15:21:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-15 15:21:24,184 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-15 15:21:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-15 15:21:24,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-15 15:21:24,625 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-15 15:21:24,655 INFO L225 Difference]: With dead ends: 1021 [2022-04-15 15:21:24,655 INFO L226 Difference]: Without dead ends: 851 [2022-04-15 15:21:24,656 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-15 15:21:24,656 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-15 15:21:24,656 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-15 15:21:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-04-15 15:21:27,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-04-15 15:21:27,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:27,863 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-15 15:21:27,863 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-15 15:21:27,864 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-15 15:21:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:27,887 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-15 15:21:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-15 15:21:27,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:27,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:27,888 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-15 15:21:27,889 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-15 15:21:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:27,911 INFO L93 Difference]: Finished difference Result 851 states and 1131 transitions. [2022-04-15 15:21:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-15 15:21:27,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:27,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:27,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:27,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:27,912 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-15 15:21:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1131 transitions. [2022-04-15 15:21:27,945 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1131 transitions. Word has length 155 [2022-04-15 15:21:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:27,945 INFO L478 AbstractCegarLoop]: Abstraction has 851 states and 1131 transitions. [2022-04-15 15:21:27,945 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-15 15:21:27,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 851 states and 1131 transitions. [2022-04-15 15:21:35,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1131 transitions. [2022-04-15 15:21:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 15:21:35,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:35,299 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-15 15:21:35,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:35,499 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-15 15:21:35,499 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-15 15:21:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:35,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122242687] [2022-04-15 15:21:35,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-15 15:21:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:35,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010751643] [2022-04-15 15:21:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:35,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771092674] [2022-04-15 15:21:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:21:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:35,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:35,515 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-15 15:21:35,520 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-15 15:21:36,435 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:21:36,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:36,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:21:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:36,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:37,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {163686#true} call ULTIMATE.init(); {163686#true} is VALID [2022-04-15 15:21:37,330 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-15 15:21:37,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163694#(<= ~counter~0 0)} {163686#true} #102#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {163694#(<= ~counter~0 0)} call #t~ret9 := main(); {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,331 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-15 15:21:37,332 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-15 15:21:37,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {163694#(<= ~counter~0 0)} ~cond := #in~cond; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {163694#(<= ~counter~0 0)} assume !(0 == ~cond); {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163694#(<= ~counter~0 0)} {163694#(<= ~counter~0 0)} #90#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,333 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-15 15:21:37,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {163694#(<= ~counter~0 0)} ~cond := #in~cond; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {163694#(<= ~counter~0 0)} assume !(0 == ~cond); {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {163694#(<= ~counter~0 0)} assume true; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,334 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163694#(<= ~counter~0 0)} {163694#(<= ~counter~0 0)} #92#return; {163694#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:37,335 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-15 15:21:37,338 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-15 15:21:37,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {163743#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,339 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-15 15:21:37,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {163743#(<= ~counter~0 1)} ~cond := #in~cond; {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {163743#(<= ~counter~0 1)} assume !(0 == ~cond); {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {163743#(<= ~counter~0 1)} assume true; {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,340 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163743#(<= ~counter~0 1)} {163743#(<= ~counter~0 1)} #94#return; {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {163743#(<= ~counter~0 1)} assume !!(0 != ~r~0); {163743#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:37,342 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-15 15:21:37,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {163768#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,342 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-15 15:21:37,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {163768#(<= ~counter~0 2)} ~cond := #in~cond; {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {163768#(<= ~counter~0 2)} assume !(0 == ~cond); {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {163768#(<= ~counter~0 2)} assume true; {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,344 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163768#(<= ~counter~0 2)} {163768#(<= ~counter~0 2)} #96#return; {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,344 INFO L290 TraceCheckUtils]: 32: Hoare triple {163768#(<= ~counter~0 2)} assume !(~r~0 > 0); {163768#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:37,345 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-15 15:21:37,345 INFO L290 TraceCheckUtils]: 34: Hoare triple {163793#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {163793#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:37,346 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-15 15:21:37,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {163793#(<= ~counter~0 3)} ~cond := #in~cond; {163793#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:37,346 INFO L290 TraceCheckUtils]: 37: Hoare triple {163793#(<= ~counter~0 3)} assume !(0 == ~cond); {163793#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:37,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {163793#(<= ~counter~0 3)} assume true; {163793#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:37,347 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163793#(<= ~counter~0 3)} {163793#(<= ~counter~0 3)} #98#return; {163793#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:37,347 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-15 15:21:37,349 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-15 15:21:37,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {163818#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,350 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-15 15:21:37,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {163818#(<= ~counter~0 4)} ~cond := #in~cond; {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {163818#(<= ~counter~0 4)} assume !(0 == ~cond); {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {163818#(<= ~counter~0 4)} assume true; {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,351 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163818#(<= ~counter~0 4)} {163818#(<= ~counter~0 4)} #98#return; {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {163818#(<= ~counter~0 4)} assume !(~r~0 < 0); {163818#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:37,353 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-15 15:21:37,353 INFO L290 TraceCheckUtils]: 50: Hoare triple {163843#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,353 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-15 15:21:37,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {163843#(<= ~counter~0 5)} ~cond := #in~cond; {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {163843#(<= ~counter~0 5)} assume !(0 == ~cond); {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {163843#(<= ~counter~0 5)} assume true; {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,355 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163843#(<= ~counter~0 5)} {163843#(<= ~counter~0 5)} #94#return; {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {163843#(<= ~counter~0 5)} assume !!(0 != ~r~0); {163843#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:37,356 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-15 15:21:37,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {163868#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {163868#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:37,357 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-15 15:21:37,357 INFO L290 TraceCheckUtils]: 60: Hoare triple {163868#(<= ~counter~0 6)} ~cond := #in~cond; {163868#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:37,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {163868#(<= ~counter~0 6)} assume !(0 == ~cond); {163868#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:37,358 INFO L290 TraceCheckUtils]: 62: Hoare triple {163868#(<= ~counter~0 6)} assume true; {163868#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:37,358 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163868#(<= ~counter~0 6)} {163868#(<= ~counter~0 6)} #96#return; {163868#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:37,359 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-15 15:21:37,360 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-15 15:21:37,360 INFO L290 TraceCheckUtils]: 66: Hoare triple {163893#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {163893#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:37,361 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-15 15:21:37,361 INFO L290 TraceCheckUtils]: 68: Hoare triple {163893#(<= ~counter~0 7)} ~cond := #in~cond; {163893#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:37,361 INFO L290 TraceCheckUtils]: 69: Hoare triple {163893#(<= ~counter~0 7)} assume !(0 == ~cond); {163893#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:37,361 INFO L290 TraceCheckUtils]: 70: Hoare triple {163893#(<= ~counter~0 7)} assume true; {163893#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:37,362 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163893#(<= ~counter~0 7)} {163893#(<= ~counter~0 7)} #96#return; {163893#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:37,362 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-15 15:21:37,363 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-15 15:21:37,364 INFO L290 TraceCheckUtils]: 74: Hoare triple {163918#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,364 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-15 15:21:37,364 INFO L290 TraceCheckUtils]: 76: Hoare triple {163918#(<= ~counter~0 8)} ~cond := #in~cond; {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,365 INFO L290 TraceCheckUtils]: 77: Hoare triple {163918#(<= ~counter~0 8)} assume !(0 == ~cond); {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,365 INFO L290 TraceCheckUtils]: 78: Hoare triple {163918#(<= ~counter~0 8)} assume true; {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,365 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163918#(<= ~counter~0 8)} {163918#(<= ~counter~0 8)} #96#return; {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,366 INFO L290 TraceCheckUtils]: 80: Hoare triple {163918#(<= ~counter~0 8)} assume !(~r~0 > 0); {163918#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:37,367 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-15 15:21:37,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {163943#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {163943#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:37,368 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-15 15:21:37,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {163943#(<= ~counter~0 9)} ~cond := #in~cond; {163943#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:37,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {163943#(<= ~counter~0 9)} assume !(0 == ~cond); {163943#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:37,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {163943#(<= ~counter~0 9)} assume true; {163943#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:37,369 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163943#(<= ~counter~0 9)} {163943#(<= ~counter~0 9)} #98#return; {163943#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:37,369 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-15 15:21:37,371 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-15 15:21:37,371 INFO L290 TraceCheckUtils]: 90: Hoare triple {163968#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,371 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-15 15:21:37,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {163968#(<= ~counter~0 10)} ~cond := #in~cond; {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {163968#(<= ~counter~0 10)} assume !(0 == ~cond); {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {163968#(<= ~counter~0 10)} assume true; {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,373 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163968#(<= ~counter~0 10)} {163968#(<= ~counter~0 10)} #98#return; {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {163968#(<= ~counter~0 10)} assume !(~r~0 < 0); {163968#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:37,374 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-15 15:21:37,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {163993#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,375 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-15 15:21:37,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {163993#(<= ~counter~0 11)} ~cond := #in~cond; {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,376 INFO L290 TraceCheckUtils]: 101: Hoare triple {163993#(<= ~counter~0 11)} assume !(0 == ~cond); {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {163993#(<= ~counter~0 11)} assume true; {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,376 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163993#(<= ~counter~0 11)} {163993#(<= ~counter~0 11)} #94#return; {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,377 INFO L290 TraceCheckUtils]: 104: Hoare triple {163993#(<= ~counter~0 11)} assume !!(0 != ~r~0); {163993#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:37,378 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-15 15:21:37,378 INFO L290 TraceCheckUtils]: 106: Hoare triple {164018#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {164018#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:37,379 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-15 15:21:37,379 INFO L290 TraceCheckUtils]: 108: Hoare triple {164018#(<= ~counter~0 12)} ~cond := #in~cond; {164018#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:37,379 INFO L290 TraceCheckUtils]: 109: Hoare triple {164018#(<= ~counter~0 12)} assume !(0 == ~cond); {164018#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:37,379 INFO L290 TraceCheckUtils]: 110: Hoare triple {164018#(<= ~counter~0 12)} assume true; {164018#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:37,380 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {164018#(<= ~counter~0 12)} {164018#(<= ~counter~0 12)} #96#return; {164018#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:37,380 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-15 15:21:37,381 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-15 15:21:37,382 INFO L290 TraceCheckUtils]: 114: Hoare triple {164043#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {164043#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:37,382 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-15 15:21:37,383 INFO L290 TraceCheckUtils]: 116: Hoare triple {164043#(<= ~counter~0 13)} ~cond := #in~cond; {164043#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:37,383 INFO L290 TraceCheckUtils]: 117: Hoare triple {164043#(<= ~counter~0 13)} assume !(0 == ~cond); {164043#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:37,383 INFO L290 TraceCheckUtils]: 118: Hoare triple {164043#(<= ~counter~0 13)} assume true; {164043#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:37,384 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {164043#(<= ~counter~0 13)} {164043#(<= ~counter~0 13)} #96#return; {164043#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:37,384 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-15 15:21:37,385 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-15 15:21:37,385 INFO L290 TraceCheckUtils]: 122: Hoare triple {164068#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {164068#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:37,386 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-15 15:21:37,386 INFO L290 TraceCheckUtils]: 124: Hoare triple {164068#(<= ~counter~0 14)} ~cond := #in~cond; {164068#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:37,387 INFO L290 TraceCheckUtils]: 125: Hoare triple {164068#(<= ~counter~0 14)} assume !(0 == ~cond); {164068#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:37,387 INFO L290 TraceCheckUtils]: 126: Hoare triple {164068#(<= ~counter~0 14)} assume true; {164068#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:37,387 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {164068#(<= ~counter~0 14)} {164068#(<= ~counter~0 14)} #96#return; {164068#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:37,388 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-15 15:21:37,389 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-15 15:21:37,389 INFO L290 TraceCheckUtils]: 130: Hoare triple {164093#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,390 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-15 15:21:37,390 INFO L290 TraceCheckUtils]: 132: Hoare triple {164093#(<= ~counter~0 15)} ~cond := #in~cond; {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,390 INFO L290 TraceCheckUtils]: 133: Hoare triple {164093#(<= ~counter~0 15)} assume !(0 == ~cond); {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,390 INFO L290 TraceCheckUtils]: 134: Hoare triple {164093#(<= ~counter~0 15)} assume true; {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,391 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {164093#(<= ~counter~0 15)} {164093#(<= ~counter~0 15)} #96#return; {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,391 INFO L290 TraceCheckUtils]: 136: Hoare triple {164093#(<= ~counter~0 15)} assume !(~r~0 > 0); {164093#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:37,392 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-15 15:21:37,393 INFO L290 TraceCheckUtils]: 138: Hoare triple {164118#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {164118#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:37,393 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-15 15:21:37,393 INFO L290 TraceCheckUtils]: 140: Hoare triple {164118#(<= ~counter~0 16)} ~cond := #in~cond; {164118#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:37,394 INFO L290 TraceCheckUtils]: 141: Hoare triple {164118#(<= ~counter~0 16)} assume !(0 == ~cond); {164118#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:37,394 INFO L290 TraceCheckUtils]: 142: Hoare triple {164118#(<= ~counter~0 16)} assume true; {164118#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:37,394 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {164118#(<= ~counter~0 16)} {164118#(<= ~counter~0 16)} #98#return; {164118#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:37,395 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-15 15:21:37,396 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-15 15:21:37,396 INFO L290 TraceCheckUtils]: 146: Hoare triple {164143#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,397 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-15 15:21:37,397 INFO L290 TraceCheckUtils]: 148: Hoare triple {164143#(<= ~counter~0 17)} ~cond := #in~cond; {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,397 INFO L290 TraceCheckUtils]: 149: Hoare triple {164143#(<= ~counter~0 17)} assume !(0 == ~cond); {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,398 INFO L290 TraceCheckUtils]: 150: Hoare triple {164143#(<= ~counter~0 17)} assume true; {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,398 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {164143#(<= ~counter~0 17)} {164143#(<= ~counter~0 17)} #98#return; {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {164143#(<= ~counter~0 17)} assume !(~r~0 < 0); {164143#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:37,399 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-15 15:21:37,399 INFO L290 TraceCheckUtils]: 154: Hoare triple {164168#(<= |main_#t~post6| 17)} assume !(#t~post6 < 50);havoc #t~post6; {163687#false} is VALID [2022-04-15 15:21:37,399 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-15 15:21:37,399 INFO L290 TraceCheckUtils]: 156: Hoare triple {163687#false} ~cond := #in~cond; {163687#false} is VALID [2022-04-15 15:21:37,399 INFO L290 TraceCheckUtils]: 157: Hoare triple {163687#false} assume 0 == ~cond; {163687#false} is VALID [2022-04-15 15:21:37,399 INFO L290 TraceCheckUtils]: 158: Hoare triple {163687#false} assume !false; {163687#false} is VALID [2022-04-15 15:21:37,400 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-15 15:21:37,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:38,431 INFO L290 TraceCheckUtils]: 158: Hoare triple {163687#false} assume !false; {163687#false} is VALID [2022-04-15 15:21:38,431 INFO L290 TraceCheckUtils]: 157: Hoare triple {163687#false} assume 0 == ~cond; {163687#false} is VALID [2022-04-15 15:21:38,431 INFO L290 TraceCheckUtils]: 156: Hoare triple {163687#false} ~cond := #in~cond; {163687#false} is VALID [2022-04-15 15:21:38,431 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-15 15:21:38,431 INFO L290 TraceCheckUtils]: 154: Hoare triple {164196#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {163687#false} is VALID [2022-04-15 15:21:38,432 INFO L290 TraceCheckUtils]: 153: Hoare triple {164200#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164196#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:21:38,432 INFO L290 TraceCheckUtils]: 152: Hoare triple {164200#(< ~counter~0 50)} assume !(~r~0 < 0); {164200#(< ~counter~0 50)} is VALID [2022-04-15 15:21:38,432 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {163686#true} {164200#(< ~counter~0 50)} #98#return; {164200#(< ~counter~0 50)} is VALID [2022-04-15 15:21:38,433 INFO L290 TraceCheckUtils]: 150: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,433 INFO L290 TraceCheckUtils]: 149: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,433 INFO L290 TraceCheckUtils]: 148: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,433 INFO L272 TraceCheckUtils]: 147: Hoare triple {164200#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:21:38,433 INFO L290 TraceCheckUtils]: 146: Hoare triple {164200#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {164200#(< ~counter~0 50)} is VALID [2022-04-15 15:21:38,436 INFO L290 TraceCheckUtils]: 145: Hoare triple {164225#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164200#(< ~counter~0 50)} is VALID [2022-04-15 15:21:38,436 INFO L290 TraceCheckUtils]: 144: Hoare triple {164225#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164225#(< ~counter~0 49)} is VALID [2022-04-15 15:21:38,437 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {163686#true} {164225#(< ~counter~0 49)} #98#return; {164225#(< ~counter~0 49)} is VALID [2022-04-15 15:21:38,437 INFO L290 TraceCheckUtils]: 142: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,437 INFO L290 TraceCheckUtils]: 141: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,437 INFO L290 TraceCheckUtils]: 140: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,437 INFO L272 TraceCheckUtils]: 139: Hoare triple {164225#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:21:38,437 INFO L290 TraceCheckUtils]: 138: Hoare triple {164225#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {164225#(< ~counter~0 49)} is VALID [2022-04-15 15:21:38,439 INFO L290 TraceCheckUtils]: 137: Hoare triple {164250#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164225#(< ~counter~0 49)} is VALID [2022-04-15 15:21:38,439 INFO L290 TraceCheckUtils]: 136: Hoare triple {164250#(< ~counter~0 48)} assume !(~r~0 > 0); {164250#(< ~counter~0 48)} is VALID [2022-04-15 15:21:38,440 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {163686#true} {164250#(< ~counter~0 48)} #96#return; {164250#(< ~counter~0 48)} is VALID [2022-04-15 15:21:38,440 INFO L290 TraceCheckUtils]: 134: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,440 INFO L290 TraceCheckUtils]: 133: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,440 INFO L290 TraceCheckUtils]: 132: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,440 INFO L272 TraceCheckUtils]: 131: Hoare triple {164250#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:21:38,440 INFO L290 TraceCheckUtils]: 130: Hoare triple {164250#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {164250#(< ~counter~0 48)} is VALID [2022-04-15 15:21:38,441 INFO L290 TraceCheckUtils]: 129: Hoare triple {164275#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164250#(< ~counter~0 48)} is VALID [2022-04-15 15:21:38,442 INFO L290 TraceCheckUtils]: 128: Hoare triple {164275#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164275#(< ~counter~0 47)} is VALID [2022-04-15 15:21:38,442 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {163686#true} {164275#(< ~counter~0 47)} #96#return; {164275#(< ~counter~0 47)} is VALID [2022-04-15 15:21:38,442 INFO L290 TraceCheckUtils]: 126: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,442 INFO L290 TraceCheckUtils]: 125: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,442 INFO L290 TraceCheckUtils]: 124: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,442 INFO L272 TraceCheckUtils]: 123: Hoare triple {164275#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:21:38,443 INFO L290 TraceCheckUtils]: 122: Hoare triple {164275#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {164275#(< ~counter~0 47)} is VALID [2022-04-15 15:21:38,444 INFO L290 TraceCheckUtils]: 121: Hoare triple {164300#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164275#(< ~counter~0 47)} is VALID [2022-04-15 15:21:38,444 INFO L290 TraceCheckUtils]: 120: Hoare triple {164300#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164300#(< ~counter~0 46)} is VALID [2022-04-15 15:21:38,445 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {163686#true} {164300#(< ~counter~0 46)} #96#return; {164300#(< ~counter~0 46)} is VALID [2022-04-15 15:21:38,445 INFO L290 TraceCheckUtils]: 118: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,445 INFO L290 TraceCheckUtils]: 117: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,445 INFO L290 TraceCheckUtils]: 116: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,445 INFO L272 TraceCheckUtils]: 115: Hoare triple {164300#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:21:38,445 INFO L290 TraceCheckUtils]: 114: Hoare triple {164300#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {164300#(< ~counter~0 46)} is VALID [2022-04-15 15:21:38,446 INFO L290 TraceCheckUtils]: 113: Hoare triple {164325#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164300#(< ~counter~0 46)} is VALID [2022-04-15 15:21:38,447 INFO L290 TraceCheckUtils]: 112: Hoare triple {164325#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164325#(< ~counter~0 45)} is VALID [2022-04-15 15:21:38,447 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {163686#true} {164325#(< ~counter~0 45)} #96#return; {164325#(< ~counter~0 45)} is VALID [2022-04-15 15:21:38,447 INFO L290 TraceCheckUtils]: 110: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,447 INFO L290 TraceCheckUtils]: 109: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,447 INFO L290 TraceCheckUtils]: 108: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,448 INFO L272 TraceCheckUtils]: 107: Hoare triple {164325#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:21:38,448 INFO L290 TraceCheckUtils]: 106: Hoare triple {164325#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {164325#(< ~counter~0 45)} is VALID [2022-04-15 15:21:38,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {164350#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164325#(< ~counter~0 45)} is VALID [2022-04-15 15:21:38,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {164350#(< ~counter~0 44)} assume !!(0 != ~r~0); {164350#(< ~counter~0 44)} is VALID [2022-04-15 15:21:38,450 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {163686#true} {164350#(< ~counter~0 44)} #94#return; {164350#(< ~counter~0 44)} is VALID [2022-04-15 15:21:38,450 INFO L290 TraceCheckUtils]: 102: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,450 INFO L290 TraceCheckUtils]: 101: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,450 INFO L272 TraceCheckUtils]: 99: Hoare triple {164350#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:21:38,450 INFO L290 TraceCheckUtils]: 98: Hoare triple {164350#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {164350#(< ~counter~0 44)} is VALID [2022-04-15 15:21:38,452 INFO L290 TraceCheckUtils]: 97: Hoare triple {164375#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164350#(< ~counter~0 44)} is VALID [2022-04-15 15:21:38,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {164375#(< ~counter~0 43)} assume !(~r~0 < 0); {164375#(< ~counter~0 43)} is VALID [2022-04-15 15:21:38,452 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {163686#true} {164375#(< ~counter~0 43)} #98#return; {164375#(< ~counter~0 43)} is VALID [2022-04-15 15:21:38,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,453 INFO L272 TraceCheckUtils]: 91: Hoare triple {164375#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:21:38,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {164375#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {164375#(< ~counter~0 43)} is VALID [2022-04-15 15:21:38,454 INFO L290 TraceCheckUtils]: 89: Hoare triple {164400#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164375#(< ~counter~0 43)} is VALID [2022-04-15 15:21:38,454 INFO L290 TraceCheckUtils]: 88: Hoare triple {164400#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164400#(< ~counter~0 42)} is VALID [2022-04-15 15:21:38,455 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {163686#true} {164400#(< ~counter~0 42)} #98#return; {164400#(< ~counter~0 42)} is VALID [2022-04-15 15:21:38,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,455 INFO L290 TraceCheckUtils]: 85: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,455 INFO L272 TraceCheckUtils]: 83: Hoare triple {164400#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:21:38,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {164400#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {164400#(< ~counter~0 42)} is VALID [2022-04-15 15:21:38,457 INFO L290 TraceCheckUtils]: 81: Hoare triple {164425#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164400#(< ~counter~0 42)} is VALID [2022-04-15 15:21:38,457 INFO L290 TraceCheckUtils]: 80: Hoare triple {164425#(< ~counter~0 41)} assume !(~r~0 > 0); {164425#(< ~counter~0 41)} is VALID [2022-04-15 15:21:38,457 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {163686#true} {164425#(< ~counter~0 41)} #96#return; {164425#(< ~counter~0 41)} is VALID [2022-04-15 15:21:38,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,458 INFO L290 TraceCheckUtils]: 76: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,458 INFO L272 TraceCheckUtils]: 75: Hoare triple {164425#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:21:38,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {164425#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {164425#(< ~counter~0 41)} is VALID [2022-04-15 15:21:38,459 INFO L290 TraceCheckUtils]: 73: Hoare triple {164450#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164425#(< ~counter~0 41)} is VALID [2022-04-15 15:21:38,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {164450#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164450#(< ~counter~0 40)} is VALID [2022-04-15 15:21:38,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {163686#true} {164450#(< ~counter~0 40)} #96#return; {164450#(< ~counter~0 40)} is VALID [2022-04-15 15:21:38,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,460 INFO L290 TraceCheckUtils]: 68: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,460 INFO L272 TraceCheckUtils]: 67: Hoare triple {164450#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:21:38,461 INFO L290 TraceCheckUtils]: 66: Hoare triple {164450#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {164450#(< ~counter~0 40)} is VALID [2022-04-15 15:21:38,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {164475#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164450#(< ~counter~0 40)} is VALID [2022-04-15 15:21:38,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {164475#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164475#(< ~counter~0 39)} is VALID [2022-04-15 15:21:38,463 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {163686#true} {164475#(< ~counter~0 39)} #96#return; {164475#(< ~counter~0 39)} is VALID [2022-04-15 15:21:38,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,463 INFO L272 TraceCheckUtils]: 59: Hoare triple {164475#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:21:38,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {164475#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {164475#(< ~counter~0 39)} is VALID [2022-04-15 15:21:38,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {164500#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164475#(< ~counter~0 39)} is VALID [2022-04-15 15:21:38,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {164500#(< ~counter~0 38)} assume !!(0 != ~r~0); {164500#(< ~counter~0 38)} is VALID [2022-04-15 15:21:38,465 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {163686#true} {164500#(< ~counter~0 38)} #94#return; {164500#(< ~counter~0 38)} is VALID [2022-04-15 15:21:38,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,466 INFO L272 TraceCheckUtils]: 51: Hoare triple {164500#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:21:38,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {164500#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {164500#(< ~counter~0 38)} is VALID [2022-04-15 15:21:38,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {164525#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164500#(< ~counter~0 38)} is VALID [2022-04-15 15:21:38,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {164525#(< ~counter~0 37)} assume !(~r~0 < 0); {164525#(< ~counter~0 37)} is VALID [2022-04-15 15:21:38,468 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {163686#true} {164525#(< ~counter~0 37)} #98#return; {164525#(< ~counter~0 37)} is VALID [2022-04-15 15:21:38,468 INFO L290 TraceCheckUtils]: 46: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,468 INFO L272 TraceCheckUtils]: 43: Hoare triple {164525#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:21:38,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {164525#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {164525#(< ~counter~0 37)} is VALID [2022-04-15 15:21:38,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {164550#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164525#(< ~counter~0 37)} is VALID [2022-04-15 15:21:38,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {164550#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164550#(< ~counter~0 36)} is VALID [2022-04-15 15:21:38,470 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {163686#true} {164550#(< ~counter~0 36)} #98#return; {164550#(< ~counter~0 36)} is VALID [2022-04-15 15:21:38,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,471 INFO L272 TraceCheckUtils]: 35: Hoare triple {164550#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:21:38,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {164550#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {164550#(< ~counter~0 36)} is VALID [2022-04-15 15:21:38,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {164575#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164550#(< ~counter~0 36)} is VALID [2022-04-15 15:21:38,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {164575#(< ~counter~0 35)} assume !(~r~0 > 0); {164575#(< ~counter~0 35)} is VALID [2022-04-15 15:21:38,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {163686#true} {164575#(< ~counter~0 35)} #96#return; {164575#(< ~counter~0 35)} is VALID [2022-04-15 15:21:38,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,473 INFO L272 TraceCheckUtils]: 27: Hoare triple {164575#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:21:38,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {164575#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {164575#(< ~counter~0 35)} is VALID [2022-04-15 15:21:38,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {164600#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164575#(< ~counter~0 35)} is VALID [2022-04-15 15:21:38,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {164600#(< ~counter~0 34)} assume !!(0 != ~r~0); {164600#(< ~counter~0 34)} is VALID [2022-04-15 15:21:38,475 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {163686#true} {164600#(< ~counter~0 34)} #94#return; {164600#(< ~counter~0 34)} is VALID [2022-04-15 15:21:38,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {164600#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:21:38,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {164600#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {164600#(< ~counter~0 34)} is VALID [2022-04-15 15:21:38,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {164625#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164600#(< ~counter~0 34)} is VALID [2022-04-15 15:21:38,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {164625#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,478 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {163686#true} {164625#(< ~counter~0 33)} #92#return; {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {164625#(< ~counter~0 33)} call assume_abort_if_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-15 15:21:38,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163686#true} {164625#(< ~counter~0 33)} #90#return; {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {163686#true} assume true; {163686#true} is VALID [2022-04-15 15:21:38,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {163686#true} assume !(0 == ~cond); {163686#true} is VALID [2022-04-15 15:21:38,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {163686#true} ~cond := #in~cond; {163686#true} is VALID [2022-04-15 15:21:38,479 INFO L272 TraceCheckUtils]: 6: Hoare triple {164625#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {163686#true} is VALID [2022-04-15 15:21:38,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {164625#(< ~counter~0 33)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 33)} is VALID [2022-04-15 15:21:38,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {164625#(< ~counter~0 33)} call #t~ret9 := main(); {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164625#(< ~counter~0 33)} {163686#true} #102#return; {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {164625#(< ~counter~0 33)} assume true; {164625#(< ~counter~0 33)} is VALID [2022-04-15 15:21:38,481 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 33)} is VALID [2022-04-15 15:21:38,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {163686#true} call ULTIMATE.init(); {163686#true} is VALID [2022-04-15 15:21:38,481 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-15 15:21:38,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:38,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010751643] [2022-04-15 15:21:38,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:38,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771092674] [2022-04-15 15:21:38,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771092674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:38,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:38,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:21:38,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:38,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122242687] [2022-04-15 15:21:38,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122242687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:38,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:38,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:21:38,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878735115] [2022-04-15 15:21:38,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:38,482 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-15 15:21:38,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:38,483 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-15 15:21:38,657 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-15 15:21:38,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:21:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:21:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:21:38,658 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-15 15:21:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:44,237 INFO L93 Difference]: Finished difference Result 902 states and 1201 transitions. [2022-04-15 15:21:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 15:21:44,237 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-15 15:21:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:44,238 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-15 15:21:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-15 15:21:44,240 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-15 15:21:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-15 15:21:44,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-15 15:21:44,678 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-15 15:21:44,711 INFO L225 Difference]: With dead ends: 902 [2022-04-15 15:21:44,711 INFO L226 Difference]: Without dead ends: 897 [2022-04-15 15:21:44,711 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-15 15:21:44,712 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-15 15:21:44,712 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-15 15:21:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-15 15:21:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2022-04-15 15:21:47,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:47,989 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-15 15:21:47,989 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-15 15:21:47,990 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-15 15:21:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:48,014 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-15 15:21:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-15 15:21:48,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:48,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:48,016 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-15 15:21:48,016 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-15 15:21:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:48,041 INFO L93 Difference]: Finished difference Result 897 states and 1195 transitions. [2022-04-15 15:21:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1195 transitions. [2022-04-15 15:21:48,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:48,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:48,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:48,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:48,042 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-15 15:21:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1169 transitions. [2022-04-15 15:21:48,085 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1169 transitions. Word has length 159 [2022-04-15 15:21:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:48,085 INFO L478 AbstractCegarLoop]: Abstraction has 875 states and 1169 transitions. [2022-04-15 15:21:48,085 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-15 15:21:48,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 875 states and 1169 transitions. [2022-04-15 15:21:56,246 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-15 15:21:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1169 transitions. [2022-04-15 15:21:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 15:21:56,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:56,248 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-15 15:21:56,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:56,448 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-15 15:21:56,449 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-15 15:21:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:56,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [940673438] [2022-04-15 15:21:56,449 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-15 15:21:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:56,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697770627] [2022-04-15 15:21:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:56,475 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:56,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027660301] [2022-04-15 15:21:56,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:21:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:56,477 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-15 15:21:56,480 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-15 15:21:57,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:21:57,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:57,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:21:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:57,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:58,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {170055#true} call ULTIMATE.init(); {170055#true} is VALID [2022-04-15 15:21:58,412 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-15 15:21:58,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170063#(<= ~counter~0 0)} {170055#true} #102#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {170063#(<= ~counter~0 0)} call #t~ret9 := main(); {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,413 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-15 15:21:58,414 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-15 15:21:58,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {170063#(<= ~counter~0 0)} ~cond := #in~cond; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {170063#(<= ~counter~0 0)} assume !(0 == ~cond); {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170063#(<= ~counter~0 0)} {170063#(<= ~counter~0 0)} #90#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,416 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-15 15:21:58,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {170063#(<= ~counter~0 0)} ~cond := #in~cond; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {170063#(<= ~counter~0 0)} assume !(0 == ~cond); {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {170063#(<= ~counter~0 0)} assume true; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,417 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {170063#(<= ~counter~0 0)} {170063#(<= ~counter~0 0)} #92#return; {170063#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:58,417 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-15 15:21:58,420 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-15 15:21:58,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {170112#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,421 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-15 15:21:58,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {170112#(<= ~counter~0 1)} ~cond := #in~cond; {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {170112#(<= ~counter~0 1)} assume !(0 == ~cond); {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {170112#(<= ~counter~0 1)} assume true; {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,422 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {170112#(<= ~counter~0 1)} {170112#(<= ~counter~0 1)} #94#return; {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {170112#(<= ~counter~0 1)} assume !!(0 != ~r~0); {170112#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:58,424 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-15 15:21:58,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {170137#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,425 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-15 15:21:58,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {170137#(<= ~counter~0 2)} ~cond := #in~cond; {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {170137#(<= ~counter~0 2)} assume !(0 == ~cond); {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {170137#(<= ~counter~0 2)} assume true; {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,426 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {170137#(<= ~counter~0 2)} {170137#(<= ~counter~0 2)} #96#return; {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {170137#(<= ~counter~0 2)} assume !(~r~0 > 0); {170137#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:58,428 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-15 15:21:58,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {170162#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {170162#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:58,429 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-15 15:21:58,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {170162#(<= ~counter~0 3)} ~cond := #in~cond; {170162#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:58,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {170162#(<= ~counter~0 3)} assume !(0 == ~cond); {170162#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:58,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {170162#(<= ~counter~0 3)} assume true; {170162#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:58,430 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {170162#(<= ~counter~0 3)} {170162#(<= ~counter~0 3)} #98#return; {170162#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:58,430 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-15 15:21:58,432 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-15 15:21:58,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {170187#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,432 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-15 15:21:58,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {170187#(<= ~counter~0 4)} ~cond := #in~cond; {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {170187#(<= ~counter~0 4)} assume !(0 == ~cond); {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {170187#(<= ~counter~0 4)} assume true; {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,434 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {170187#(<= ~counter~0 4)} {170187#(<= ~counter~0 4)} #98#return; {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {170187#(<= ~counter~0 4)} assume !(~r~0 < 0); {170187#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:58,435 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-15 15:21:58,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {170212#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,436 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-15 15:21:58,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {170212#(<= ~counter~0 5)} ~cond := #in~cond; {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {170212#(<= ~counter~0 5)} assume !(0 == ~cond); {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {170212#(<= ~counter~0 5)} assume true; {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,437 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {170212#(<= ~counter~0 5)} {170212#(<= ~counter~0 5)} #94#return; {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {170212#(<= ~counter~0 5)} assume !!(0 != ~r~0); {170212#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:58,439 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-15 15:21:58,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {170237#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {170237#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:58,440 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-15 15:21:58,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {170237#(<= ~counter~0 6)} ~cond := #in~cond; {170237#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:58,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {170237#(<= ~counter~0 6)} assume !(0 == ~cond); {170237#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:58,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {170237#(<= ~counter~0 6)} assume true; {170237#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:58,442 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {170237#(<= ~counter~0 6)} {170237#(<= ~counter~0 6)} #96#return; {170237#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:58,442 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-15 15:21:58,443 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-15 15:21:58,444 INFO L290 TraceCheckUtils]: 66: Hoare triple {170262#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {170262#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:58,444 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-15 15:21:58,444 INFO L290 TraceCheckUtils]: 68: Hoare triple {170262#(<= ~counter~0 7)} ~cond := #in~cond; {170262#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:58,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {170262#(<= ~counter~0 7)} assume !(0 == ~cond); {170262#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:58,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {170262#(<= ~counter~0 7)} assume true; {170262#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:58,445 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {170262#(<= ~counter~0 7)} {170262#(<= ~counter~0 7)} #96#return; {170262#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:58,446 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-15 15:21:58,447 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-15 15:21:58,447 INFO L290 TraceCheckUtils]: 74: Hoare triple {170287#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,448 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-15 15:21:58,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {170287#(<= ~counter~0 8)} ~cond := #in~cond; {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {170287#(<= ~counter~0 8)} assume !(0 == ~cond); {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,449 INFO L290 TraceCheckUtils]: 78: Hoare triple {170287#(<= ~counter~0 8)} assume true; {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,449 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {170287#(<= ~counter~0 8)} {170287#(<= ~counter~0 8)} #96#return; {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {170287#(<= ~counter~0 8)} assume !(~r~0 > 0); {170287#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:58,451 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-15 15:21:58,451 INFO L290 TraceCheckUtils]: 82: Hoare triple {170312#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {170312#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:58,452 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-15 15:21:58,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {170312#(<= ~counter~0 9)} ~cond := #in~cond; {170312#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:58,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {170312#(<= ~counter~0 9)} assume !(0 == ~cond); {170312#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:58,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {170312#(<= ~counter~0 9)} assume true; {170312#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:58,453 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {170312#(<= ~counter~0 9)} {170312#(<= ~counter~0 9)} #98#return; {170312#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:58,453 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-15 15:21:58,454 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-15 15:21:58,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {170337#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,455 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-15 15:21:58,456 INFO L290 TraceCheckUtils]: 92: Hoare triple {170337#(<= ~counter~0 10)} ~cond := #in~cond; {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,456 INFO L290 TraceCheckUtils]: 93: Hoare triple {170337#(<= ~counter~0 10)} assume !(0 == ~cond); {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,456 INFO L290 TraceCheckUtils]: 94: Hoare triple {170337#(<= ~counter~0 10)} assume true; {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,457 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {170337#(<= ~counter~0 10)} {170337#(<= ~counter~0 10)} #98#return; {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,457 INFO L290 TraceCheckUtils]: 96: Hoare triple {170337#(<= ~counter~0 10)} assume !(~r~0 < 0); {170337#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:58,458 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-15 15:21:58,459 INFO L290 TraceCheckUtils]: 98: Hoare triple {170362#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,459 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-15 15:21:58,459 INFO L290 TraceCheckUtils]: 100: Hoare triple {170362#(<= ~counter~0 11)} ~cond := #in~cond; {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,460 INFO L290 TraceCheckUtils]: 101: Hoare triple {170362#(<= ~counter~0 11)} assume !(0 == ~cond); {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,460 INFO L290 TraceCheckUtils]: 102: Hoare triple {170362#(<= ~counter~0 11)} assume true; {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,460 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {170362#(<= ~counter~0 11)} {170362#(<= ~counter~0 11)} #94#return; {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,461 INFO L290 TraceCheckUtils]: 104: Hoare triple {170362#(<= ~counter~0 11)} assume !!(0 != ~r~0); {170362#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:58,462 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-15 15:21:58,462 INFO L290 TraceCheckUtils]: 106: Hoare triple {170387#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {170387#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:58,463 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-15 15:21:58,463 INFO L290 TraceCheckUtils]: 108: Hoare triple {170387#(<= ~counter~0 12)} ~cond := #in~cond; {170387#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:58,463 INFO L290 TraceCheckUtils]: 109: Hoare triple {170387#(<= ~counter~0 12)} assume !(0 == ~cond); {170387#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:58,464 INFO L290 TraceCheckUtils]: 110: Hoare triple {170387#(<= ~counter~0 12)} assume true; {170387#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:58,464 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {170387#(<= ~counter~0 12)} {170387#(<= ~counter~0 12)} #96#return; {170387#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:58,465 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-15 15:21:58,466 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-15 15:21:58,466 INFO L290 TraceCheckUtils]: 114: Hoare triple {170412#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {170412#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:58,467 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-15 15:21:58,467 INFO L290 TraceCheckUtils]: 116: Hoare triple {170412#(<= ~counter~0 13)} ~cond := #in~cond; {170412#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:58,467 INFO L290 TraceCheckUtils]: 117: Hoare triple {170412#(<= ~counter~0 13)} assume !(0 == ~cond); {170412#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:58,467 INFO L290 TraceCheckUtils]: 118: Hoare triple {170412#(<= ~counter~0 13)} assume true; {170412#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:58,468 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {170412#(<= ~counter~0 13)} {170412#(<= ~counter~0 13)} #96#return; {170412#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:58,468 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-15 15:21:58,470 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-15 15:21:58,470 INFO L290 TraceCheckUtils]: 122: Hoare triple {170437#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {170437#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:58,470 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-15 15:21:58,471 INFO L290 TraceCheckUtils]: 124: Hoare triple {170437#(<= ~counter~0 14)} ~cond := #in~cond; {170437#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:58,471 INFO L290 TraceCheckUtils]: 125: Hoare triple {170437#(<= ~counter~0 14)} assume !(0 == ~cond); {170437#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:58,471 INFO L290 TraceCheckUtils]: 126: Hoare triple {170437#(<= ~counter~0 14)} assume true; {170437#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:58,472 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170437#(<= ~counter~0 14)} {170437#(<= ~counter~0 14)} #96#return; {170437#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:58,472 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-15 15:21:58,473 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-15 15:21:58,474 INFO L290 TraceCheckUtils]: 130: Hoare triple {170462#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {170462#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:58,474 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-15 15:21:58,474 INFO L290 TraceCheckUtils]: 132: Hoare triple {170462#(<= ~counter~0 15)} ~cond := #in~cond; {170462#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:58,475 INFO L290 TraceCheckUtils]: 133: Hoare triple {170462#(<= ~counter~0 15)} assume !(0 == ~cond); {170462#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:58,475 INFO L290 TraceCheckUtils]: 134: Hoare triple {170462#(<= ~counter~0 15)} assume true; {170462#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:58,475 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170462#(<= ~counter~0 15)} {170462#(<= ~counter~0 15)} #96#return; {170462#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:58,476 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-15 15:21:58,477 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-15 15:21:58,477 INFO L290 TraceCheckUtils]: 138: Hoare triple {170487#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,478 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-15 15:21:58,478 INFO L290 TraceCheckUtils]: 140: Hoare triple {170487#(<= ~counter~0 16)} ~cond := #in~cond; {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,478 INFO L290 TraceCheckUtils]: 141: Hoare triple {170487#(<= ~counter~0 16)} assume !(0 == ~cond); {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,479 INFO L290 TraceCheckUtils]: 142: Hoare triple {170487#(<= ~counter~0 16)} assume true; {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,479 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170487#(<= ~counter~0 16)} {170487#(<= ~counter~0 16)} #96#return; {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,479 INFO L290 TraceCheckUtils]: 144: Hoare triple {170487#(<= ~counter~0 16)} assume !(~r~0 > 0); {170487#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:58,481 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-15 15:21:58,481 INFO L290 TraceCheckUtils]: 146: Hoare triple {170512#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {170512#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:58,482 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-15 15:21:58,482 INFO L290 TraceCheckUtils]: 148: Hoare triple {170512#(<= ~counter~0 17)} ~cond := #in~cond; {170512#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:58,482 INFO L290 TraceCheckUtils]: 149: Hoare triple {170512#(<= ~counter~0 17)} assume !(0 == ~cond); {170512#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:58,482 INFO L290 TraceCheckUtils]: 150: Hoare triple {170512#(<= ~counter~0 17)} assume true; {170512#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:58,483 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170512#(<= ~counter~0 17)} {170512#(<= ~counter~0 17)} #98#return; {170512#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:58,483 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-15 15:21:58,484 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-15 15:21:58,484 INFO L290 TraceCheckUtils]: 154: Hoare triple {170537#(<= |main_#t~post8| 17)} assume !(#t~post8 < 50);havoc #t~post8; {170056#false} is VALID [2022-04-15 15:21:58,484 INFO L290 TraceCheckUtils]: 155: Hoare triple {170056#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170056#false} is VALID [2022-04-15 15:21:58,484 INFO L290 TraceCheckUtils]: 156: Hoare triple {170056#false} assume !(#t~post6 < 50);havoc #t~post6; {170056#false} is VALID [2022-04-15 15:21:58,484 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-15 15:21:58,484 INFO L290 TraceCheckUtils]: 158: Hoare triple {170056#false} ~cond := #in~cond; {170056#false} is VALID [2022-04-15 15:21:58,484 INFO L290 TraceCheckUtils]: 159: Hoare triple {170056#false} assume 0 == ~cond; {170056#false} is VALID [2022-04-15 15:21:58,484 INFO L290 TraceCheckUtils]: 160: Hoare triple {170056#false} assume !false; {170056#false} is VALID [2022-04-15 15:21:58,485 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-15 15:21:58,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:59,519 INFO L290 TraceCheckUtils]: 160: Hoare triple {170056#false} assume !false; {170056#false} is VALID [2022-04-15 15:21:59,519 INFO L290 TraceCheckUtils]: 159: Hoare triple {170056#false} assume 0 == ~cond; {170056#false} is VALID [2022-04-15 15:21:59,519 INFO L290 TraceCheckUtils]: 158: Hoare triple {170056#false} ~cond := #in~cond; {170056#false} is VALID [2022-04-15 15:21:59,519 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-15 15:21:59,519 INFO L290 TraceCheckUtils]: 156: Hoare triple {170056#false} assume !(#t~post6 < 50);havoc #t~post6; {170056#false} is VALID [2022-04-15 15:21:59,519 INFO L290 TraceCheckUtils]: 155: Hoare triple {170056#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170056#false} is VALID [2022-04-15 15:21:59,519 INFO L290 TraceCheckUtils]: 154: Hoare triple {170577#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {170056#false} is VALID [2022-04-15 15:21:59,520 INFO L290 TraceCheckUtils]: 153: Hoare triple {170581#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170577#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:21:59,520 INFO L290 TraceCheckUtils]: 152: Hoare triple {170581#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170581#(< ~counter~0 50)} is VALID [2022-04-15 15:21:59,521 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {170055#true} {170581#(< ~counter~0 50)} #98#return; {170581#(< ~counter~0 50)} is VALID [2022-04-15 15:21:59,521 INFO L290 TraceCheckUtils]: 150: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,521 INFO L290 TraceCheckUtils]: 149: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,521 INFO L290 TraceCheckUtils]: 148: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,521 INFO L272 TraceCheckUtils]: 147: Hoare triple {170581#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:21:59,521 INFO L290 TraceCheckUtils]: 146: Hoare triple {170581#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {170581#(< ~counter~0 50)} is VALID [2022-04-15 15:21:59,525 INFO L290 TraceCheckUtils]: 145: Hoare triple {170606#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170581#(< ~counter~0 50)} is VALID [2022-04-15 15:21:59,525 INFO L290 TraceCheckUtils]: 144: Hoare triple {170606#(< ~counter~0 49)} assume !(~r~0 > 0); {170606#(< ~counter~0 49)} is VALID [2022-04-15 15:21:59,525 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {170055#true} {170606#(< ~counter~0 49)} #96#return; {170606#(< ~counter~0 49)} is VALID [2022-04-15 15:21:59,525 INFO L290 TraceCheckUtils]: 142: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,526 INFO L290 TraceCheckUtils]: 141: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,526 INFO L290 TraceCheckUtils]: 140: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,526 INFO L272 TraceCheckUtils]: 139: Hoare triple {170606#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:21:59,526 INFO L290 TraceCheckUtils]: 138: Hoare triple {170606#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {170606#(< ~counter~0 49)} is VALID [2022-04-15 15:21:59,527 INFO L290 TraceCheckUtils]: 137: Hoare triple {170631#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170606#(< ~counter~0 49)} is VALID [2022-04-15 15:21:59,528 INFO L290 TraceCheckUtils]: 136: Hoare triple {170631#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170631#(< ~counter~0 48)} is VALID [2022-04-15 15:21:59,528 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {170055#true} {170631#(< ~counter~0 48)} #96#return; {170631#(< ~counter~0 48)} is VALID [2022-04-15 15:21:59,528 INFO L290 TraceCheckUtils]: 134: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,528 INFO L290 TraceCheckUtils]: 133: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,528 INFO L290 TraceCheckUtils]: 132: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,528 INFO L272 TraceCheckUtils]: 131: Hoare triple {170631#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:21:59,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {170631#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {170631#(< ~counter~0 48)} is VALID [2022-04-15 15:21:59,530 INFO L290 TraceCheckUtils]: 129: Hoare triple {170656#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170631#(< ~counter~0 48)} is VALID [2022-04-15 15:21:59,530 INFO L290 TraceCheckUtils]: 128: Hoare triple {170656#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170656#(< ~counter~0 47)} is VALID [2022-04-15 15:21:59,531 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {170055#true} {170656#(< ~counter~0 47)} #96#return; {170656#(< ~counter~0 47)} is VALID [2022-04-15 15:21:59,531 INFO L290 TraceCheckUtils]: 126: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,531 INFO L290 TraceCheckUtils]: 125: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,531 INFO L290 TraceCheckUtils]: 124: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,531 INFO L272 TraceCheckUtils]: 123: Hoare triple {170656#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:21:59,531 INFO L290 TraceCheckUtils]: 122: Hoare triple {170656#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {170656#(< ~counter~0 47)} is VALID [2022-04-15 15:21:59,532 INFO L290 TraceCheckUtils]: 121: Hoare triple {170681#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170656#(< ~counter~0 47)} is VALID [2022-04-15 15:21:59,533 INFO L290 TraceCheckUtils]: 120: Hoare triple {170681#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170681#(< ~counter~0 46)} is VALID [2022-04-15 15:21:59,533 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {170055#true} {170681#(< ~counter~0 46)} #96#return; {170681#(< ~counter~0 46)} is VALID [2022-04-15 15:21:59,533 INFO L290 TraceCheckUtils]: 118: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,533 INFO L272 TraceCheckUtils]: 115: Hoare triple {170681#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:21:59,534 INFO L290 TraceCheckUtils]: 114: Hoare triple {170681#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {170681#(< ~counter~0 46)} is VALID [2022-04-15 15:21:59,535 INFO L290 TraceCheckUtils]: 113: Hoare triple {170706#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170681#(< ~counter~0 46)} is VALID [2022-04-15 15:21:59,535 INFO L290 TraceCheckUtils]: 112: Hoare triple {170706#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170706#(< ~counter~0 45)} is VALID [2022-04-15 15:21:59,536 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {170055#true} {170706#(< ~counter~0 45)} #96#return; {170706#(< ~counter~0 45)} is VALID [2022-04-15 15:21:59,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,536 INFO L272 TraceCheckUtils]: 107: Hoare triple {170706#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:21:59,536 INFO L290 TraceCheckUtils]: 106: Hoare triple {170706#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {170706#(< ~counter~0 45)} is VALID [2022-04-15 15:21:59,538 INFO L290 TraceCheckUtils]: 105: Hoare triple {170731#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170706#(< ~counter~0 45)} is VALID [2022-04-15 15:21:59,538 INFO L290 TraceCheckUtils]: 104: Hoare triple {170731#(< ~counter~0 44)} assume !!(0 != ~r~0); {170731#(< ~counter~0 44)} is VALID [2022-04-15 15:21:59,538 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {170055#true} {170731#(< ~counter~0 44)} #94#return; {170731#(< ~counter~0 44)} is VALID [2022-04-15 15:21:59,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,539 INFO L272 TraceCheckUtils]: 99: Hoare triple {170731#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:21:59,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {170731#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {170731#(< ~counter~0 44)} is VALID [2022-04-15 15:21:59,540 INFO L290 TraceCheckUtils]: 97: Hoare triple {170756#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170731#(< ~counter~0 44)} is VALID [2022-04-15 15:21:59,541 INFO L290 TraceCheckUtils]: 96: Hoare triple {170756#(< ~counter~0 43)} assume !(~r~0 < 0); {170756#(< ~counter~0 43)} is VALID [2022-04-15 15:21:59,541 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {170055#true} {170756#(< ~counter~0 43)} #98#return; {170756#(< ~counter~0 43)} is VALID [2022-04-15 15:21:59,541 INFO L290 TraceCheckUtils]: 94: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,541 INFO L290 TraceCheckUtils]: 93: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,541 INFO L290 TraceCheckUtils]: 92: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,541 INFO L272 TraceCheckUtils]: 91: Hoare triple {170756#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:21:59,542 INFO L290 TraceCheckUtils]: 90: Hoare triple {170756#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {170756#(< ~counter~0 43)} is VALID [2022-04-15 15:21:59,543 INFO L290 TraceCheckUtils]: 89: Hoare triple {170781#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170756#(< ~counter~0 43)} is VALID [2022-04-15 15:21:59,543 INFO L290 TraceCheckUtils]: 88: Hoare triple {170781#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170781#(< ~counter~0 42)} is VALID [2022-04-15 15:21:59,544 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {170055#true} {170781#(< ~counter~0 42)} #98#return; {170781#(< ~counter~0 42)} is VALID [2022-04-15 15:21:59,544 INFO L290 TraceCheckUtils]: 86: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,544 INFO L290 TraceCheckUtils]: 85: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,544 INFO L290 TraceCheckUtils]: 84: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,544 INFO L272 TraceCheckUtils]: 83: Hoare triple {170781#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:21:59,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {170781#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {170781#(< ~counter~0 42)} is VALID [2022-04-15 15:21:59,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {170806#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170781#(< ~counter~0 42)} is VALID [2022-04-15 15:21:59,546 INFO L290 TraceCheckUtils]: 80: Hoare triple {170806#(< ~counter~0 41)} assume !(~r~0 > 0); {170806#(< ~counter~0 41)} is VALID [2022-04-15 15:21:59,546 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {170055#true} {170806#(< ~counter~0 41)} #96#return; {170806#(< ~counter~0 41)} is VALID [2022-04-15 15:21:59,546 INFO L290 TraceCheckUtils]: 78: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,546 INFO L290 TraceCheckUtils]: 77: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,546 INFO L290 TraceCheckUtils]: 76: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,547 INFO L272 TraceCheckUtils]: 75: Hoare triple {170806#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:21:59,547 INFO L290 TraceCheckUtils]: 74: Hoare triple {170806#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {170806#(< ~counter~0 41)} is VALID [2022-04-15 15:21:59,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {170831#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170806#(< ~counter~0 41)} is VALID [2022-04-15 15:21:59,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {170831#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170831#(< ~counter~0 40)} is VALID [2022-04-15 15:21:59,549 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {170055#true} {170831#(< ~counter~0 40)} #96#return; {170831#(< ~counter~0 40)} is VALID [2022-04-15 15:21:59,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,549 INFO L272 TraceCheckUtils]: 67: Hoare triple {170831#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:21:59,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {170831#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {170831#(< ~counter~0 40)} is VALID [2022-04-15 15:21:59,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {170856#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170831#(< ~counter~0 40)} is VALID [2022-04-15 15:21:59,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {170856#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {170856#(< ~counter~0 39)} is VALID [2022-04-15 15:21:59,552 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {170055#true} {170856#(< ~counter~0 39)} #96#return; {170856#(< ~counter~0 39)} is VALID [2022-04-15 15:21:59,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,552 INFO L272 TraceCheckUtils]: 59: Hoare triple {170856#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:21:59,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {170856#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {170856#(< ~counter~0 39)} is VALID [2022-04-15 15:21:59,554 INFO L290 TraceCheckUtils]: 57: Hoare triple {170881#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170856#(< ~counter~0 39)} is VALID [2022-04-15 15:21:59,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {170881#(< ~counter~0 38)} assume !!(0 != ~r~0); {170881#(< ~counter~0 38)} is VALID [2022-04-15 15:21:59,555 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {170055#true} {170881#(< ~counter~0 38)} #94#return; {170881#(< ~counter~0 38)} is VALID [2022-04-15 15:21:59,555 INFO L290 TraceCheckUtils]: 54: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,555 INFO L272 TraceCheckUtils]: 51: Hoare triple {170881#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:21:59,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {170881#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {170881#(< ~counter~0 38)} is VALID [2022-04-15 15:21:59,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {170906#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170881#(< ~counter~0 38)} is VALID [2022-04-15 15:21:59,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {170906#(< ~counter~0 37)} assume !(~r~0 < 0); {170906#(< ~counter~0 37)} is VALID [2022-04-15 15:21:59,558 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {170055#true} {170906#(< ~counter~0 37)} #98#return; {170906#(< ~counter~0 37)} is VALID [2022-04-15 15:21:59,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,558 INFO L272 TraceCheckUtils]: 43: Hoare triple {170906#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:21:59,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {170906#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {170906#(< ~counter~0 37)} is VALID [2022-04-15 15:21:59,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {170931#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170906#(< ~counter~0 37)} is VALID [2022-04-15 15:21:59,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {170931#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {170931#(< ~counter~0 36)} is VALID [2022-04-15 15:21:59,561 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {170055#true} {170931#(< ~counter~0 36)} #98#return; {170931#(< ~counter~0 36)} is VALID [2022-04-15 15:21:59,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,561 INFO L272 TraceCheckUtils]: 35: Hoare triple {170931#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:21:59,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {170931#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {170931#(< ~counter~0 36)} is VALID [2022-04-15 15:21:59,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {170956#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {170931#(< ~counter~0 36)} is VALID [2022-04-15 15:21:59,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {170956#(< ~counter~0 35)} assume !(~r~0 > 0); {170956#(< ~counter~0 35)} is VALID [2022-04-15 15:21:59,564 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {170055#true} {170956#(< ~counter~0 35)} #96#return; {170956#(< ~counter~0 35)} is VALID [2022-04-15 15:21:59,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,564 INFO L272 TraceCheckUtils]: 27: Hoare triple {170956#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:21:59,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {170956#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {170956#(< ~counter~0 35)} is VALID [2022-04-15 15:21:59,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {170981#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {170956#(< ~counter~0 35)} is VALID [2022-04-15 15:21:59,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {170981#(< ~counter~0 34)} assume !!(0 != ~r~0); {170981#(< ~counter~0 34)} is VALID [2022-04-15 15:21:59,568 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {170055#true} {170981#(< ~counter~0 34)} #94#return; {170981#(< ~counter~0 34)} is VALID [2022-04-15 15:21:59,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,568 INFO L272 TraceCheckUtils]: 19: Hoare triple {170981#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:21:59,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {170981#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {170981#(< ~counter~0 34)} is VALID [2022-04-15 15:21:59,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {171006#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {170981#(< ~counter~0 34)} is VALID [2022-04-15 15:21:59,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {171006#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {170055#true} {171006#(< ~counter~0 33)} #92#return; {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {171006#(< ~counter~0 33)} call assume_abort_if_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-15 15:21:59,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170055#true} {171006#(< ~counter~0 33)} #90#return; {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {170055#true} assume true; {170055#true} is VALID [2022-04-15 15:21:59,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {170055#true} assume !(0 == ~cond); {170055#true} is VALID [2022-04-15 15:21:59,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {170055#true} ~cond := #in~cond; {170055#true} is VALID [2022-04-15 15:21:59,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {171006#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {170055#true} is VALID [2022-04-15 15:21:59,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {171006#(< ~counter~0 33)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 33)} is VALID [2022-04-15 15:21:59,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {171006#(< ~counter~0 33)} call #t~ret9 := main(); {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171006#(< ~counter~0 33)} {170055#true} #102#return; {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {171006#(< ~counter~0 33)} assume true; {171006#(< ~counter~0 33)} is VALID [2022-04-15 15:21:59,573 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 33)} is VALID [2022-04-15 15:21:59,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {170055#true} call ULTIMATE.init(); {170055#true} is VALID [2022-04-15 15:21:59,574 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-15 15:21:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:59,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697770627] [2022-04-15 15:21:59,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:59,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027660301] [2022-04-15 15:21:59,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027660301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:59,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:59,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:21:59,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:59,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [940673438] [2022-04-15 15:21:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [940673438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:59,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:59,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:21:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489912960] [2022-04-15 15:21:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:59,575 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-15 15:21:59,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:59,576 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-15 15:21:59,798 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-15 15:21:59,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:21:59,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:21:59,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:21:59,799 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-15 15:22:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:05,885 INFO L93 Difference]: Finished difference Result 1079 states and 1471 transitions. [2022-04-15 15:22:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 15:22:05,886 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-15 15:22:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:05,886 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-15 15:22:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-15 15:22:05,889 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-15 15:22:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-15 15:22:05,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-15 15:22:06,378 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-15 15:22:06,416 INFO L225 Difference]: With dead ends: 1079 [2022-04-15 15:22:06,416 INFO L226 Difference]: Without dead ends: 901 [2022-04-15 15:22:06,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1263, Invalid=1707, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 15:22:06,417 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 316 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:06,417 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.8s Time] [2022-04-15 15:22:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-15 15:22:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 890. [2022-04-15 15:22:09,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:09,916 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-15 15:22:09,917 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-15 15:22:09,917 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-15 15:22:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:09,942 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-15 15:22:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-15 15:22:09,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:09,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:09,943 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-15 15:22:09,944 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-15 15:22:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:09,968 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-15 15:22:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-15 15:22:09,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:09,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:09,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:09,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:09,970 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-15 15:22:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2022-04-15 15:22:10,004 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 161 [2022-04-15 15:22:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:10,004 INFO L478 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2022-04-15 15:22:10,004 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-15 15:22:10,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 890 states and 1187 transitions. [2022-04-15 15:22:22,214 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-15 15:22:22,214 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2022-04-15 15:22:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 15:22:22,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:22,216 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-15 15:22:22,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-15 15:22:22,422 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-15 15:22:22,422 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:22,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-15 15:22:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:22,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1093087295] [2022-04-15 15:22:22,423 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-15 15:22:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:22,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918742168] [2022-04-15 15:22:22,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:22,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:22,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455336489] [2022-04-15 15:22:22,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:22:22,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:22,438 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-15 15:22:22,439 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-15 15:22:22,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:22:22,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:22,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:22:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:22,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:22:23,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {176830#true} call ULTIMATE.init(); {176830#true} is VALID [2022-04-15 15:22:23,502 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-15 15:22:23,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176838#(<= ~counter~0 0)} {176830#true} #102#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {176838#(<= ~counter~0 0)} call #t~ret9 := main(); {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,504 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-15 15:22:23,504 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-15 15:22:23,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {176838#(<= ~counter~0 0)} ~cond := #in~cond; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {176838#(<= ~counter~0 0)} assume !(0 == ~cond); {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,505 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176838#(<= ~counter~0 0)} {176838#(<= ~counter~0 0)} #90#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,506 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-15 15:22:23,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {176838#(<= ~counter~0 0)} ~cond := #in~cond; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {176838#(<= ~counter~0 0)} assume !(0 == ~cond); {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {176838#(<= ~counter~0 0)} assume true; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,507 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176838#(<= ~counter~0 0)} {176838#(<= ~counter~0 0)} #92#return; {176838#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:23,507 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-15 15:22:23,510 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-15 15:22:23,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {176887#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,511 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-15 15:22:23,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {176887#(<= ~counter~0 1)} ~cond := #in~cond; {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {176887#(<= ~counter~0 1)} assume !(0 == ~cond); {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {176887#(<= ~counter~0 1)} assume true; {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,513 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176887#(<= ~counter~0 1)} {176887#(<= ~counter~0 1)} #94#return; {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {176887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176887#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:23,514 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-15 15:22:23,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {176912#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,515 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-15 15:22:23,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {176912#(<= ~counter~0 2)} ~cond := #in~cond; {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {176912#(<= ~counter~0 2)} assume !(0 == ~cond); {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {176912#(<= ~counter~0 2)} assume true; {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,516 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176912#(<= ~counter~0 2)} {176912#(<= ~counter~0 2)} #96#return; {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {176912#(<= ~counter~0 2)} assume !(~r~0 > 0); {176912#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:23,518 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-15 15:22:23,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {176937#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {176937#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:23,519 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-15 15:22:23,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {176937#(<= ~counter~0 3)} ~cond := #in~cond; {176937#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:23,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {176937#(<= ~counter~0 3)} assume !(0 == ~cond); {176937#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:23,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {176937#(<= ~counter~0 3)} assume true; {176937#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:23,520 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176937#(<= ~counter~0 3)} {176937#(<= ~counter~0 3)} #98#return; {176937#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:23,520 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-15 15:22:23,522 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-15 15:22:23,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {176962#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,522 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-15 15:22:23,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {176962#(<= ~counter~0 4)} ~cond := #in~cond; {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {176962#(<= ~counter~0 4)} assume !(0 == ~cond); {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {176962#(<= ~counter~0 4)} assume true; {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,524 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176962#(<= ~counter~0 4)} {176962#(<= ~counter~0 4)} #98#return; {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,524 INFO L290 TraceCheckUtils]: 48: Hoare triple {176962#(<= ~counter~0 4)} assume !(~r~0 < 0); {176962#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:23,525 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-15 15:22:23,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {176987#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,526 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-15 15:22:23,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {176987#(<= ~counter~0 5)} ~cond := #in~cond; {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {176987#(<= ~counter~0 5)} assume !(0 == ~cond); {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {176987#(<= ~counter~0 5)} assume true; {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,527 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176987#(<= ~counter~0 5)} {176987#(<= ~counter~0 5)} #94#return; {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {176987#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176987#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:23,529 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-15 15:22:23,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {177012#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {177012#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:23,530 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-15 15:22:23,530 INFO L290 TraceCheckUtils]: 60: Hoare triple {177012#(<= ~counter~0 6)} ~cond := #in~cond; {177012#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:23,530 INFO L290 TraceCheckUtils]: 61: Hoare triple {177012#(<= ~counter~0 6)} assume !(0 == ~cond); {177012#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:23,531 INFO L290 TraceCheckUtils]: 62: Hoare triple {177012#(<= ~counter~0 6)} assume true; {177012#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:23,531 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {177012#(<= ~counter~0 6)} {177012#(<= ~counter~0 6)} #96#return; {177012#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:23,531 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-15 15:22:23,533 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-15 15:22:23,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {177037#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {177037#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:23,533 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-15 15:22:23,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {177037#(<= ~counter~0 7)} ~cond := #in~cond; {177037#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:23,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {177037#(<= ~counter~0 7)} assume !(0 == ~cond); {177037#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:23,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {177037#(<= ~counter~0 7)} assume true; {177037#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:23,535 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {177037#(<= ~counter~0 7)} {177037#(<= ~counter~0 7)} #96#return; {177037#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:23,535 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-15 15:22:23,536 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-15 15:22:23,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {177062#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,537 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-15 15:22:23,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {177062#(<= ~counter~0 8)} ~cond := #in~cond; {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {177062#(<= ~counter~0 8)} assume !(0 == ~cond); {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {177062#(<= ~counter~0 8)} assume true; {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,539 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {177062#(<= ~counter~0 8)} {177062#(<= ~counter~0 8)} #96#return; {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,539 INFO L290 TraceCheckUtils]: 80: Hoare triple {177062#(<= ~counter~0 8)} assume !(~r~0 > 0); {177062#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:23,540 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-15 15:22:23,541 INFO L290 TraceCheckUtils]: 82: Hoare triple {177087#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {177087#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:23,541 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-15 15:22:23,541 INFO L290 TraceCheckUtils]: 84: Hoare triple {177087#(<= ~counter~0 9)} ~cond := #in~cond; {177087#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:23,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {177087#(<= ~counter~0 9)} assume !(0 == ~cond); {177087#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:23,542 INFO L290 TraceCheckUtils]: 86: Hoare triple {177087#(<= ~counter~0 9)} assume true; {177087#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:23,542 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {177087#(<= ~counter~0 9)} {177087#(<= ~counter~0 9)} #98#return; {177087#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:23,543 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-15 15:22:23,544 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-15 15:22:23,544 INFO L290 TraceCheckUtils]: 90: Hoare triple {177112#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,545 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-15 15:22:23,545 INFO L290 TraceCheckUtils]: 92: Hoare triple {177112#(<= ~counter~0 10)} ~cond := #in~cond; {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,545 INFO L290 TraceCheckUtils]: 93: Hoare triple {177112#(<= ~counter~0 10)} assume !(0 == ~cond); {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {177112#(<= ~counter~0 10)} assume true; {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,546 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {177112#(<= ~counter~0 10)} {177112#(<= ~counter~0 10)} #98#return; {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {177112#(<= ~counter~0 10)} assume !(~r~0 < 0); {177112#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:23,548 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-15 15:22:23,548 INFO L290 TraceCheckUtils]: 98: Hoare triple {177137#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,548 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-15 15:22:23,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {177137#(<= ~counter~0 11)} ~cond := #in~cond; {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,549 INFO L290 TraceCheckUtils]: 101: Hoare triple {177137#(<= ~counter~0 11)} assume !(0 == ~cond); {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,549 INFO L290 TraceCheckUtils]: 102: Hoare triple {177137#(<= ~counter~0 11)} assume true; {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,550 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {177137#(<= ~counter~0 11)} {177137#(<= ~counter~0 11)} #94#return; {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,550 INFO L290 TraceCheckUtils]: 104: Hoare triple {177137#(<= ~counter~0 11)} assume !!(0 != ~r~0); {177137#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:23,551 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-15 15:22:23,552 INFO L290 TraceCheckUtils]: 106: Hoare triple {177162#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {177162#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:23,552 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-15 15:22:23,552 INFO L290 TraceCheckUtils]: 108: Hoare triple {177162#(<= ~counter~0 12)} ~cond := #in~cond; {177162#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:23,553 INFO L290 TraceCheckUtils]: 109: Hoare triple {177162#(<= ~counter~0 12)} assume !(0 == ~cond); {177162#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:23,553 INFO L290 TraceCheckUtils]: 110: Hoare triple {177162#(<= ~counter~0 12)} assume true; {177162#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:23,553 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {177162#(<= ~counter~0 12)} {177162#(<= ~counter~0 12)} #96#return; {177162#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:23,554 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-15 15:22:23,555 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-15 15:22:23,555 INFO L290 TraceCheckUtils]: 114: Hoare triple {177187#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {177187#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:23,556 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-15 15:22:23,556 INFO L290 TraceCheckUtils]: 116: Hoare triple {177187#(<= ~counter~0 13)} ~cond := #in~cond; {177187#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:23,556 INFO L290 TraceCheckUtils]: 117: Hoare triple {177187#(<= ~counter~0 13)} assume !(0 == ~cond); {177187#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:23,557 INFO L290 TraceCheckUtils]: 118: Hoare triple {177187#(<= ~counter~0 13)} assume true; {177187#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:23,557 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {177187#(<= ~counter~0 13)} {177187#(<= ~counter~0 13)} #96#return; {177187#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:23,557 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-15 15:22:23,559 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-15 15:22:23,559 INFO L290 TraceCheckUtils]: 122: Hoare triple {177212#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,560 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-15 15:22:23,560 INFO L290 TraceCheckUtils]: 124: Hoare triple {177212#(<= ~counter~0 14)} ~cond := #in~cond; {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,560 INFO L290 TraceCheckUtils]: 125: Hoare triple {177212#(<= ~counter~0 14)} assume !(0 == ~cond); {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,560 INFO L290 TraceCheckUtils]: 126: Hoare triple {177212#(<= ~counter~0 14)} assume true; {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,561 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {177212#(<= ~counter~0 14)} {177212#(<= ~counter~0 14)} #96#return; {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,561 INFO L290 TraceCheckUtils]: 128: Hoare triple {177212#(<= ~counter~0 14)} assume !(~r~0 > 0); {177212#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:23,562 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-15 15:22:23,563 INFO L290 TraceCheckUtils]: 130: Hoare triple {177237#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {177237#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:23,563 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-15 15:22:23,564 INFO L290 TraceCheckUtils]: 132: Hoare triple {177237#(<= ~counter~0 15)} ~cond := #in~cond; {177237#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:23,564 INFO L290 TraceCheckUtils]: 133: Hoare triple {177237#(<= ~counter~0 15)} assume !(0 == ~cond); {177237#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:23,564 INFO L290 TraceCheckUtils]: 134: Hoare triple {177237#(<= ~counter~0 15)} assume true; {177237#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:23,565 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {177237#(<= ~counter~0 15)} {177237#(<= ~counter~0 15)} #98#return; {177237#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:23,565 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-15 15:22:23,566 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-15 15:22:23,567 INFO L290 TraceCheckUtils]: 138: Hoare triple {177262#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,567 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-15 15:22:23,567 INFO L290 TraceCheckUtils]: 140: Hoare triple {177262#(<= ~counter~0 16)} ~cond := #in~cond; {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,568 INFO L290 TraceCheckUtils]: 141: Hoare triple {177262#(<= ~counter~0 16)} assume !(0 == ~cond); {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,568 INFO L290 TraceCheckUtils]: 142: Hoare triple {177262#(<= ~counter~0 16)} assume true; {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,568 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {177262#(<= ~counter~0 16)} {177262#(<= ~counter~0 16)} #98#return; {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,569 INFO L290 TraceCheckUtils]: 144: Hoare triple {177262#(<= ~counter~0 16)} assume !(~r~0 < 0); {177262#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:23,570 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-15 15:22:23,570 INFO L290 TraceCheckUtils]: 146: Hoare triple {177287#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,571 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-15 15:22:23,571 INFO L290 TraceCheckUtils]: 148: Hoare triple {177287#(<= ~counter~0 17)} ~cond := #in~cond; {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,571 INFO L290 TraceCheckUtils]: 149: Hoare triple {177287#(<= ~counter~0 17)} assume !(0 == ~cond); {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,572 INFO L290 TraceCheckUtils]: 150: Hoare triple {177287#(<= ~counter~0 17)} assume true; {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,572 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {177287#(<= ~counter~0 17)} {177287#(<= ~counter~0 17)} #94#return; {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,572 INFO L290 TraceCheckUtils]: 152: Hoare triple {177287#(<= ~counter~0 17)} assume !!(0 != ~r~0); {177287#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:23,573 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-15 15:22:23,573 INFO L290 TraceCheckUtils]: 154: Hoare triple {177312#(<= |main_#t~post7| 17)} assume !(#t~post7 < 50);havoc #t~post7; {176831#false} is VALID [2022-04-15 15:22:23,573 INFO L290 TraceCheckUtils]: 155: Hoare triple {176831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176831#false} is VALID [2022-04-15 15:22:23,573 INFO L290 TraceCheckUtils]: 156: Hoare triple {176831#false} assume !(#t~post8 < 50);havoc #t~post8; {176831#false} is VALID [2022-04-15 15:22:23,573 INFO L290 TraceCheckUtils]: 157: Hoare triple {176831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176831#false} is VALID [2022-04-15 15:22:23,573 INFO L290 TraceCheckUtils]: 158: Hoare triple {176831#false} assume !(#t~post6 < 50);havoc #t~post6; {176831#false} is VALID [2022-04-15 15:22:23,573 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-15 15:22:23,573 INFO L290 TraceCheckUtils]: 160: Hoare triple {176831#false} ~cond := #in~cond; {176831#false} is VALID [2022-04-15 15:22:23,573 INFO L290 TraceCheckUtils]: 161: Hoare triple {176831#false} assume 0 == ~cond; {176831#false} is VALID [2022-04-15 15:22:23,574 INFO L290 TraceCheckUtils]: 162: Hoare triple {176831#false} assume !false; {176831#false} is VALID [2022-04-15 15:22:23,574 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-15 15:22:23,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 162: Hoare triple {176831#false} assume !false; {176831#false} is VALID [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 161: Hoare triple {176831#false} assume 0 == ~cond; {176831#false} is VALID [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 160: Hoare triple {176831#false} ~cond := #in~cond; {176831#false} is VALID [2022-04-15 15:22:24,611 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-15 15:22:24,611 INFO L290 TraceCheckUtils]: 158: Hoare triple {176831#false} assume !(#t~post6 < 50);havoc #t~post6; {176831#false} is VALID [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 157: Hoare triple {176831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176831#false} is VALID [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 156: Hoare triple {176831#false} assume !(#t~post8 < 50);havoc #t~post8; {176831#false} is VALID [2022-04-15 15:22:24,611 INFO L290 TraceCheckUtils]: 155: Hoare triple {176831#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176831#false} is VALID [2022-04-15 15:22:24,612 INFO L290 TraceCheckUtils]: 154: Hoare triple {177364#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {176831#false} is VALID [2022-04-15 15:22:24,612 INFO L290 TraceCheckUtils]: 153: Hoare triple {177368#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177364#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:22:24,612 INFO L290 TraceCheckUtils]: 152: Hoare triple {177368#(< ~counter~0 50)} assume !!(0 != ~r~0); {177368#(< ~counter~0 50)} is VALID [2022-04-15 15:22:24,613 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176830#true} {177368#(< ~counter~0 50)} #94#return; {177368#(< ~counter~0 50)} is VALID [2022-04-15 15:22:24,613 INFO L290 TraceCheckUtils]: 150: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,621 INFO L290 TraceCheckUtils]: 149: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,621 INFO L290 TraceCheckUtils]: 148: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,621 INFO L272 TraceCheckUtils]: 147: Hoare triple {177368#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:22:24,621 INFO L290 TraceCheckUtils]: 146: Hoare triple {177368#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {177368#(< ~counter~0 50)} is VALID [2022-04-15 15:22:24,625 INFO L290 TraceCheckUtils]: 145: Hoare triple {177393#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177368#(< ~counter~0 50)} is VALID [2022-04-15 15:22:24,626 INFO L290 TraceCheckUtils]: 144: Hoare triple {177393#(< ~counter~0 49)} assume !(~r~0 < 0); {177393#(< ~counter~0 49)} is VALID [2022-04-15 15:22:24,626 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176830#true} {177393#(< ~counter~0 49)} #98#return; {177393#(< ~counter~0 49)} is VALID [2022-04-15 15:22:24,626 INFO L290 TraceCheckUtils]: 142: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,627 INFO L290 TraceCheckUtils]: 141: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,627 INFO L290 TraceCheckUtils]: 140: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,627 INFO L272 TraceCheckUtils]: 139: Hoare triple {177393#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:22:24,627 INFO L290 TraceCheckUtils]: 138: Hoare triple {177393#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {177393#(< ~counter~0 49)} is VALID [2022-04-15 15:22:24,630 INFO L290 TraceCheckUtils]: 137: Hoare triple {177418#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177393#(< ~counter~0 49)} is VALID [2022-04-15 15:22:24,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {177418#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177418#(< ~counter~0 48)} is VALID [2022-04-15 15:22:24,631 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176830#true} {177418#(< ~counter~0 48)} #98#return; {177418#(< ~counter~0 48)} is VALID [2022-04-15 15:22:24,631 INFO L290 TraceCheckUtils]: 134: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,631 INFO L290 TraceCheckUtils]: 133: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,631 INFO L290 TraceCheckUtils]: 132: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,631 INFO L272 TraceCheckUtils]: 131: Hoare triple {177418#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:22:24,631 INFO L290 TraceCheckUtils]: 130: Hoare triple {177418#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {177418#(< ~counter~0 48)} is VALID [2022-04-15 15:22:24,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {177443#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177418#(< ~counter~0 48)} is VALID [2022-04-15 15:22:24,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {177443#(< ~counter~0 47)} assume !(~r~0 > 0); {177443#(< ~counter~0 47)} is VALID [2022-04-15 15:22:24,634 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176830#true} {177443#(< ~counter~0 47)} #96#return; {177443#(< ~counter~0 47)} is VALID [2022-04-15 15:22:24,634 INFO L290 TraceCheckUtils]: 126: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,634 INFO L290 TraceCheckUtils]: 125: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,634 INFO L290 TraceCheckUtils]: 124: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,634 INFO L272 TraceCheckUtils]: 123: Hoare triple {177443#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:22:24,634 INFO L290 TraceCheckUtils]: 122: Hoare triple {177443#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {177443#(< ~counter~0 47)} is VALID [2022-04-15 15:22:24,637 INFO L290 TraceCheckUtils]: 121: Hoare triple {177468#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177443#(< ~counter~0 47)} is VALID [2022-04-15 15:22:24,637 INFO L290 TraceCheckUtils]: 120: Hoare triple {177468#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177468#(< ~counter~0 46)} is VALID [2022-04-15 15:22:24,638 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176830#true} {177468#(< ~counter~0 46)} #96#return; {177468#(< ~counter~0 46)} is VALID [2022-04-15 15:22:24,638 INFO L290 TraceCheckUtils]: 118: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,638 INFO L290 TraceCheckUtils]: 117: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,638 INFO L290 TraceCheckUtils]: 116: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,638 INFO L272 TraceCheckUtils]: 115: Hoare triple {177468#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:22:24,638 INFO L290 TraceCheckUtils]: 114: Hoare triple {177468#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {177468#(< ~counter~0 46)} is VALID [2022-04-15 15:22:24,641 INFO L290 TraceCheckUtils]: 113: Hoare triple {177493#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177468#(< ~counter~0 46)} is VALID [2022-04-15 15:22:24,641 INFO L290 TraceCheckUtils]: 112: Hoare triple {177493#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177493#(< ~counter~0 45)} is VALID [2022-04-15 15:22:24,642 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176830#true} {177493#(< ~counter~0 45)} #96#return; {177493#(< ~counter~0 45)} is VALID [2022-04-15 15:22:24,642 INFO L290 TraceCheckUtils]: 110: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,642 INFO L290 TraceCheckUtils]: 109: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,642 INFO L290 TraceCheckUtils]: 108: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,642 INFO L272 TraceCheckUtils]: 107: Hoare triple {177493#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:22:24,642 INFO L290 TraceCheckUtils]: 106: Hoare triple {177493#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {177493#(< ~counter~0 45)} is VALID [2022-04-15 15:22:24,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {177518#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177493#(< ~counter~0 45)} is VALID [2022-04-15 15:22:24,644 INFO L290 TraceCheckUtils]: 104: Hoare triple {177518#(< ~counter~0 44)} assume !!(0 != ~r~0); {177518#(< ~counter~0 44)} is VALID [2022-04-15 15:22:24,645 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176830#true} {177518#(< ~counter~0 44)} #94#return; {177518#(< ~counter~0 44)} is VALID [2022-04-15 15:22:24,645 INFO L290 TraceCheckUtils]: 102: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,645 INFO L290 TraceCheckUtils]: 101: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,645 INFO L272 TraceCheckUtils]: 99: Hoare triple {177518#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:22:24,646 INFO L290 TraceCheckUtils]: 98: Hoare triple {177518#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {177518#(< ~counter~0 44)} is VALID [2022-04-15 15:22:24,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {177543#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177518#(< ~counter~0 44)} is VALID [2022-04-15 15:22:24,648 INFO L290 TraceCheckUtils]: 96: Hoare triple {177543#(< ~counter~0 43)} assume !(~r~0 < 0); {177543#(< ~counter~0 43)} is VALID [2022-04-15 15:22:24,648 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176830#true} {177543#(< ~counter~0 43)} #98#return; {177543#(< ~counter~0 43)} is VALID [2022-04-15 15:22:24,648 INFO L290 TraceCheckUtils]: 94: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,648 INFO L290 TraceCheckUtils]: 93: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,648 INFO L290 TraceCheckUtils]: 92: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,648 INFO L272 TraceCheckUtils]: 91: Hoare triple {177543#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:22:24,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {177543#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {177543#(< ~counter~0 43)} is VALID [2022-04-15 15:22:24,650 INFO L290 TraceCheckUtils]: 89: Hoare triple {177568#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177543#(< ~counter~0 43)} is VALID [2022-04-15 15:22:24,651 INFO L290 TraceCheckUtils]: 88: Hoare triple {177568#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177568#(< ~counter~0 42)} is VALID [2022-04-15 15:22:24,651 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176830#true} {177568#(< ~counter~0 42)} #98#return; {177568#(< ~counter~0 42)} is VALID [2022-04-15 15:22:24,651 INFO L290 TraceCheckUtils]: 86: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,651 INFO L290 TraceCheckUtils]: 85: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,651 INFO L290 TraceCheckUtils]: 84: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,651 INFO L272 TraceCheckUtils]: 83: Hoare triple {177568#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:22:24,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {177568#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {177568#(< ~counter~0 42)} is VALID [2022-04-15 15:22:24,654 INFO L290 TraceCheckUtils]: 81: Hoare triple {177593#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177568#(< ~counter~0 42)} is VALID [2022-04-15 15:22:24,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {177593#(< ~counter~0 41)} assume !(~r~0 > 0); {177593#(< ~counter~0 41)} is VALID [2022-04-15 15:22:24,654 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176830#true} {177593#(< ~counter~0 41)} #96#return; {177593#(< ~counter~0 41)} is VALID [2022-04-15 15:22:24,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,655 INFO L272 TraceCheckUtils]: 75: Hoare triple {177593#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:22:24,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {177593#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {177593#(< ~counter~0 41)} is VALID [2022-04-15 15:22:24,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {177618#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177593#(< ~counter~0 41)} is VALID [2022-04-15 15:22:24,657 INFO L290 TraceCheckUtils]: 72: Hoare triple {177618#(< ~counter~0 40)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177618#(< ~counter~0 40)} is VALID [2022-04-15 15:22:24,657 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176830#true} {177618#(< ~counter~0 40)} #96#return; {177618#(< ~counter~0 40)} is VALID [2022-04-15 15:22:24,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,658 INFO L272 TraceCheckUtils]: 67: Hoare triple {177618#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:22:24,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {177618#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {177618#(< ~counter~0 40)} is VALID [2022-04-15 15:22:24,660 INFO L290 TraceCheckUtils]: 65: Hoare triple {177643#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177618#(< ~counter~0 40)} is VALID [2022-04-15 15:22:24,660 INFO L290 TraceCheckUtils]: 64: Hoare triple {177643#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177643#(< ~counter~0 39)} is VALID [2022-04-15 15:22:24,661 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176830#true} {177643#(< ~counter~0 39)} #96#return; {177643#(< ~counter~0 39)} is VALID [2022-04-15 15:22:24,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,661 INFO L272 TraceCheckUtils]: 59: Hoare triple {177643#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:22:24,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {177643#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {177643#(< ~counter~0 39)} is VALID [2022-04-15 15:22:24,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {177668#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177643#(< ~counter~0 39)} is VALID [2022-04-15 15:22:24,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {177668#(< ~counter~0 38)} assume !!(0 != ~r~0); {177668#(< ~counter~0 38)} is VALID [2022-04-15 15:22:24,664 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176830#true} {177668#(< ~counter~0 38)} #94#return; {177668#(< ~counter~0 38)} is VALID [2022-04-15 15:22:24,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,664 INFO L272 TraceCheckUtils]: 51: Hoare triple {177668#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:22:24,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {177668#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {177668#(< ~counter~0 38)} is VALID [2022-04-15 15:22:24,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {177693#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177668#(< ~counter~0 38)} is VALID [2022-04-15 15:22:24,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {177693#(< ~counter~0 37)} assume !(~r~0 < 0); {177693#(< ~counter~0 37)} is VALID [2022-04-15 15:22:24,667 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176830#true} {177693#(< ~counter~0 37)} #98#return; {177693#(< ~counter~0 37)} is VALID [2022-04-15 15:22:24,667 INFO L290 TraceCheckUtils]: 46: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,667 INFO L290 TraceCheckUtils]: 45: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,667 INFO L272 TraceCheckUtils]: 43: Hoare triple {177693#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:22:24,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {177693#(< ~counter~0 37)} assume !!(#t~post8 < 50);havoc #t~post8; {177693#(< ~counter~0 37)} is VALID [2022-04-15 15:22:24,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {177718#(< ~counter~0 36)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177693#(< ~counter~0 37)} is VALID [2022-04-15 15:22:24,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {177718#(< ~counter~0 36)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177718#(< ~counter~0 36)} is VALID [2022-04-15 15:22:24,671 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176830#true} {177718#(< ~counter~0 36)} #98#return; {177718#(< ~counter~0 36)} is VALID [2022-04-15 15:22:24,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,671 INFO L272 TraceCheckUtils]: 35: Hoare triple {177718#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:22:24,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {177718#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {177718#(< ~counter~0 36)} is VALID [2022-04-15 15:22:24,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {177743#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177718#(< ~counter~0 36)} is VALID [2022-04-15 15:22:24,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {177743#(< ~counter~0 35)} assume !(~r~0 > 0); {177743#(< ~counter~0 35)} is VALID [2022-04-15 15:22:24,675 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176830#true} {177743#(< ~counter~0 35)} #96#return; {177743#(< ~counter~0 35)} is VALID [2022-04-15 15:22:24,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,675 INFO L272 TraceCheckUtils]: 27: Hoare triple {177743#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:22:24,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {177743#(< ~counter~0 35)} assume !!(#t~post7 < 50);havoc #t~post7; {177743#(< ~counter~0 35)} is VALID [2022-04-15 15:22:24,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {177768#(< ~counter~0 34)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177743#(< ~counter~0 35)} is VALID [2022-04-15 15:22:24,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {177768#(< ~counter~0 34)} assume !!(0 != ~r~0); {177768#(< ~counter~0 34)} is VALID [2022-04-15 15:22:24,678 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176830#true} {177768#(< ~counter~0 34)} #94#return; {177768#(< ~counter~0 34)} is VALID [2022-04-15 15:22:24,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {177768#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:22:24,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {177768#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {177768#(< ~counter~0 34)} is VALID [2022-04-15 15:22:24,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {177793#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177768#(< ~counter~0 34)} is VALID [2022-04-15 15:22:24,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {177793#(< ~counter~0 33)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176830#true} {177793#(< ~counter~0 33)} #92#return; {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {177793#(< ~counter~0 33)} call assume_abort_if_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-15 15:22:24,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176830#true} {177793#(< ~counter~0 33)} #90#return; {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {176830#true} assume true; {176830#true} is VALID [2022-04-15 15:22:24,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {176830#true} assume !(0 == ~cond); {176830#true} is VALID [2022-04-15 15:22:24,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {176830#true} ~cond := #in~cond; {176830#true} is VALID [2022-04-15 15:22:24,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {177793#(< ~counter~0 33)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176830#true} is VALID [2022-04-15 15:22:24,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {177793#(< ~counter~0 33)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 33)} is VALID [2022-04-15 15:22:24,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {177793#(< ~counter~0 33)} call #t~ret9 := main(); {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177793#(< ~counter~0 33)} {176830#true} #102#return; {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {177793#(< ~counter~0 33)} assume true; {177793#(< ~counter~0 33)} is VALID [2022-04-15 15:22:24,684 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 33)} is VALID [2022-04-15 15:22:24,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {176830#true} call ULTIMATE.init(); {176830#true} is VALID [2022-04-15 15:22:24,684 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-15 15:22:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:22:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918742168] [2022-04-15 15:22:24,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:22:24,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455336489] [2022-04-15 15:22:24,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455336489] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:22:24,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:22:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:22:24,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:22:24,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1093087295] [2022-04-15 15:22:24,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1093087295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:22:24,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:22:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:22:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618749117] [2022-04-15 15:22:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:22:24,686 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-15 15:22:24,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:22:24,686 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-15 15:22:25,006 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-15 15:22:25,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:22:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:22:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:22:25,007 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-15 15:22:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:31,248 INFO L93 Difference]: Finished difference Result 1077 states and 1465 transitions. [2022-04-15 15:22:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 15:22:31,248 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-15 15:22:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:31,249 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-15 15:22:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-15 15:22:31,251 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-15 15:22:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-15 15:22:31,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-15 15:22:31,784 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-15 15:22:31,817 INFO L225 Difference]: With dead ends: 1077 [2022-04-15 15:22:31,817 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 15:22:31,818 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-15 15:22:31,818 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 257 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:31,818 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.9s Time] [2022-04-15 15:22:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 15:22:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2022-04-15 15:22:35,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:35,374 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-15 15:22:35,375 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-15 15:22:35,375 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-15 15:22:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:35,400 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-15 15:22:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-15 15:22:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:35,402 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-15 15:22:35,402 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-15 15:22:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:35,427 INFO L93 Difference]: Finished difference Result 907 states and 1204 transitions. [2022-04-15 15:22:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-15 15:22:35,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:35,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:35,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:35,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:35,429 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-15 15:22:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1204 transitions. [2022-04-15 15:22:35,465 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1204 transitions. Word has length 163 [2022-04-15 15:22:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:35,465 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1204 transitions. [2022-04-15 15:22:35,465 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-15 15:22:35,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1204 transitions. [2022-04-15 15:22:46,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1204 edges. 1202 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1204 transitions. [2022-04-15 15:22:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-15 15:22:46,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:46,610 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-15 15:22:46,628 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-15 15:22:46,811 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-15 15:22:46,811 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-15 15:22:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:46,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1913749942] [2022-04-15 15:22:46,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-15 15:22:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:46,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012452053] [2022-04-15 15:22:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:46,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:46,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782877297] [2022-04-15 15:22:46,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:22:46,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:46,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:46,827 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-15 15:22:46,851 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-15 15:22:46,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:22:46,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:46,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:22:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:46,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:22:47,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {183661#true} call ULTIMATE.init(); {183661#true} is VALID [2022-04-15 15:22:47,901 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-15 15:22:47,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183669#(<= ~counter~0 0)} {183661#true} #102#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {183669#(<= ~counter~0 0)} call #t~ret9 := main(); {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,902 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-15 15:22:47,902 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-15 15:22:47,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {183669#(<= ~counter~0 0)} ~cond := #in~cond; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {183669#(<= ~counter~0 0)} assume !(0 == ~cond); {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183669#(<= ~counter~0 0)} {183669#(<= ~counter~0 0)} #90#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,904 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-15 15:22:47,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {183669#(<= ~counter~0 0)} ~cond := #in~cond; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {183669#(<= ~counter~0 0)} assume !(0 == ~cond); {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {183669#(<= ~counter~0 0)} assume true; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183669#(<= ~counter~0 0)} {183669#(<= ~counter~0 0)} #92#return; {183669#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:47,905 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-15 15:22:47,909 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-15 15:22:47,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {183718#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,910 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-15 15:22:47,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {183718#(<= ~counter~0 1)} ~cond := #in~cond; {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {183718#(<= ~counter~0 1)} assume !(0 == ~cond); {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {183718#(<= ~counter~0 1)} assume true; {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,911 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183718#(<= ~counter~0 1)} {183718#(<= ~counter~0 1)} #94#return; {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {183718#(<= ~counter~0 1)} assume !!(0 != ~r~0); {183718#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:47,913 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-15 15:22:47,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {183743#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,914 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-15 15:22:47,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {183743#(<= ~counter~0 2)} ~cond := #in~cond; {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {183743#(<= ~counter~0 2)} assume !(0 == ~cond); {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {183743#(<= ~counter~0 2)} assume true; {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,915 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183743#(<= ~counter~0 2)} {183743#(<= ~counter~0 2)} #96#return; {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {183743#(<= ~counter~0 2)} assume !(~r~0 > 0); {183743#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:47,917 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-15 15:22:47,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {183768#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {183768#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:47,917 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-15 15:22:47,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {183768#(<= ~counter~0 3)} ~cond := #in~cond; {183768#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:47,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {183768#(<= ~counter~0 3)} assume !(0 == ~cond); {183768#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:47,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {183768#(<= ~counter~0 3)} assume true; {183768#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:47,919 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183768#(<= ~counter~0 3)} {183768#(<= ~counter~0 3)} #98#return; {183768#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:47,919 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-15 15:22:47,920 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-15 15:22:47,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {183793#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,921 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-15 15:22:47,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {183793#(<= ~counter~0 4)} ~cond := #in~cond; {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {183793#(<= ~counter~0 4)} assume !(0 == ~cond); {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {183793#(<= ~counter~0 4)} assume true; {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,923 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183793#(<= ~counter~0 4)} {183793#(<= ~counter~0 4)} #98#return; {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {183793#(<= ~counter~0 4)} assume !(~r~0 < 0); {183793#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:47,924 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-15 15:22:47,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {183818#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,925 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-15 15:22:47,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {183818#(<= ~counter~0 5)} ~cond := #in~cond; {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,926 INFO L290 TraceCheckUtils]: 53: Hoare triple {183818#(<= ~counter~0 5)} assume !(0 == ~cond); {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,926 INFO L290 TraceCheckUtils]: 54: Hoare triple {183818#(<= ~counter~0 5)} assume true; {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,926 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183818#(<= ~counter~0 5)} {183818#(<= ~counter~0 5)} #94#return; {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,927 INFO L290 TraceCheckUtils]: 56: Hoare triple {183818#(<= ~counter~0 5)} assume !!(0 != ~r~0); {183818#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:47,928 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-15 15:22:47,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {183843#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {183843#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:47,929 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-15 15:22:47,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {183843#(<= ~counter~0 6)} ~cond := #in~cond; {183843#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:47,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {183843#(<= ~counter~0 6)} assume !(0 == ~cond); {183843#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:47,930 INFO L290 TraceCheckUtils]: 62: Hoare triple {183843#(<= ~counter~0 6)} assume true; {183843#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:47,930 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183843#(<= ~counter~0 6)} {183843#(<= ~counter~0 6)} #96#return; {183843#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:47,930 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-15 15:22:47,932 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-15 15:22:47,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {183868#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {183868#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:47,933 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-15 15:22:47,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {183868#(<= ~counter~0 7)} ~cond := #in~cond; {183868#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:47,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {183868#(<= ~counter~0 7)} assume !(0 == ~cond); {183868#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:47,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {183868#(<= ~counter~0 7)} assume true; {183868#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:47,934 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183868#(<= ~counter~0 7)} {183868#(<= ~counter~0 7)} #96#return; {183868#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:47,934 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-15 15:22:47,936 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-15 15:22:47,936 INFO L290 TraceCheckUtils]: 74: Hoare triple {183893#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,936 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-15 15:22:47,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {183893#(<= ~counter~0 8)} ~cond := #in~cond; {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {183893#(<= ~counter~0 8)} assume !(0 == ~cond); {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {183893#(<= ~counter~0 8)} assume true; {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,938 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183893#(<= ~counter~0 8)} {183893#(<= ~counter~0 8)} #96#return; {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,938 INFO L290 TraceCheckUtils]: 80: Hoare triple {183893#(<= ~counter~0 8)} assume !(~r~0 > 0); {183893#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:47,939 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-15 15:22:47,940 INFO L290 TraceCheckUtils]: 82: Hoare triple {183918#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {183918#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:47,940 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-15 15:22:47,940 INFO L290 TraceCheckUtils]: 84: Hoare triple {183918#(<= ~counter~0 9)} ~cond := #in~cond; {183918#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:47,941 INFO L290 TraceCheckUtils]: 85: Hoare triple {183918#(<= ~counter~0 9)} assume !(0 == ~cond); {183918#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:47,941 INFO L290 TraceCheckUtils]: 86: Hoare triple {183918#(<= ~counter~0 9)} assume true; {183918#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:47,941 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183918#(<= ~counter~0 9)} {183918#(<= ~counter~0 9)} #98#return; {183918#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:47,942 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-15 15:22:47,943 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-15 15:22:47,943 INFO L290 TraceCheckUtils]: 90: Hoare triple {183943#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,944 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-15 15:22:47,944 INFO L290 TraceCheckUtils]: 92: Hoare triple {183943#(<= ~counter~0 10)} ~cond := #in~cond; {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,944 INFO L290 TraceCheckUtils]: 93: Hoare triple {183943#(<= ~counter~0 10)} assume !(0 == ~cond); {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,945 INFO L290 TraceCheckUtils]: 94: Hoare triple {183943#(<= ~counter~0 10)} assume true; {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,945 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183943#(<= ~counter~0 10)} {183943#(<= ~counter~0 10)} #98#return; {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,945 INFO L290 TraceCheckUtils]: 96: Hoare triple {183943#(<= ~counter~0 10)} assume !(~r~0 < 0); {183943#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:47,947 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-15 15:22:47,947 INFO L290 TraceCheckUtils]: 98: Hoare triple {183968#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,948 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-15 15:22:47,948 INFO L290 TraceCheckUtils]: 100: Hoare triple {183968#(<= ~counter~0 11)} ~cond := #in~cond; {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {183968#(<= ~counter~0 11)} assume !(0 == ~cond); {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {183968#(<= ~counter~0 11)} assume true; {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,949 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183968#(<= ~counter~0 11)} {183968#(<= ~counter~0 11)} #94#return; {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {183968#(<= ~counter~0 11)} assume !!(0 != ~r~0); {183968#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:47,951 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-15 15:22:47,951 INFO L290 TraceCheckUtils]: 106: Hoare triple {183993#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {183993#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:47,952 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-15 15:22:47,952 INFO L290 TraceCheckUtils]: 108: Hoare triple {183993#(<= ~counter~0 12)} ~cond := #in~cond; {183993#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:47,952 INFO L290 TraceCheckUtils]: 109: Hoare triple {183993#(<= ~counter~0 12)} assume !(0 == ~cond); {183993#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:47,953 INFO L290 TraceCheckUtils]: 110: Hoare triple {183993#(<= ~counter~0 12)} assume true; {183993#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:47,953 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183993#(<= ~counter~0 12)} {183993#(<= ~counter~0 12)} #96#return; {183993#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:47,953 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-15 15:22:47,955 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-15 15:22:47,955 INFO L290 TraceCheckUtils]: 114: Hoare triple {184018#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {184018#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:47,956 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-15 15:22:47,956 INFO L290 TraceCheckUtils]: 116: Hoare triple {184018#(<= ~counter~0 13)} ~cond := #in~cond; {184018#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:47,956 INFO L290 TraceCheckUtils]: 117: Hoare triple {184018#(<= ~counter~0 13)} assume !(0 == ~cond); {184018#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:47,956 INFO L290 TraceCheckUtils]: 118: Hoare triple {184018#(<= ~counter~0 13)} assume true; {184018#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:47,957 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {184018#(<= ~counter~0 13)} {184018#(<= ~counter~0 13)} #96#return; {184018#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:47,957 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-15 15:22:47,959 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-15 15:22:47,959 INFO L290 TraceCheckUtils]: 122: Hoare triple {184043#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {184043#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:47,959 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-15 15:22:47,960 INFO L290 TraceCheckUtils]: 124: Hoare triple {184043#(<= ~counter~0 14)} ~cond := #in~cond; {184043#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:47,960 INFO L290 TraceCheckUtils]: 125: Hoare triple {184043#(<= ~counter~0 14)} assume !(0 == ~cond); {184043#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:47,960 INFO L290 TraceCheckUtils]: 126: Hoare triple {184043#(<= ~counter~0 14)} assume true; {184043#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:47,961 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {184043#(<= ~counter~0 14)} {184043#(<= ~counter~0 14)} #96#return; {184043#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:47,961 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-15 15:22:47,963 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-15 15:22:47,963 INFO L290 TraceCheckUtils]: 130: Hoare triple {184068#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {184068#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:47,963 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-15 15:22:47,964 INFO L290 TraceCheckUtils]: 132: Hoare triple {184068#(<= ~counter~0 15)} ~cond := #in~cond; {184068#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:47,964 INFO L290 TraceCheckUtils]: 133: Hoare triple {184068#(<= ~counter~0 15)} assume !(0 == ~cond); {184068#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:47,964 INFO L290 TraceCheckUtils]: 134: Hoare triple {184068#(<= ~counter~0 15)} assume true; {184068#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:47,965 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {184068#(<= ~counter~0 15)} {184068#(<= ~counter~0 15)} #96#return; {184068#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:47,965 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-15 15:22:47,966 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-15 15:22:47,967 INFO L290 TraceCheckUtils]: 138: Hoare triple {184093#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,967 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-15 15:22:47,968 INFO L290 TraceCheckUtils]: 140: Hoare triple {184093#(<= ~counter~0 16)} ~cond := #in~cond; {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,968 INFO L290 TraceCheckUtils]: 141: Hoare triple {184093#(<= ~counter~0 16)} assume !(0 == ~cond); {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,968 INFO L290 TraceCheckUtils]: 142: Hoare triple {184093#(<= ~counter~0 16)} assume true; {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,969 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {184093#(<= ~counter~0 16)} {184093#(<= ~counter~0 16)} #96#return; {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,969 INFO L290 TraceCheckUtils]: 144: Hoare triple {184093#(<= ~counter~0 16)} assume !(~r~0 > 0); {184093#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:47,970 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-15 15:22:47,971 INFO L290 TraceCheckUtils]: 146: Hoare triple {184118#(<= ~counter~0 17)} assume !!(#t~post8 < 50);havoc #t~post8; {184118#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:47,971 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-15 15:22:47,971 INFO L290 TraceCheckUtils]: 148: Hoare triple {184118#(<= ~counter~0 17)} ~cond := #in~cond; {184118#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:47,972 INFO L290 TraceCheckUtils]: 149: Hoare triple {184118#(<= ~counter~0 17)} assume !(0 == ~cond); {184118#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:47,972 INFO L290 TraceCheckUtils]: 150: Hoare triple {184118#(<= ~counter~0 17)} assume true; {184118#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:47,972 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {184118#(<= ~counter~0 17)} {184118#(<= ~counter~0 17)} #98#return; {184118#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:47,973 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-15 15:22:47,974 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-15 15:22:47,974 INFO L290 TraceCheckUtils]: 154: Hoare triple {184143#(<= ~counter~0 18)} assume !!(#t~post8 < 50);havoc #t~post8; {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,975 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-15 15:22:47,975 INFO L290 TraceCheckUtils]: 156: Hoare triple {184143#(<= ~counter~0 18)} ~cond := #in~cond; {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,975 INFO L290 TraceCheckUtils]: 157: Hoare triple {184143#(<= ~counter~0 18)} assume !(0 == ~cond); {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,976 INFO L290 TraceCheckUtils]: 158: Hoare triple {184143#(<= ~counter~0 18)} assume true; {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,976 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {184143#(<= ~counter~0 18)} {184143#(<= ~counter~0 18)} #98#return; {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,976 INFO L290 TraceCheckUtils]: 160: Hoare triple {184143#(<= ~counter~0 18)} assume !(~r~0 < 0); {184143#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:47,977 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-15 15:22:47,977 INFO L290 TraceCheckUtils]: 162: Hoare triple {184168#(<= |main_#t~post6| 18)} assume !(#t~post6 < 50);havoc #t~post6; {183662#false} is VALID [2022-04-15 15:22:47,977 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-15 15:22:47,977 INFO L290 TraceCheckUtils]: 164: Hoare triple {183662#false} ~cond := #in~cond; {183662#false} is VALID [2022-04-15 15:22:47,977 INFO L290 TraceCheckUtils]: 165: Hoare triple {183662#false} assume 0 == ~cond; {183662#false} is VALID [2022-04-15 15:22:47,977 INFO L290 TraceCheckUtils]: 166: Hoare triple {183662#false} assume !false; {183662#false} is VALID [2022-04-15 15:22:47,978 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-15 15:22:47,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:22:49,131 INFO L290 TraceCheckUtils]: 166: Hoare triple {183662#false} assume !false; {183662#false} is VALID [2022-04-15 15:22:49,131 INFO L290 TraceCheckUtils]: 165: Hoare triple {183662#false} assume 0 == ~cond; {183662#false} is VALID [2022-04-15 15:22:49,131 INFO L290 TraceCheckUtils]: 164: Hoare triple {183662#false} ~cond := #in~cond; {183662#false} is VALID [2022-04-15 15:22:49,131 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-15 15:22:49,132 INFO L290 TraceCheckUtils]: 162: Hoare triple {184196#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {183662#false} is VALID [2022-04-15 15:22:49,132 INFO L290 TraceCheckUtils]: 161: Hoare triple {184200#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184196#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:22:49,132 INFO L290 TraceCheckUtils]: 160: Hoare triple {184200#(< ~counter~0 50)} assume !(~r~0 < 0); {184200#(< ~counter~0 50)} is VALID [2022-04-15 15:22:49,133 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {183661#true} {184200#(< ~counter~0 50)} #98#return; {184200#(< ~counter~0 50)} is VALID [2022-04-15 15:22:49,133 INFO L290 TraceCheckUtils]: 158: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,133 INFO L290 TraceCheckUtils]: 157: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,133 INFO L290 TraceCheckUtils]: 156: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,133 INFO L272 TraceCheckUtils]: 155: Hoare triple {184200#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:22:49,133 INFO L290 TraceCheckUtils]: 154: Hoare triple {184200#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {184200#(< ~counter~0 50)} is VALID [2022-04-15 15:22:49,137 INFO L290 TraceCheckUtils]: 153: Hoare triple {184225#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184200#(< ~counter~0 50)} is VALID [2022-04-15 15:22:49,137 INFO L290 TraceCheckUtils]: 152: Hoare triple {184225#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184225#(< ~counter~0 49)} is VALID [2022-04-15 15:22:49,138 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {183661#true} {184225#(< ~counter~0 49)} #98#return; {184225#(< ~counter~0 49)} is VALID [2022-04-15 15:22:49,138 INFO L290 TraceCheckUtils]: 150: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,138 INFO L290 TraceCheckUtils]: 149: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,138 INFO L290 TraceCheckUtils]: 148: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,138 INFO L272 TraceCheckUtils]: 147: Hoare triple {184225#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:22:49,138 INFO L290 TraceCheckUtils]: 146: Hoare triple {184225#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {184225#(< ~counter~0 49)} is VALID [2022-04-15 15:22:49,140 INFO L290 TraceCheckUtils]: 145: Hoare triple {184250#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184225#(< ~counter~0 49)} is VALID [2022-04-15 15:22:49,140 INFO L290 TraceCheckUtils]: 144: Hoare triple {184250#(< ~counter~0 48)} assume !(~r~0 > 0); {184250#(< ~counter~0 48)} is VALID [2022-04-15 15:22:49,141 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {183661#true} {184250#(< ~counter~0 48)} #96#return; {184250#(< ~counter~0 48)} is VALID [2022-04-15 15:22:49,141 INFO L290 TraceCheckUtils]: 142: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,141 INFO L290 TraceCheckUtils]: 141: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,141 INFO L290 TraceCheckUtils]: 140: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,141 INFO L272 TraceCheckUtils]: 139: Hoare triple {184250#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:22:49,141 INFO L290 TraceCheckUtils]: 138: Hoare triple {184250#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {184250#(< ~counter~0 48)} is VALID [2022-04-15 15:22:49,143 INFO L290 TraceCheckUtils]: 137: Hoare triple {184275#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184250#(< ~counter~0 48)} is VALID [2022-04-15 15:22:49,143 INFO L290 TraceCheckUtils]: 136: Hoare triple {184275#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184275#(< ~counter~0 47)} is VALID [2022-04-15 15:22:49,143 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {183661#true} {184275#(< ~counter~0 47)} #96#return; {184275#(< ~counter~0 47)} is VALID [2022-04-15 15:22:49,143 INFO L290 TraceCheckUtils]: 134: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,144 INFO L290 TraceCheckUtils]: 133: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,144 INFO L290 TraceCheckUtils]: 132: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,144 INFO L272 TraceCheckUtils]: 131: Hoare triple {184275#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:22:49,144 INFO L290 TraceCheckUtils]: 130: Hoare triple {184275#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {184275#(< ~counter~0 47)} is VALID [2022-04-15 15:22:49,145 INFO L290 TraceCheckUtils]: 129: Hoare triple {184300#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184275#(< ~counter~0 47)} is VALID [2022-04-15 15:22:49,146 INFO L290 TraceCheckUtils]: 128: Hoare triple {184300#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184300#(< ~counter~0 46)} is VALID [2022-04-15 15:22:49,146 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {183661#true} {184300#(< ~counter~0 46)} #96#return; {184300#(< ~counter~0 46)} is VALID [2022-04-15 15:22:49,146 INFO L290 TraceCheckUtils]: 126: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,146 INFO L290 TraceCheckUtils]: 125: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,146 INFO L290 TraceCheckUtils]: 124: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,146 INFO L272 TraceCheckUtils]: 123: Hoare triple {184300#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:22:49,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {184300#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {184300#(< ~counter~0 46)} is VALID [2022-04-15 15:22:49,148 INFO L290 TraceCheckUtils]: 121: Hoare triple {184325#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184300#(< ~counter~0 46)} is VALID [2022-04-15 15:22:49,148 INFO L290 TraceCheckUtils]: 120: Hoare triple {184325#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184325#(< ~counter~0 45)} is VALID [2022-04-15 15:22:49,149 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {183661#true} {184325#(< ~counter~0 45)} #96#return; {184325#(< ~counter~0 45)} is VALID [2022-04-15 15:22:49,149 INFO L290 TraceCheckUtils]: 118: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,149 INFO L290 TraceCheckUtils]: 117: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,149 INFO L290 TraceCheckUtils]: 116: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,149 INFO L272 TraceCheckUtils]: 115: Hoare triple {184325#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:22:49,149 INFO L290 TraceCheckUtils]: 114: Hoare triple {184325#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {184325#(< ~counter~0 45)} is VALID [2022-04-15 15:22:49,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {184350#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184325#(< ~counter~0 45)} is VALID [2022-04-15 15:22:49,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {184350#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184350#(< ~counter~0 44)} is VALID [2022-04-15 15:22:49,152 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {183661#true} {184350#(< ~counter~0 44)} #96#return; {184350#(< ~counter~0 44)} is VALID [2022-04-15 15:22:49,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,152 INFO L290 TraceCheckUtils]: 108: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,152 INFO L272 TraceCheckUtils]: 107: Hoare triple {184350#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:22:49,152 INFO L290 TraceCheckUtils]: 106: Hoare triple {184350#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {184350#(< ~counter~0 44)} is VALID [2022-04-15 15:22:49,154 INFO L290 TraceCheckUtils]: 105: Hoare triple {184375#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184350#(< ~counter~0 44)} is VALID [2022-04-15 15:22:49,154 INFO L290 TraceCheckUtils]: 104: Hoare triple {184375#(< ~counter~0 43)} assume !!(0 != ~r~0); {184375#(< ~counter~0 43)} is VALID [2022-04-15 15:22:49,154 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {183661#true} {184375#(< ~counter~0 43)} #94#return; {184375#(< ~counter~0 43)} is VALID [2022-04-15 15:22:49,154 INFO L290 TraceCheckUtils]: 102: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,155 INFO L290 TraceCheckUtils]: 101: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,155 INFO L290 TraceCheckUtils]: 100: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,155 INFO L272 TraceCheckUtils]: 99: Hoare triple {184375#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:22:49,155 INFO L290 TraceCheckUtils]: 98: Hoare triple {184375#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {184375#(< ~counter~0 43)} is VALID [2022-04-15 15:22:49,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {184400#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184375#(< ~counter~0 43)} is VALID [2022-04-15 15:22:49,157 INFO L290 TraceCheckUtils]: 96: Hoare triple {184400#(< ~counter~0 42)} assume !(~r~0 < 0); {184400#(< ~counter~0 42)} is VALID [2022-04-15 15:22:49,157 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {183661#true} {184400#(< ~counter~0 42)} #98#return; {184400#(< ~counter~0 42)} is VALID [2022-04-15 15:22:49,157 INFO L290 TraceCheckUtils]: 94: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,157 INFO L290 TraceCheckUtils]: 93: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,157 INFO L290 TraceCheckUtils]: 92: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,157 INFO L272 TraceCheckUtils]: 91: Hoare triple {184400#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:22:49,158 INFO L290 TraceCheckUtils]: 90: Hoare triple {184400#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {184400#(< ~counter~0 42)} is VALID [2022-04-15 15:22:49,159 INFO L290 TraceCheckUtils]: 89: Hoare triple {184425#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184400#(< ~counter~0 42)} is VALID [2022-04-15 15:22:49,159 INFO L290 TraceCheckUtils]: 88: Hoare triple {184425#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184425#(< ~counter~0 41)} is VALID [2022-04-15 15:22:49,160 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {183661#true} {184425#(< ~counter~0 41)} #98#return; {184425#(< ~counter~0 41)} is VALID [2022-04-15 15:22:49,160 INFO L290 TraceCheckUtils]: 86: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,160 INFO L272 TraceCheckUtils]: 83: Hoare triple {184425#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:22:49,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {184425#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {184425#(< ~counter~0 41)} is VALID [2022-04-15 15:22:49,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {184450#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184425#(< ~counter~0 41)} is VALID [2022-04-15 15:22:49,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {184450#(< ~counter~0 40)} assume !(~r~0 > 0); {184450#(< ~counter~0 40)} is VALID [2022-04-15 15:22:49,163 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {183661#true} {184450#(< ~counter~0 40)} #96#return; {184450#(< ~counter~0 40)} is VALID [2022-04-15 15:22:49,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,163 INFO L272 TraceCheckUtils]: 75: Hoare triple {184450#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:22:49,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {184450#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {184450#(< ~counter~0 40)} is VALID [2022-04-15 15:22:49,165 INFO L290 TraceCheckUtils]: 73: Hoare triple {184475#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184450#(< ~counter~0 40)} is VALID [2022-04-15 15:22:49,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {184475#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184475#(< ~counter~0 39)} is VALID [2022-04-15 15:22:49,165 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {183661#true} {184475#(< ~counter~0 39)} #96#return; {184475#(< ~counter~0 39)} is VALID [2022-04-15 15:22:49,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,166 INFO L272 TraceCheckUtils]: 67: Hoare triple {184475#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:22:49,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {184475#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {184475#(< ~counter~0 39)} is VALID [2022-04-15 15:22:49,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {184500#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184475#(< ~counter~0 39)} is VALID [2022-04-15 15:22:49,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {184500#(< ~counter~0 38)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {184500#(< ~counter~0 38)} is VALID [2022-04-15 15:22:49,168 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {183661#true} {184500#(< ~counter~0 38)} #96#return; {184500#(< ~counter~0 38)} is VALID [2022-04-15 15:22:49,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {184500#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:22:49,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {184500#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {184500#(< ~counter~0 38)} is VALID [2022-04-15 15:22:49,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {184525#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184500#(< ~counter~0 38)} is VALID [2022-04-15 15:22:49,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {184525#(< ~counter~0 37)} assume !!(0 != ~r~0); {184525#(< ~counter~0 37)} is VALID [2022-04-15 15:22:49,171 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {183661#true} {184525#(< ~counter~0 37)} #94#return; {184525#(< ~counter~0 37)} is VALID [2022-04-15 15:22:49,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,171 INFO L290 TraceCheckUtils]: 52: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,171 INFO L272 TraceCheckUtils]: 51: Hoare triple {184525#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:22:49,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {184525#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {184525#(< ~counter~0 37)} is VALID [2022-04-15 15:22:49,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {184550#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184525#(< ~counter~0 37)} is VALID [2022-04-15 15:22:49,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {184550#(< ~counter~0 36)} assume !(~r~0 < 0); {184550#(< ~counter~0 36)} is VALID [2022-04-15 15:22:49,174 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {183661#true} {184550#(< ~counter~0 36)} #98#return; {184550#(< ~counter~0 36)} is VALID [2022-04-15 15:22:49,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,174 INFO L290 TraceCheckUtils]: 45: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,174 INFO L290 TraceCheckUtils]: 44: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,174 INFO L272 TraceCheckUtils]: 43: Hoare triple {184550#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:22:49,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {184550#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {184550#(< ~counter~0 36)} is VALID [2022-04-15 15:22:49,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {184575#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184550#(< ~counter~0 36)} is VALID [2022-04-15 15:22:49,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {184575#(< ~counter~0 35)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184575#(< ~counter~0 35)} is VALID [2022-04-15 15:22:49,177 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {183661#true} {184575#(< ~counter~0 35)} #98#return; {184575#(< ~counter~0 35)} is VALID [2022-04-15 15:22:49,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,177 INFO L272 TraceCheckUtils]: 35: Hoare triple {184575#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:22:49,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {184575#(< ~counter~0 35)} assume !!(#t~post8 < 50);havoc #t~post8; {184575#(< ~counter~0 35)} is VALID [2022-04-15 15:22:49,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {184600#(< ~counter~0 34)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184575#(< ~counter~0 35)} is VALID [2022-04-15 15:22:49,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {184600#(< ~counter~0 34)} assume !(~r~0 > 0); {184600#(< ~counter~0 34)} is VALID [2022-04-15 15:22:49,179 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {183661#true} {184600#(< ~counter~0 34)} #96#return; {184600#(< ~counter~0 34)} is VALID [2022-04-15 15:22:49,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,180 INFO L272 TraceCheckUtils]: 27: Hoare triple {184600#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:22:49,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {184600#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {184600#(< ~counter~0 34)} is VALID [2022-04-15 15:22:49,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {184625#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184600#(< ~counter~0 34)} is VALID [2022-04-15 15:22:49,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {184625#(< ~counter~0 33)} assume !!(0 != ~r~0); {184625#(< ~counter~0 33)} is VALID [2022-04-15 15:22:49,182 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {183661#true} {184625#(< ~counter~0 33)} #94#return; {184625#(< ~counter~0 33)} is VALID [2022-04-15 15:22:49,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,182 INFO L272 TraceCheckUtils]: 19: Hoare triple {184625#(< ~counter~0 33)} call __VERIFIER_assert((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-15 15:22:49,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {184625#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {184625#(< ~counter~0 33)} is VALID [2022-04-15 15:22:49,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {184650#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184625#(< ~counter~0 33)} is VALID [2022-04-15 15:22:49,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {184650#(< ~counter~0 32)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,185 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183661#true} {184650#(< ~counter~0 32)} #92#return; {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,185 INFO L272 TraceCheckUtils]: 11: Hoare triple {184650#(< ~counter~0 32)} call assume_abort_if_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-15 15:22:49,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {183661#true} {184650#(< ~counter~0 32)} #90#return; {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {183661#true} assume true; {183661#true} is VALID [2022-04-15 15:22:49,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {183661#true} assume !(0 == ~cond); {183661#true} is VALID [2022-04-15 15:22:49,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {183661#true} ~cond := #in~cond; {183661#true} is VALID [2022-04-15 15:22:49,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {184650#(< ~counter~0 32)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {183661#true} is VALID [2022-04-15 15:22:49,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {184650#(< ~counter~0 32)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 32)} is VALID [2022-04-15 15:22:49,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {184650#(< ~counter~0 32)} call #t~ret9 := main(); {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184650#(< ~counter~0 32)} {183661#true} #102#return; {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {184650#(< ~counter~0 32)} assume true; {184650#(< ~counter~0 32)} is VALID [2022-04-15 15:22:49,187 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 32)} is VALID [2022-04-15 15:22:49,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {183661#true} call ULTIMATE.init(); {183661#true} is VALID [2022-04-15 15:22:49,188 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-15 15:22:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:22:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012452053] [2022-04-15 15:22:49,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:22:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782877297] [2022-04-15 15:22:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782877297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:22:49,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:22:49,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:22:49,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:22:49,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1913749942] [2022-04-15 15:22:49,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1913749942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:22:49,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:22:49,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:22:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121726867] [2022-04-15 15:22:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:22:49,189 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-15 15:22:49,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:22:49,189 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-15 15:22:49,415 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-15 15:22:49,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:22:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:49,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:22:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:22:49,416 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-15 15:22:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:55,847 INFO L93 Difference]: Finished difference Result 958 states and 1274 transitions. [2022-04-15 15:22:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 15:22:55,847 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-15 15:22:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:55,847 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-15 15:22:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-15 15:22:55,851 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-15 15:22:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-15 15:22:55,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-15 15:22:56,434 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-15 15:22:56,473 INFO L225 Difference]: With dead ends: 958 [2022-04-15 15:22:56,474 INFO L226 Difference]: Without dead ends: 953 [2022-04-15 15:22:56,474 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-15 15:22:56,474 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 352 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:56,474 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.8s Time] [2022-04-15 15:22:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-15 15:23:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 931. [2022-04-15 15:23:00,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:23:00,215 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-15 15:23:00,216 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-15 15:23:00,217 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-15 15:23:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:00,243 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-15 15:23:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-15 15:23:00,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:00,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:00,245 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-15 15:23:00,245 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-15 15:23:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:00,280 INFO L93 Difference]: Finished difference Result 953 states and 1268 transitions. [2022-04-15 15:23:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1268 transitions. [2022-04-15 15:23:00,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:00,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:00,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:23:00,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:23:00,282 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-15 15:23:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1242 transitions. [2022-04-15 15:23:00,319 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1242 transitions. Word has length 167 [2022-04-15 15:23:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:23:00,319 INFO L478 AbstractCegarLoop]: Abstraction has 931 states and 1242 transitions. [2022-04-15 15:23:00,320 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-15 15:23:00,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 931 states and 1242 transitions. [2022-04-15 15:23:11,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1242 edges. 1240 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:23:11,077 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1242 transitions. [2022-04-15 15:23:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-15 15:23:11,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:23:11,079 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-15 15:23:11,101 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-15 15:23:11,291 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-15 15:23:11,291 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:23:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:23:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-15 15:23:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:23:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864934636] [2022-04-15 15:23:11,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:23:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-15 15:23:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:23:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296973153] [2022-04-15 15:23:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:23:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:23:11,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:23:11,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049500018] [2022-04-15 15:23:11,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:23:11,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:23:11,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:23:11,308 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-15 15:23:11,309 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-15 15:23:11,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:23:11,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:23:11,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:23:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:23:11,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:23:12,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {190418#true} call ULTIMATE.init(); {190418#true} is VALID [2022-04-15 15:23:12,345 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-15 15:23:12,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190426#(<= ~counter~0 0)} {190418#true} #102#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {190426#(<= ~counter~0 0)} call #t~ret9 := main(); {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,346 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-15 15:23:12,346 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-15 15:23:12,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {190426#(<= ~counter~0 0)} ~cond := #in~cond; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {190426#(<= ~counter~0 0)} assume !(0 == ~cond); {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190426#(<= ~counter~0 0)} {190426#(<= ~counter~0 0)} #90#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,348 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-15 15:23:12,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {190426#(<= ~counter~0 0)} ~cond := #in~cond; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {190426#(<= ~counter~0 0)} assume !(0 == ~cond); {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {190426#(<= ~counter~0 0)} assume true; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190426#(<= ~counter~0 0)} {190426#(<= ~counter~0 0)} #92#return; {190426#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:12,349 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-15 15:23:12,353 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-15 15:23:12,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {190475#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,354 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-15 15:23:12,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {190475#(<= ~counter~0 1)} ~cond := #in~cond; {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {190475#(<= ~counter~0 1)} assume !(0 == ~cond); {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {190475#(<= ~counter~0 1)} assume true; {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,355 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190475#(<= ~counter~0 1)} {190475#(<= ~counter~0 1)} #94#return; {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {190475#(<= ~counter~0 1)} assume !!(0 != ~r~0); {190475#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:12,357 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-15 15:23:12,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {190500#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,358 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-15 15:23:12,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {190500#(<= ~counter~0 2)} ~cond := #in~cond; {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {190500#(<= ~counter~0 2)} assume !(0 == ~cond); {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {190500#(<= ~counter~0 2)} assume true; {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,359 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190500#(<= ~counter~0 2)} {190500#(<= ~counter~0 2)} #96#return; {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {190500#(<= ~counter~0 2)} assume !(~r~0 > 0); {190500#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:12,361 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-15 15:23:12,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {190525#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {190525#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:12,362 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-15 15:23:12,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {190525#(<= ~counter~0 3)} ~cond := #in~cond; {190525#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:12,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {190525#(<= ~counter~0 3)} assume !(0 == ~cond); {190525#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:12,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {190525#(<= ~counter~0 3)} assume true; {190525#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:12,363 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190525#(<= ~counter~0 3)} {190525#(<= ~counter~0 3)} #98#return; {190525#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:12,363 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-15 15:23:12,365 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-15 15:23:12,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {190550#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,365 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-15 15:23:12,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {190550#(<= ~counter~0 4)} ~cond := #in~cond; {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {190550#(<= ~counter~0 4)} assume !(0 == ~cond); {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {190550#(<= ~counter~0 4)} assume true; {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,367 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190550#(<= ~counter~0 4)} {190550#(<= ~counter~0 4)} #98#return; {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {190550#(<= ~counter~0 4)} assume !(~r~0 < 0); {190550#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:12,368 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-15 15:23:12,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {190575#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,369 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-15 15:23:12,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {190575#(<= ~counter~0 5)} ~cond := #in~cond; {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {190575#(<= ~counter~0 5)} assume !(0 == ~cond); {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {190575#(<= ~counter~0 5)} assume true; {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,370 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190575#(<= ~counter~0 5)} {190575#(<= ~counter~0 5)} #94#return; {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {190575#(<= ~counter~0 5)} assume !!(0 != ~r~0); {190575#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:12,372 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-15 15:23:12,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {190600#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {190600#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:12,373 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-15 15:23:12,373 INFO L290 TraceCheckUtils]: 60: Hoare triple {190600#(<= ~counter~0 6)} ~cond := #in~cond; {190600#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:12,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {190600#(<= ~counter~0 6)} assume !(0 == ~cond); {190600#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:12,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {190600#(<= ~counter~0 6)} assume true; {190600#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:12,374 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190600#(<= ~counter~0 6)} {190600#(<= ~counter~0 6)} #96#return; {190600#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:12,374 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-15 15:23:12,376 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-15 15:23:12,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {190625#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {190625#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:12,377 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-15 15:23:12,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {190625#(<= ~counter~0 7)} ~cond := #in~cond; {190625#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:12,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {190625#(<= ~counter~0 7)} assume !(0 == ~cond); {190625#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:12,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {190625#(<= ~counter~0 7)} assume true; {190625#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:12,378 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190625#(<= ~counter~0 7)} {190625#(<= ~counter~0 7)} #96#return; {190625#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:12,378 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-15 15:23:12,380 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-15 15:23:12,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {190650#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,381 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-15 15:23:12,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {190650#(<= ~counter~0 8)} ~cond := #in~cond; {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,381 INFO L290 TraceCheckUtils]: 77: Hoare triple {190650#(<= ~counter~0 8)} assume !(0 == ~cond); {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,381 INFO L290 TraceCheckUtils]: 78: Hoare triple {190650#(<= ~counter~0 8)} assume true; {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,382 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190650#(<= ~counter~0 8)} {190650#(<= ~counter~0 8)} #96#return; {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {190650#(<= ~counter~0 8)} assume !(~r~0 > 0); {190650#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:12,384 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-15 15:23:12,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {190675#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {190675#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:12,384 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-15 15:23:12,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {190675#(<= ~counter~0 9)} ~cond := #in~cond; {190675#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:12,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {190675#(<= ~counter~0 9)} assume !(0 == ~cond); {190675#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:12,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {190675#(<= ~counter~0 9)} assume true; {190675#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:12,386 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190675#(<= ~counter~0 9)} {190675#(<= ~counter~0 9)} #98#return; {190675#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:12,386 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-15 15:23:12,387 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-15 15:23:12,388 INFO L290 TraceCheckUtils]: 90: Hoare triple {190700#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,388 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-15 15:23:12,388 INFO L290 TraceCheckUtils]: 92: Hoare triple {190700#(<= ~counter~0 10)} ~cond := #in~cond; {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,389 INFO L290 TraceCheckUtils]: 93: Hoare triple {190700#(<= ~counter~0 10)} assume !(0 == ~cond); {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,389 INFO L290 TraceCheckUtils]: 94: Hoare triple {190700#(<= ~counter~0 10)} assume true; {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,389 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190700#(<= ~counter~0 10)} {190700#(<= ~counter~0 10)} #98#return; {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,390 INFO L290 TraceCheckUtils]: 96: Hoare triple {190700#(<= ~counter~0 10)} assume !(~r~0 < 0); {190700#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:12,391 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-15 15:23:12,392 INFO L290 TraceCheckUtils]: 98: Hoare triple {190725#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,392 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-15 15:23:12,392 INFO L290 TraceCheckUtils]: 100: Hoare triple {190725#(<= ~counter~0 11)} ~cond := #in~cond; {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,393 INFO L290 TraceCheckUtils]: 101: Hoare triple {190725#(<= ~counter~0 11)} assume !(0 == ~cond); {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,393 INFO L290 TraceCheckUtils]: 102: Hoare triple {190725#(<= ~counter~0 11)} assume true; {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,393 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190725#(<= ~counter~0 11)} {190725#(<= ~counter~0 11)} #94#return; {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {190725#(<= ~counter~0 11)} assume !!(0 != ~r~0); {190725#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:12,395 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-15 15:23:12,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {190750#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {190750#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:12,396 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-15 15:23:12,396 INFO L290 TraceCheckUtils]: 108: Hoare triple {190750#(<= ~counter~0 12)} ~cond := #in~cond; {190750#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:12,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {190750#(<= ~counter~0 12)} assume !(0 == ~cond); {190750#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:12,397 INFO L290 TraceCheckUtils]: 110: Hoare triple {190750#(<= ~counter~0 12)} assume true; {190750#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:12,397 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190750#(<= ~counter~0 12)} {190750#(<= ~counter~0 12)} #96#return; {190750#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:12,397 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-15 15:23:12,399 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-15 15:23:12,399 INFO L290 TraceCheckUtils]: 114: Hoare triple {190775#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {190775#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:12,400 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-15 15:23:12,400 INFO L290 TraceCheckUtils]: 116: Hoare triple {190775#(<= ~counter~0 13)} ~cond := #in~cond; {190775#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:12,400 INFO L290 TraceCheckUtils]: 117: Hoare triple {190775#(<= ~counter~0 13)} assume !(0 == ~cond); {190775#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:12,400 INFO L290 TraceCheckUtils]: 118: Hoare triple {190775#(<= ~counter~0 13)} assume true; {190775#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:12,401 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190775#(<= ~counter~0 13)} {190775#(<= ~counter~0 13)} #96#return; {190775#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:12,401 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-15 15:23:12,403 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-15 15:23:12,403 INFO L290 TraceCheckUtils]: 122: Hoare triple {190800#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {190800#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:12,403 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-15 15:23:12,404 INFO L290 TraceCheckUtils]: 124: Hoare triple {190800#(<= ~counter~0 14)} ~cond := #in~cond; {190800#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:12,404 INFO L290 TraceCheckUtils]: 125: Hoare triple {190800#(<= ~counter~0 14)} assume !(0 == ~cond); {190800#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:12,404 INFO L290 TraceCheckUtils]: 126: Hoare triple {190800#(<= ~counter~0 14)} assume true; {190800#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:12,405 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190800#(<= ~counter~0 14)} {190800#(<= ~counter~0 14)} #96#return; {190800#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:12,405 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-15 15:23:12,407 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-15 15:23:12,407 INFO L290 TraceCheckUtils]: 130: Hoare triple {190825#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {190825#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:12,407 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-15 15:23:12,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {190825#(<= ~counter~0 15)} ~cond := #in~cond; {190825#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:12,408 INFO L290 TraceCheckUtils]: 133: Hoare triple {190825#(<= ~counter~0 15)} assume !(0 == ~cond); {190825#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:12,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {190825#(<= ~counter~0 15)} assume true; {190825#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:12,409 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190825#(<= ~counter~0 15)} {190825#(<= ~counter~0 15)} #96#return; {190825#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:12,409 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-15 15:23:12,410 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-15 15:23:12,411 INFO L290 TraceCheckUtils]: 138: Hoare triple {190850#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {190850#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:12,411 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-15 15:23:12,412 INFO L290 TraceCheckUtils]: 140: Hoare triple {190850#(<= ~counter~0 16)} ~cond := #in~cond; {190850#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:12,412 INFO L290 TraceCheckUtils]: 141: Hoare triple {190850#(<= ~counter~0 16)} assume !(0 == ~cond); {190850#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:12,412 INFO L290 TraceCheckUtils]: 142: Hoare triple {190850#(<= ~counter~0 16)} assume true; {190850#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:12,413 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190850#(<= ~counter~0 16)} {190850#(<= ~counter~0 16)} #96#return; {190850#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:12,413 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-15 15:23:12,414 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-15 15:23:12,414 INFO L290 TraceCheckUtils]: 146: Hoare triple {190875#(<= ~counter~0 17)} assume !!(#t~post7 < 50);havoc #t~post7; {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,415 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-15 15:23:12,415 INFO L290 TraceCheckUtils]: 148: Hoare triple {190875#(<= ~counter~0 17)} ~cond := #in~cond; {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,415 INFO L290 TraceCheckUtils]: 149: Hoare triple {190875#(<= ~counter~0 17)} assume !(0 == ~cond); {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,416 INFO L290 TraceCheckUtils]: 150: Hoare triple {190875#(<= ~counter~0 17)} assume true; {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,416 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190875#(<= ~counter~0 17)} {190875#(<= ~counter~0 17)} #96#return; {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,417 INFO L290 TraceCheckUtils]: 152: Hoare triple {190875#(<= ~counter~0 17)} assume !(~r~0 > 0); {190875#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:12,418 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-15 15:23:12,418 INFO L290 TraceCheckUtils]: 154: Hoare triple {190900#(<= ~counter~0 18)} assume !!(#t~post8 < 50);havoc #t~post8; {190900#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:12,419 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-15 15:23:12,419 INFO L290 TraceCheckUtils]: 156: Hoare triple {190900#(<= ~counter~0 18)} ~cond := #in~cond; {190900#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:12,419 INFO L290 TraceCheckUtils]: 157: Hoare triple {190900#(<= ~counter~0 18)} assume !(0 == ~cond); {190900#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:12,420 INFO L290 TraceCheckUtils]: 158: Hoare triple {190900#(<= ~counter~0 18)} assume true; {190900#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:12,420 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190900#(<= ~counter~0 18)} {190900#(<= ~counter~0 18)} #98#return; {190900#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:12,420 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-15 15:23:12,421 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-15 15:23:12,421 INFO L290 TraceCheckUtils]: 162: Hoare triple {190925#(<= |main_#t~post8| 18)} assume !(#t~post8 < 50);havoc #t~post8; {190419#false} is VALID [2022-04-15 15:23:12,421 INFO L290 TraceCheckUtils]: 163: Hoare triple {190419#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190419#false} is VALID [2022-04-15 15:23:12,421 INFO L290 TraceCheckUtils]: 164: Hoare triple {190419#false} assume !(#t~post6 < 50);havoc #t~post6; {190419#false} is VALID [2022-04-15 15:23:12,421 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-15 15:23:12,421 INFO L290 TraceCheckUtils]: 166: Hoare triple {190419#false} ~cond := #in~cond; {190419#false} is VALID [2022-04-15 15:23:12,421 INFO L290 TraceCheckUtils]: 167: Hoare triple {190419#false} assume 0 == ~cond; {190419#false} is VALID [2022-04-15 15:23:12,421 INFO L290 TraceCheckUtils]: 168: Hoare triple {190419#false} assume !false; {190419#false} is VALID [2022-04-15 15:23:12,422 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-15 15:23:12,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:23:13,514 INFO L290 TraceCheckUtils]: 168: Hoare triple {190419#false} assume !false; {190419#false} is VALID [2022-04-15 15:23:13,514 INFO L290 TraceCheckUtils]: 167: Hoare triple {190419#false} assume 0 == ~cond; {190419#false} is VALID [2022-04-15 15:23:13,515 INFO L290 TraceCheckUtils]: 166: Hoare triple {190419#false} ~cond := #in~cond; {190419#false} is VALID [2022-04-15 15:23:13,515 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-15 15:23:13,515 INFO L290 TraceCheckUtils]: 164: Hoare triple {190419#false} assume !(#t~post6 < 50);havoc #t~post6; {190419#false} is VALID [2022-04-15 15:23:13,515 INFO L290 TraceCheckUtils]: 163: Hoare triple {190419#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {190419#false} is VALID [2022-04-15 15:23:13,515 INFO L290 TraceCheckUtils]: 162: Hoare triple {190965#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {190419#false} is VALID [2022-04-15 15:23:13,515 INFO L290 TraceCheckUtils]: 161: Hoare triple {190969#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190965#(< |main_#t~post8| 50)} is VALID [2022-04-15 15:23:13,516 INFO L290 TraceCheckUtils]: 160: Hoare triple {190969#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {190969#(< ~counter~0 50)} is VALID [2022-04-15 15:23:13,516 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {190418#true} {190969#(< ~counter~0 50)} #98#return; {190969#(< ~counter~0 50)} is VALID [2022-04-15 15:23:13,516 INFO L290 TraceCheckUtils]: 158: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,516 INFO L290 TraceCheckUtils]: 157: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,516 INFO L290 TraceCheckUtils]: 156: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,516 INFO L272 TraceCheckUtils]: 155: Hoare triple {190969#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:23:13,517 INFO L290 TraceCheckUtils]: 154: Hoare triple {190969#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {190969#(< ~counter~0 50)} is VALID [2022-04-15 15:23:13,521 INFO L290 TraceCheckUtils]: 153: Hoare triple {190994#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {190969#(< ~counter~0 50)} is VALID [2022-04-15 15:23:13,521 INFO L290 TraceCheckUtils]: 152: Hoare triple {190994#(< ~counter~0 49)} assume !(~r~0 > 0); {190994#(< ~counter~0 49)} is VALID [2022-04-15 15:23:13,521 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {190418#true} {190994#(< ~counter~0 49)} #96#return; {190994#(< ~counter~0 49)} is VALID [2022-04-15 15:23:13,521 INFO L290 TraceCheckUtils]: 150: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,522 INFO L290 TraceCheckUtils]: 149: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,522 INFO L290 TraceCheckUtils]: 148: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,522 INFO L272 TraceCheckUtils]: 147: Hoare triple {190994#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:23:13,522 INFO L290 TraceCheckUtils]: 146: Hoare triple {190994#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {190994#(< ~counter~0 49)} is VALID [2022-04-15 15:23:13,524 INFO L290 TraceCheckUtils]: 145: Hoare triple {191019#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {190994#(< ~counter~0 49)} is VALID [2022-04-15 15:23:13,524 INFO L290 TraceCheckUtils]: 144: Hoare triple {191019#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191019#(< ~counter~0 48)} is VALID [2022-04-15 15:23:13,524 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {190418#true} {191019#(< ~counter~0 48)} #96#return; {191019#(< ~counter~0 48)} is VALID [2022-04-15 15:23:13,524 INFO L290 TraceCheckUtils]: 142: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,525 INFO L290 TraceCheckUtils]: 141: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,525 INFO L290 TraceCheckUtils]: 140: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,525 INFO L272 TraceCheckUtils]: 139: Hoare triple {191019#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:23:13,525 INFO L290 TraceCheckUtils]: 138: Hoare triple {191019#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {191019#(< ~counter~0 48)} is VALID [2022-04-15 15:23:13,526 INFO L290 TraceCheckUtils]: 137: Hoare triple {191044#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191019#(< ~counter~0 48)} is VALID [2022-04-15 15:23:13,527 INFO L290 TraceCheckUtils]: 136: Hoare triple {191044#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191044#(< ~counter~0 47)} is VALID [2022-04-15 15:23:13,527 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {190418#true} {191044#(< ~counter~0 47)} #96#return; {191044#(< ~counter~0 47)} is VALID [2022-04-15 15:23:13,527 INFO L290 TraceCheckUtils]: 134: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,527 INFO L290 TraceCheckUtils]: 133: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,527 INFO L290 TraceCheckUtils]: 132: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,528 INFO L272 TraceCheckUtils]: 131: Hoare triple {191044#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:23:13,528 INFO L290 TraceCheckUtils]: 130: Hoare triple {191044#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {191044#(< ~counter~0 47)} is VALID [2022-04-15 15:23:13,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {191069#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191044#(< ~counter~0 47)} is VALID [2022-04-15 15:23:13,530 INFO L290 TraceCheckUtils]: 128: Hoare triple {191069#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191069#(< ~counter~0 46)} is VALID [2022-04-15 15:23:13,530 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {190418#true} {191069#(< ~counter~0 46)} #96#return; {191069#(< ~counter~0 46)} is VALID [2022-04-15 15:23:13,530 INFO L290 TraceCheckUtils]: 126: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,530 INFO L290 TraceCheckUtils]: 125: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,530 INFO L290 TraceCheckUtils]: 124: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,530 INFO L272 TraceCheckUtils]: 123: Hoare triple {191069#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:23:13,531 INFO L290 TraceCheckUtils]: 122: Hoare triple {191069#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {191069#(< ~counter~0 46)} is VALID [2022-04-15 15:23:13,532 INFO L290 TraceCheckUtils]: 121: Hoare triple {191094#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191069#(< ~counter~0 46)} is VALID [2022-04-15 15:23:13,532 INFO L290 TraceCheckUtils]: 120: Hoare triple {191094#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191094#(< ~counter~0 45)} is VALID [2022-04-15 15:23:13,533 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {190418#true} {191094#(< ~counter~0 45)} #96#return; {191094#(< ~counter~0 45)} is VALID [2022-04-15 15:23:13,533 INFO L290 TraceCheckUtils]: 118: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,533 INFO L272 TraceCheckUtils]: 115: Hoare triple {191094#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:23:13,533 INFO L290 TraceCheckUtils]: 114: Hoare triple {191094#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {191094#(< ~counter~0 45)} is VALID [2022-04-15 15:23:13,535 INFO L290 TraceCheckUtils]: 113: Hoare triple {191119#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191094#(< ~counter~0 45)} is VALID [2022-04-15 15:23:13,535 INFO L290 TraceCheckUtils]: 112: Hoare triple {191119#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191119#(< ~counter~0 44)} is VALID [2022-04-15 15:23:13,536 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {190418#true} {191119#(< ~counter~0 44)} #96#return; {191119#(< ~counter~0 44)} is VALID [2022-04-15 15:23:13,536 INFO L290 TraceCheckUtils]: 110: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,536 INFO L290 TraceCheckUtils]: 109: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,536 INFO L290 TraceCheckUtils]: 108: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,536 INFO L272 TraceCheckUtils]: 107: Hoare triple {191119#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:23:13,536 INFO L290 TraceCheckUtils]: 106: Hoare triple {191119#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {191119#(< ~counter~0 44)} is VALID [2022-04-15 15:23:13,538 INFO L290 TraceCheckUtils]: 105: Hoare triple {191144#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191119#(< ~counter~0 44)} is VALID [2022-04-15 15:23:13,538 INFO L290 TraceCheckUtils]: 104: Hoare triple {191144#(< ~counter~0 43)} assume !!(0 != ~r~0); {191144#(< ~counter~0 43)} is VALID [2022-04-15 15:23:13,538 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {190418#true} {191144#(< ~counter~0 43)} #94#return; {191144#(< ~counter~0 43)} is VALID [2022-04-15 15:23:13,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,539 INFO L272 TraceCheckUtils]: 99: Hoare triple {191144#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:23:13,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {191144#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {191144#(< ~counter~0 43)} is VALID [2022-04-15 15:23:13,541 INFO L290 TraceCheckUtils]: 97: Hoare triple {191169#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191144#(< ~counter~0 43)} is VALID [2022-04-15 15:23:13,542 INFO L290 TraceCheckUtils]: 96: Hoare triple {191169#(< ~counter~0 42)} assume !(~r~0 < 0); {191169#(< ~counter~0 42)} is VALID [2022-04-15 15:23:13,542 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {190418#true} {191169#(< ~counter~0 42)} #98#return; {191169#(< ~counter~0 42)} is VALID [2022-04-15 15:23:13,542 INFO L290 TraceCheckUtils]: 94: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,542 INFO L290 TraceCheckUtils]: 93: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,542 INFO L290 TraceCheckUtils]: 92: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,543 INFO L272 TraceCheckUtils]: 91: Hoare triple {191169#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:23:13,543 INFO L290 TraceCheckUtils]: 90: Hoare triple {191169#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {191169#(< ~counter~0 42)} is VALID [2022-04-15 15:23:13,545 INFO L290 TraceCheckUtils]: 89: Hoare triple {191194#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191169#(< ~counter~0 42)} is VALID [2022-04-15 15:23:13,545 INFO L290 TraceCheckUtils]: 88: Hoare triple {191194#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191194#(< ~counter~0 41)} is VALID [2022-04-15 15:23:13,545 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {190418#true} {191194#(< ~counter~0 41)} #98#return; {191194#(< ~counter~0 41)} is VALID [2022-04-15 15:23:13,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,546 INFO L272 TraceCheckUtils]: 83: Hoare triple {191194#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:23:13,546 INFO L290 TraceCheckUtils]: 82: Hoare triple {191194#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {191194#(< ~counter~0 41)} is VALID [2022-04-15 15:23:13,548 INFO L290 TraceCheckUtils]: 81: Hoare triple {191219#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191194#(< ~counter~0 41)} is VALID [2022-04-15 15:23:13,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {191219#(< ~counter~0 40)} assume !(~r~0 > 0); {191219#(< ~counter~0 40)} is VALID [2022-04-15 15:23:13,548 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {190418#true} {191219#(< ~counter~0 40)} #96#return; {191219#(< ~counter~0 40)} is VALID [2022-04-15 15:23:13,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,549 INFO L290 TraceCheckUtils]: 77: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,549 INFO L290 TraceCheckUtils]: 76: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,549 INFO L272 TraceCheckUtils]: 75: Hoare triple {191219#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:23:13,549 INFO L290 TraceCheckUtils]: 74: Hoare triple {191219#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {191219#(< ~counter~0 40)} is VALID [2022-04-15 15:23:13,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {191244#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191219#(< ~counter~0 40)} is VALID [2022-04-15 15:23:13,551 INFO L290 TraceCheckUtils]: 72: Hoare triple {191244#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191244#(< ~counter~0 39)} is VALID [2022-04-15 15:23:13,551 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {190418#true} {191244#(< ~counter~0 39)} #96#return; {191244#(< ~counter~0 39)} is VALID [2022-04-15 15:23:13,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,551 INFO L290 TraceCheckUtils]: 69: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,551 INFO L290 TraceCheckUtils]: 68: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,551 INFO L272 TraceCheckUtils]: 67: Hoare triple {191244#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:23:13,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {191244#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {191244#(< ~counter~0 39)} is VALID [2022-04-15 15:23:13,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {191269#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191244#(< ~counter~0 39)} is VALID [2022-04-15 15:23:13,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {191269#(< ~counter~0 38)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191269#(< ~counter~0 38)} is VALID [2022-04-15 15:23:13,554 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {190418#true} {191269#(< ~counter~0 38)} #96#return; {191269#(< ~counter~0 38)} is VALID [2022-04-15 15:23:13,554 INFO L290 TraceCheckUtils]: 62: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,554 INFO L290 TraceCheckUtils]: 61: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,554 INFO L290 TraceCheckUtils]: 60: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,554 INFO L272 TraceCheckUtils]: 59: Hoare triple {191269#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:23:13,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {191269#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {191269#(< ~counter~0 38)} is VALID [2022-04-15 15:23:13,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {191294#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191269#(< ~counter~0 38)} is VALID [2022-04-15 15:23:13,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {191294#(< ~counter~0 37)} assume !!(0 != ~r~0); {191294#(< ~counter~0 37)} is VALID [2022-04-15 15:23:13,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {190418#true} {191294#(< ~counter~0 37)} #94#return; {191294#(< ~counter~0 37)} is VALID [2022-04-15 15:23:13,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,557 INFO L272 TraceCheckUtils]: 51: Hoare triple {191294#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:23:13,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {191294#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {191294#(< ~counter~0 37)} is VALID [2022-04-15 15:23:13,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {191319#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191294#(< ~counter~0 37)} is VALID [2022-04-15 15:23:13,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {191319#(< ~counter~0 36)} assume !(~r~0 < 0); {191319#(< ~counter~0 36)} is VALID [2022-04-15 15:23:13,560 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {190418#true} {191319#(< ~counter~0 36)} #98#return; {191319#(< ~counter~0 36)} is VALID [2022-04-15 15:23:13,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {191319#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:23:13,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {191319#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {191319#(< ~counter~0 36)} is VALID [2022-04-15 15:23:13,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {191344#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191319#(< ~counter~0 36)} is VALID [2022-04-15 15:23:13,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {191344#(< ~counter~0 35)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191344#(< ~counter~0 35)} is VALID [2022-04-15 15:23:13,563 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {190418#true} {191344#(< ~counter~0 35)} #98#return; {191344#(< ~counter~0 35)} is VALID [2022-04-15 15:23:13,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,563 INFO L272 TraceCheckUtils]: 35: Hoare triple {191344#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:23:13,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {191344#(< ~counter~0 35)} assume !!(#t~post8 < 50);havoc #t~post8; {191344#(< ~counter~0 35)} is VALID [2022-04-15 15:23:13,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {191369#(< ~counter~0 34)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191344#(< ~counter~0 35)} is VALID [2022-04-15 15:23:13,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {191369#(< ~counter~0 34)} assume !(~r~0 > 0); {191369#(< ~counter~0 34)} is VALID [2022-04-15 15:23:13,565 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {190418#true} {191369#(< ~counter~0 34)} #96#return; {191369#(< ~counter~0 34)} is VALID [2022-04-15 15:23:13,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,566 INFO L272 TraceCheckUtils]: 27: Hoare triple {191369#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:23:13,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {191369#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {191369#(< ~counter~0 34)} is VALID [2022-04-15 15:23:13,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {191394#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191369#(< ~counter~0 34)} is VALID [2022-04-15 15:23:13,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {191394#(< ~counter~0 33)} assume !!(0 != ~r~0); {191394#(< ~counter~0 33)} is VALID [2022-04-15 15:23:13,568 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {190418#true} {191394#(< ~counter~0 33)} #94#return; {191394#(< ~counter~0 33)} is VALID [2022-04-15 15:23:13,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {191394#(< ~counter~0 33)} call __VERIFIER_assert((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-15 15:23:13,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {191394#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {191394#(< ~counter~0 33)} is VALID [2022-04-15 15:23:13,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {191419#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191394#(< ~counter~0 33)} is VALID [2022-04-15 15:23:13,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {191419#(< ~counter~0 32)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,571 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {190418#true} {191419#(< ~counter~0 32)} #92#return; {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,571 INFO L272 TraceCheckUtils]: 11: Hoare triple {191419#(< ~counter~0 32)} call assume_abort_if_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-15 15:23:13,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {190418#true} {191419#(< ~counter~0 32)} #90#return; {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {190418#true} assume true; {190418#true} is VALID [2022-04-15 15:23:13,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {190418#true} assume !(0 == ~cond); {190418#true} is VALID [2022-04-15 15:23:13,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {190418#true} ~cond := #in~cond; {190418#true} is VALID [2022-04-15 15:23:13,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {191419#(< ~counter~0 32)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {190418#true} is VALID [2022-04-15 15:23:13,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {191419#(< ~counter~0 32)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 32)} is VALID [2022-04-15 15:23:13,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {191419#(< ~counter~0 32)} call #t~ret9 := main(); {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191419#(< ~counter~0 32)} {190418#true} #102#return; {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {191419#(< ~counter~0 32)} assume true; {191419#(< ~counter~0 32)} is VALID [2022-04-15 15:23:13,574 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 32)} is VALID [2022-04-15 15:23:13,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {190418#true} call ULTIMATE.init(); {190418#true} is VALID [2022-04-15 15:23:13,574 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-15 15:23:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:23:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296973153] [2022-04-15 15:23:13,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:23:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049500018] [2022-04-15 15:23:13,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049500018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:23:13,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:23:13,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:23:13,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:23:13,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864934636] [2022-04-15 15:23:13,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864934636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:23:13,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:23:13,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:23:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526585935] [2022-04-15 15:23:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:23:13,575 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-15 15:23:13,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:23:13,576 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-15 15:23:13,809 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-15 15:23:13,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:23:13,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:23:13,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:23:13,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:23:13,810 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-15 15:23:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:20,464 INFO L93 Difference]: Finished difference Result 1135 states and 1544 transitions. [2022-04-15 15:23:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 15:23:20,465 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-15 15:23:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:23:20,465 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-15 15:23:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-15 15:23:20,467 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-15 15:23:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-15 15:23:20,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-15 15:23:21,060 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-15 15:23:21,104 INFO L225 Difference]: With dead ends: 1135 [2022-04-15 15:23:21,104 INFO L226 Difference]: Without dead ends: 957 [2022-04-15 15:23:21,105 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-15 15:23:21,105 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 365 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:23:21,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 374 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 15:23:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-04-15 15:23:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 946. [2022-04-15 15:23:24,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:23:24,959 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-15 15:23:24,960 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-15 15:23:24,960 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-15 15:23:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:24,990 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-15 15:23:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-15 15:23:24,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:24,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:24,992 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-15 15:23:24,993 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-15 15:23:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:25,029 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-15 15:23:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-15 15:23:25,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:25,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:25,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:23:25,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:23:25,031 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-15 15:23:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1260 transitions. [2022-04-15 15:23:25,069 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1260 transitions. Word has length 169 [2022-04-15 15:23:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:23:25,069 INFO L478 AbstractCegarLoop]: Abstraction has 946 states and 1260 transitions. [2022-04-15 15:23:25,069 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-15 15:23:25,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 946 states and 1260 transitions. [2022-04-15 15:23:35,173 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-15 15:23:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1260 transitions. [2022-04-15 15:23:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 15:23:35,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:23:35,174 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-15 15:23:35,191 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-15 15:23:35,375 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-15 15:23:35,375 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:23:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:23:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 27 times [2022-04-15 15:23:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:23:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719245505] [2022-04-15 15:23:35,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:23:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 28 times [2022-04-15 15:23:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:23:35,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709271981] [2022-04-15 15:23:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:23:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:23:35,390 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:23:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765235155] [2022-04-15 15:23:35,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:23:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:23:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:23:35,391 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-15 15:23:35,398 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-15 15:23:35,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:23:35,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:23:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:23:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:23:35,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:23:36,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {197581#true} call ULTIMATE.init(); {197581#true} is VALID [2022-04-15 15:23:36,457 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-15 15:23:36,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197589#(<= ~counter~0 0)} {197581#true} #102#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {197589#(<= ~counter~0 0)} call #t~ret9 := main(); {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,458 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-15 15:23:36,459 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-15 15:23:36,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {197589#(<= ~counter~0 0)} ~cond := #in~cond; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {197589#(<= ~counter~0 0)} assume !(0 == ~cond); {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197589#(<= ~counter~0 0)} {197589#(<= ~counter~0 0)} #90#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,460 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-15 15:23:36,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {197589#(<= ~counter~0 0)} ~cond := #in~cond; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {197589#(<= ~counter~0 0)} assume !(0 == ~cond); {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {197589#(<= ~counter~0 0)} assume true; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197589#(<= ~counter~0 0)} {197589#(<= ~counter~0 0)} #92#return; {197589#(<= ~counter~0 0)} is VALID [2022-04-15 15:23:36,462 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-15 15:23:36,465 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-15 15:23:36,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {197638#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,466 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-15 15:23:36,467 INFO L290 TraceCheckUtils]: 20: Hoare triple {197638#(<= ~counter~0 1)} ~cond := #in~cond; {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {197638#(<= ~counter~0 1)} assume !(0 == ~cond); {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {197638#(<= ~counter~0 1)} assume true; {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,468 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197638#(<= ~counter~0 1)} {197638#(<= ~counter~0 1)} #94#return; {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {197638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {197638#(<= ~counter~0 1)} is VALID [2022-04-15 15:23:36,469 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-15 15:23:36,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {197663#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,470 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-15 15:23:36,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {197663#(<= ~counter~0 2)} ~cond := #in~cond; {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {197663#(<= ~counter~0 2)} assume !(0 == ~cond); {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {197663#(<= ~counter~0 2)} assume true; {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,472 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197663#(<= ~counter~0 2)} {197663#(<= ~counter~0 2)} #96#return; {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {197663#(<= ~counter~0 2)} assume !(~r~0 > 0); {197663#(<= ~counter~0 2)} is VALID [2022-04-15 15:23:36,473 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-15 15:23:36,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {197688#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {197688#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:36,474 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-15 15:23:36,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {197688#(<= ~counter~0 3)} ~cond := #in~cond; {197688#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:36,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {197688#(<= ~counter~0 3)} assume !(0 == ~cond); {197688#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:36,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {197688#(<= ~counter~0 3)} assume true; {197688#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:36,475 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197688#(<= ~counter~0 3)} {197688#(<= ~counter~0 3)} #98#return; {197688#(<= ~counter~0 3)} is VALID [2022-04-15 15:23:36,476 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-15 15:23:36,477 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-15 15:23:36,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {197713#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,478 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-15 15:23:36,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {197713#(<= ~counter~0 4)} ~cond := #in~cond; {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,479 INFO L290 TraceCheckUtils]: 45: Hoare triple {197713#(<= ~counter~0 4)} assume !(0 == ~cond); {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,479 INFO L290 TraceCheckUtils]: 46: Hoare triple {197713#(<= ~counter~0 4)} assume true; {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,479 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197713#(<= ~counter~0 4)} {197713#(<= ~counter~0 4)} #98#return; {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {197713#(<= ~counter~0 4)} assume !(~r~0 < 0); {197713#(<= ~counter~0 4)} is VALID [2022-04-15 15:23:36,481 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-15 15:23:36,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {197738#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,482 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-15 15:23:36,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {197738#(<= ~counter~0 5)} ~cond := #in~cond; {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {197738#(<= ~counter~0 5)} assume !(0 == ~cond); {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {197738#(<= ~counter~0 5)} assume true; {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,483 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197738#(<= ~counter~0 5)} {197738#(<= ~counter~0 5)} #94#return; {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {197738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {197738#(<= ~counter~0 5)} is VALID [2022-04-15 15:23:36,485 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-15 15:23:36,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {197763#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {197763#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:36,486 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-15 15:23:36,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {197763#(<= ~counter~0 6)} ~cond := #in~cond; {197763#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:36,486 INFO L290 TraceCheckUtils]: 61: Hoare triple {197763#(<= ~counter~0 6)} assume !(0 == ~cond); {197763#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:36,487 INFO L290 TraceCheckUtils]: 62: Hoare triple {197763#(<= ~counter~0 6)} assume true; {197763#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:36,487 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197763#(<= ~counter~0 6)} {197763#(<= ~counter~0 6)} #96#return; {197763#(<= ~counter~0 6)} is VALID [2022-04-15 15:23:36,487 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-15 15:23:36,489 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-15 15:23:36,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {197788#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {197788#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:36,490 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-15 15:23:36,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {197788#(<= ~counter~0 7)} ~cond := #in~cond; {197788#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:36,490 INFO L290 TraceCheckUtils]: 69: Hoare triple {197788#(<= ~counter~0 7)} assume !(0 == ~cond); {197788#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:36,490 INFO L290 TraceCheckUtils]: 70: Hoare triple {197788#(<= ~counter~0 7)} assume true; {197788#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:36,491 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197788#(<= ~counter~0 7)} {197788#(<= ~counter~0 7)} #96#return; {197788#(<= ~counter~0 7)} is VALID [2022-04-15 15:23:36,491 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-15 15:23:36,493 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-15 15:23:36,493 INFO L290 TraceCheckUtils]: 74: Hoare triple {197813#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,493 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-15 15:23:36,494 INFO L290 TraceCheckUtils]: 76: Hoare triple {197813#(<= ~counter~0 8)} ~cond := #in~cond; {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,494 INFO L290 TraceCheckUtils]: 77: Hoare triple {197813#(<= ~counter~0 8)} assume !(0 == ~cond); {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,494 INFO L290 TraceCheckUtils]: 78: Hoare triple {197813#(<= ~counter~0 8)} assume true; {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,495 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197813#(<= ~counter~0 8)} {197813#(<= ~counter~0 8)} #96#return; {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,495 INFO L290 TraceCheckUtils]: 80: Hoare triple {197813#(<= ~counter~0 8)} assume !(~r~0 > 0); {197813#(<= ~counter~0 8)} is VALID [2022-04-15 15:23:36,497 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-15 15:23:36,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {197838#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {197838#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:36,498 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-15 15:23:36,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {197838#(<= ~counter~0 9)} ~cond := #in~cond; {197838#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:36,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {197838#(<= ~counter~0 9)} assume !(0 == ~cond); {197838#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:36,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {197838#(<= ~counter~0 9)} assume true; {197838#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:36,499 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197838#(<= ~counter~0 9)} {197838#(<= ~counter~0 9)} #98#return; {197838#(<= ~counter~0 9)} is VALID [2022-04-15 15:23:36,499 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-15 15:23:36,501 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-15 15:23:36,501 INFO L290 TraceCheckUtils]: 90: Hoare triple {197863#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,501 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-15 15:23:36,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {197863#(<= ~counter~0 10)} ~cond := #in~cond; {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {197863#(<= ~counter~0 10)} assume !(0 == ~cond); {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,502 INFO L290 TraceCheckUtils]: 94: Hoare triple {197863#(<= ~counter~0 10)} assume true; {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,503 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197863#(<= ~counter~0 10)} {197863#(<= ~counter~0 10)} #98#return; {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {197863#(<= ~counter~0 10)} assume !(~r~0 < 0); {197863#(<= ~counter~0 10)} is VALID [2022-04-15 15:23:36,504 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-15 15:23:36,505 INFO L290 TraceCheckUtils]: 98: Hoare triple {197888#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,505 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-15 15:23:36,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {197888#(<= ~counter~0 11)} ~cond := #in~cond; {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,506 INFO L290 TraceCheckUtils]: 101: Hoare triple {197888#(<= ~counter~0 11)} assume !(0 == ~cond); {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {197888#(<= ~counter~0 11)} assume true; {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,507 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197888#(<= ~counter~0 11)} {197888#(<= ~counter~0 11)} #94#return; {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,507 INFO L290 TraceCheckUtils]: 104: Hoare triple {197888#(<= ~counter~0 11)} assume !!(0 != ~r~0); {197888#(<= ~counter~0 11)} is VALID [2022-04-15 15:23:36,508 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-15 15:23:36,509 INFO L290 TraceCheckUtils]: 106: Hoare triple {197913#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {197913#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:36,509 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-15 15:23:36,509 INFO L290 TraceCheckUtils]: 108: Hoare triple {197913#(<= ~counter~0 12)} ~cond := #in~cond; {197913#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:36,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {197913#(<= ~counter~0 12)} assume !(0 == ~cond); {197913#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:36,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {197913#(<= ~counter~0 12)} assume true; {197913#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:36,510 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197913#(<= ~counter~0 12)} {197913#(<= ~counter~0 12)} #96#return; {197913#(<= ~counter~0 12)} is VALID [2022-04-15 15:23:36,511 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-15 15:23:36,512 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-15 15:23:36,513 INFO L290 TraceCheckUtils]: 114: Hoare triple {197938#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {197938#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:36,513 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-15 15:23:36,514 INFO L290 TraceCheckUtils]: 116: Hoare triple {197938#(<= ~counter~0 13)} ~cond := #in~cond; {197938#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:36,514 INFO L290 TraceCheckUtils]: 117: Hoare triple {197938#(<= ~counter~0 13)} assume !(0 == ~cond); {197938#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:36,514 INFO L290 TraceCheckUtils]: 118: Hoare triple {197938#(<= ~counter~0 13)} assume true; {197938#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:36,515 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197938#(<= ~counter~0 13)} {197938#(<= ~counter~0 13)} #96#return; {197938#(<= ~counter~0 13)} is VALID [2022-04-15 15:23:36,515 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-15 15:23:36,516 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-15 15:23:36,517 INFO L290 TraceCheckUtils]: 122: Hoare triple {197963#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,517 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-15 15:23:36,517 INFO L290 TraceCheckUtils]: 124: Hoare triple {197963#(<= ~counter~0 14)} ~cond := #in~cond; {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,518 INFO L290 TraceCheckUtils]: 125: Hoare triple {197963#(<= ~counter~0 14)} assume !(0 == ~cond); {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,518 INFO L290 TraceCheckUtils]: 126: Hoare triple {197963#(<= ~counter~0 14)} assume true; {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,518 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197963#(<= ~counter~0 14)} {197963#(<= ~counter~0 14)} #96#return; {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,519 INFO L290 TraceCheckUtils]: 128: Hoare triple {197963#(<= ~counter~0 14)} assume !(~r~0 > 0); {197963#(<= ~counter~0 14)} is VALID [2022-04-15 15:23:36,520 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-15 15:23:36,521 INFO L290 TraceCheckUtils]: 130: Hoare triple {197988#(<= ~counter~0 15)} assume !!(#t~post8 < 50);havoc #t~post8; {197988#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:36,521 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-15 15:23:36,521 INFO L290 TraceCheckUtils]: 132: Hoare triple {197988#(<= ~counter~0 15)} ~cond := #in~cond; {197988#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:36,522 INFO L290 TraceCheckUtils]: 133: Hoare triple {197988#(<= ~counter~0 15)} assume !(0 == ~cond); {197988#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:36,522 INFO L290 TraceCheckUtils]: 134: Hoare triple {197988#(<= ~counter~0 15)} assume true; {197988#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:36,522 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197988#(<= ~counter~0 15)} {197988#(<= ~counter~0 15)} #98#return; {197988#(<= ~counter~0 15)} is VALID [2022-04-15 15:23:36,523 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-15 15:23:36,524 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-15 15:23:36,525 INFO L290 TraceCheckUtils]: 138: Hoare triple {198013#(<= ~counter~0 16)} assume !!(#t~post8 < 50);havoc #t~post8; {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,525 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-15 15:23:36,525 INFO L290 TraceCheckUtils]: 140: Hoare triple {198013#(<= ~counter~0 16)} ~cond := #in~cond; {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,526 INFO L290 TraceCheckUtils]: 141: Hoare triple {198013#(<= ~counter~0 16)} assume !(0 == ~cond); {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,526 INFO L290 TraceCheckUtils]: 142: Hoare triple {198013#(<= ~counter~0 16)} assume true; {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,526 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {198013#(<= ~counter~0 16)} {198013#(<= ~counter~0 16)} #98#return; {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,527 INFO L290 TraceCheckUtils]: 144: Hoare triple {198013#(<= ~counter~0 16)} assume !(~r~0 < 0); {198013#(<= ~counter~0 16)} is VALID [2022-04-15 15:23:36,528 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-15 15:23:36,529 INFO L290 TraceCheckUtils]: 146: Hoare triple {198038#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,529 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-15 15:23:36,529 INFO L290 TraceCheckUtils]: 148: Hoare triple {198038#(<= ~counter~0 17)} ~cond := #in~cond; {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,530 INFO L290 TraceCheckUtils]: 149: Hoare triple {198038#(<= ~counter~0 17)} assume !(0 == ~cond); {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,530 INFO L290 TraceCheckUtils]: 150: Hoare triple {198038#(<= ~counter~0 17)} assume true; {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,530 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {198038#(<= ~counter~0 17)} {198038#(<= ~counter~0 17)} #94#return; {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,531 INFO L290 TraceCheckUtils]: 152: Hoare triple {198038#(<= ~counter~0 17)} assume !!(0 != ~r~0); {198038#(<= ~counter~0 17)} is VALID [2022-04-15 15:23:36,532 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-15 15:23:36,533 INFO L290 TraceCheckUtils]: 154: Hoare triple {198063#(<= ~counter~0 18)} assume !!(#t~post7 < 50);havoc #t~post7; {198063#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:36,533 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-15 15:23:36,533 INFO L290 TraceCheckUtils]: 156: Hoare triple {198063#(<= ~counter~0 18)} ~cond := #in~cond; {198063#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:36,534 INFO L290 TraceCheckUtils]: 157: Hoare triple {198063#(<= ~counter~0 18)} assume !(0 == ~cond); {198063#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:36,534 INFO L290 TraceCheckUtils]: 158: Hoare triple {198063#(<= ~counter~0 18)} assume true; {198063#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:36,534 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {198063#(<= ~counter~0 18)} {198063#(<= ~counter~0 18)} #96#return; {198063#(<= ~counter~0 18)} is VALID [2022-04-15 15:23:36,535 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-15 15:23:36,535 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-15 15:23:36,535 INFO L290 TraceCheckUtils]: 162: Hoare triple {198088#(<= |main_#t~post7| 18)} assume !(#t~post7 < 50);havoc #t~post7; {197582#false} is VALID [2022-04-15 15:23:36,535 INFO L290 TraceCheckUtils]: 163: Hoare triple {197582#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197582#false} is VALID [2022-04-15 15:23:36,535 INFO L290 TraceCheckUtils]: 164: Hoare triple {197582#false} assume !(#t~post8 < 50);havoc #t~post8; {197582#false} is VALID [2022-04-15 15:23:36,536 INFO L290 TraceCheckUtils]: 165: Hoare triple {197582#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197582#false} is VALID [2022-04-15 15:23:36,536 INFO L290 TraceCheckUtils]: 166: Hoare triple {197582#false} assume !(#t~post6 < 50);havoc #t~post6; {197582#false} is VALID [2022-04-15 15:23:36,536 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-15 15:23:36,536 INFO L290 TraceCheckUtils]: 168: Hoare triple {197582#false} ~cond := #in~cond; {197582#false} is VALID [2022-04-15 15:23:36,536 INFO L290 TraceCheckUtils]: 169: Hoare triple {197582#false} assume 0 == ~cond; {197582#false} is VALID [2022-04-15 15:23:36,536 INFO L290 TraceCheckUtils]: 170: Hoare triple {197582#false} assume !false; {197582#false} is VALID [2022-04-15 15:23:36,536 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-15 15:23:36,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:23:37,650 INFO L290 TraceCheckUtils]: 170: Hoare triple {197582#false} assume !false; {197582#false} is VALID [2022-04-15 15:23:37,650 INFO L290 TraceCheckUtils]: 169: Hoare triple {197582#false} assume 0 == ~cond; {197582#false} is VALID [2022-04-15 15:23:37,650 INFO L290 TraceCheckUtils]: 168: Hoare triple {197582#false} ~cond := #in~cond; {197582#false} is VALID [2022-04-15 15:23:37,650 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-15 15:23:37,650 INFO L290 TraceCheckUtils]: 166: Hoare triple {197582#false} assume !(#t~post6 < 50);havoc #t~post6; {197582#false} is VALID [2022-04-15 15:23:37,650 INFO L290 TraceCheckUtils]: 165: Hoare triple {197582#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {197582#false} is VALID [2022-04-15 15:23:37,651 INFO L290 TraceCheckUtils]: 164: Hoare triple {197582#false} assume !(#t~post8 < 50);havoc #t~post8; {197582#false} is VALID [2022-04-15 15:23:37,651 INFO L290 TraceCheckUtils]: 163: Hoare triple {197582#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {197582#false} is VALID [2022-04-15 15:23:37,651 INFO L290 TraceCheckUtils]: 162: Hoare triple {198140#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {197582#false} is VALID [2022-04-15 15:23:37,651 INFO L290 TraceCheckUtils]: 161: Hoare triple {198144#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198140#(< |main_#t~post7| 50)} is VALID [2022-04-15 15:23:37,652 INFO L290 TraceCheckUtils]: 160: Hoare triple {198144#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198144#(< ~counter~0 50)} is VALID [2022-04-15 15:23:37,652 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {197581#true} {198144#(< ~counter~0 50)} #96#return; {198144#(< ~counter~0 50)} is VALID [2022-04-15 15:23:37,652 INFO L290 TraceCheckUtils]: 158: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,652 INFO L290 TraceCheckUtils]: 157: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,652 INFO L290 TraceCheckUtils]: 156: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,652 INFO L272 TraceCheckUtils]: 155: Hoare triple {198144#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:23:37,653 INFO L290 TraceCheckUtils]: 154: Hoare triple {198144#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {198144#(< ~counter~0 50)} is VALID [2022-04-15 15:23:37,657 INFO L290 TraceCheckUtils]: 153: Hoare triple {198169#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198144#(< ~counter~0 50)} is VALID [2022-04-15 15:23:37,657 INFO L290 TraceCheckUtils]: 152: Hoare triple {198169#(< ~counter~0 49)} assume !!(0 != ~r~0); {198169#(< ~counter~0 49)} is VALID [2022-04-15 15:23:37,657 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {197581#true} {198169#(< ~counter~0 49)} #94#return; {198169#(< ~counter~0 49)} is VALID [2022-04-15 15:23:37,657 INFO L290 TraceCheckUtils]: 150: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,658 INFO L290 TraceCheckUtils]: 149: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,658 INFO L290 TraceCheckUtils]: 148: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,658 INFO L272 TraceCheckUtils]: 147: Hoare triple {198169#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:23:37,658 INFO L290 TraceCheckUtils]: 146: Hoare triple {198169#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {198169#(< ~counter~0 49)} is VALID [2022-04-15 15:23:37,660 INFO L290 TraceCheckUtils]: 145: Hoare triple {198194#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198169#(< ~counter~0 49)} is VALID [2022-04-15 15:23:37,660 INFO L290 TraceCheckUtils]: 144: Hoare triple {198194#(< ~counter~0 48)} assume !(~r~0 < 0); {198194#(< ~counter~0 48)} is VALID [2022-04-15 15:23:37,660 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {197581#true} {198194#(< ~counter~0 48)} #98#return; {198194#(< ~counter~0 48)} is VALID [2022-04-15 15:23:37,661 INFO L290 TraceCheckUtils]: 142: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,661 INFO L290 TraceCheckUtils]: 141: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,661 INFO L290 TraceCheckUtils]: 140: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,661 INFO L272 TraceCheckUtils]: 139: Hoare triple {198194#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:23:37,661 INFO L290 TraceCheckUtils]: 138: Hoare triple {198194#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {198194#(< ~counter~0 48)} is VALID [2022-04-15 15:23:37,663 INFO L290 TraceCheckUtils]: 137: Hoare triple {198219#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198194#(< ~counter~0 48)} is VALID [2022-04-15 15:23:37,663 INFO L290 TraceCheckUtils]: 136: Hoare triple {198219#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198219#(< ~counter~0 47)} is VALID [2022-04-15 15:23:37,663 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {197581#true} {198219#(< ~counter~0 47)} #98#return; {198219#(< ~counter~0 47)} is VALID [2022-04-15 15:23:37,664 INFO L290 TraceCheckUtils]: 134: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,664 INFO L290 TraceCheckUtils]: 133: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,664 INFO L290 TraceCheckUtils]: 132: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,664 INFO L272 TraceCheckUtils]: 131: Hoare triple {198219#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:23:37,664 INFO L290 TraceCheckUtils]: 130: Hoare triple {198219#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {198219#(< ~counter~0 47)} is VALID [2022-04-15 15:23:37,666 INFO L290 TraceCheckUtils]: 129: Hoare triple {198244#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198219#(< ~counter~0 47)} is VALID [2022-04-15 15:23:37,666 INFO L290 TraceCheckUtils]: 128: Hoare triple {198244#(< ~counter~0 46)} assume !(~r~0 > 0); {198244#(< ~counter~0 46)} is VALID [2022-04-15 15:23:37,666 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {197581#true} {198244#(< ~counter~0 46)} #96#return; {198244#(< ~counter~0 46)} is VALID [2022-04-15 15:23:37,666 INFO L290 TraceCheckUtils]: 126: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,667 INFO L290 TraceCheckUtils]: 125: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,667 INFO L290 TraceCheckUtils]: 124: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,667 INFO L272 TraceCheckUtils]: 123: Hoare triple {198244#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:23:37,667 INFO L290 TraceCheckUtils]: 122: Hoare triple {198244#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {198244#(< ~counter~0 46)} is VALID [2022-04-15 15:23:37,669 INFO L290 TraceCheckUtils]: 121: Hoare triple {198269#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198244#(< ~counter~0 46)} is VALID [2022-04-15 15:23:37,669 INFO L290 TraceCheckUtils]: 120: Hoare triple {198269#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198269#(< ~counter~0 45)} is VALID [2022-04-15 15:23:37,670 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {197581#true} {198269#(< ~counter~0 45)} #96#return; {198269#(< ~counter~0 45)} is VALID [2022-04-15 15:23:37,670 INFO L290 TraceCheckUtils]: 118: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,670 INFO L290 TraceCheckUtils]: 117: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,670 INFO L290 TraceCheckUtils]: 116: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,670 INFO L272 TraceCheckUtils]: 115: Hoare triple {198269#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:23:37,670 INFO L290 TraceCheckUtils]: 114: Hoare triple {198269#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {198269#(< ~counter~0 45)} is VALID [2022-04-15 15:23:37,672 INFO L290 TraceCheckUtils]: 113: Hoare triple {198294#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198269#(< ~counter~0 45)} is VALID [2022-04-15 15:23:37,672 INFO L290 TraceCheckUtils]: 112: Hoare triple {198294#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198294#(< ~counter~0 44)} is VALID [2022-04-15 15:23:37,673 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {197581#true} {198294#(< ~counter~0 44)} #96#return; {198294#(< ~counter~0 44)} is VALID [2022-04-15 15:23:37,673 INFO L290 TraceCheckUtils]: 110: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,673 INFO L290 TraceCheckUtils]: 109: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,673 INFO L290 TraceCheckUtils]: 108: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,673 INFO L272 TraceCheckUtils]: 107: Hoare triple {198294#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:23:37,673 INFO L290 TraceCheckUtils]: 106: Hoare triple {198294#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {198294#(< ~counter~0 44)} is VALID [2022-04-15 15:23:37,675 INFO L290 TraceCheckUtils]: 105: Hoare triple {198319#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198294#(< ~counter~0 44)} is VALID [2022-04-15 15:23:37,675 INFO L290 TraceCheckUtils]: 104: Hoare triple {198319#(< ~counter~0 43)} assume !!(0 != ~r~0); {198319#(< ~counter~0 43)} is VALID [2022-04-15 15:23:37,675 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {197581#true} {198319#(< ~counter~0 43)} #94#return; {198319#(< ~counter~0 43)} is VALID [2022-04-15 15:23:37,676 INFO L290 TraceCheckUtils]: 102: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,676 INFO L290 TraceCheckUtils]: 101: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,676 INFO L290 TraceCheckUtils]: 100: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,676 INFO L272 TraceCheckUtils]: 99: Hoare triple {198319#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:23:37,676 INFO L290 TraceCheckUtils]: 98: Hoare triple {198319#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {198319#(< ~counter~0 43)} is VALID [2022-04-15 15:23:37,678 INFO L290 TraceCheckUtils]: 97: Hoare triple {198344#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198319#(< ~counter~0 43)} is VALID [2022-04-15 15:23:37,678 INFO L290 TraceCheckUtils]: 96: Hoare triple {198344#(< ~counter~0 42)} assume !(~r~0 < 0); {198344#(< ~counter~0 42)} is VALID [2022-04-15 15:23:37,678 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {197581#true} {198344#(< ~counter~0 42)} #98#return; {198344#(< ~counter~0 42)} is VALID [2022-04-15 15:23:37,678 INFO L290 TraceCheckUtils]: 94: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,679 INFO L290 TraceCheckUtils]: 93: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,679 INFO L290 TraceCheckUtils]: 92: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,679 INFO L272 TraceCheckUtils]: 91: Hoare triple {198344#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:23:37,679 INFO L290 TraceCheckUtils]: 90: Hoare triple {198344#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {198344#(< ~counter~0 42)} is VALID [2022-04-15 15:23:37,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {198369#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198344#(< ~counter~0 42)} is VALID [2022-04-15 15:23:37,681 INFO L290 TraceCheckUtils]: 88: Hoare triple {198369#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198369#(< ~counter~0 41)} is VALID [2022-04-15 15:23:37,681 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {197581#true} {198369#(< ~counter~0 41)} #98#return; {198369#(< ~counter~0 41)} is VALID [2022-04-15 15:23:37,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,682 INFO L272 TraceCheckUtils]: 83: Hoare triple {198369#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:23:37,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {198369#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {198369#(< ~counter~0 41)} is VALID [2022-04-15 15:23:37,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {198394#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198369#(< ~counter~0 41)} is VALID [2022-04-15 15:23:37,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {198394#(< ~counter~0 40)} assume !(~r~0 > 0); {198394#(< ~counter~0 40)} is VALID [2022-04-15 15:23:37,684 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {197581#true} {198394#(< ~counter~0 40)} #96#return; {198394#(< ~counter~0 40)} is VALID [2022-04-15 15:23:37,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,684 INFO L290 TraceCheckUtils]: 76: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,684 INFO L272 TraceCheckUtils]: 75: Hoare triple {198394#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:23:37,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {198394#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {198394#(< ~counter~0 40)} is VALID [2022-04-15 15:23:37,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {198419#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198394#(< ~counter~0 40)} is VALID [2022-04-15 15:23:37,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {198419#(< ~counter~0 39)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198419#(< ~counter~0 39)} is VALID [2022-04-15 15:23:37,687 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {197581#true} {198419#(< ~counter~0 39)} #96#return; {198419#(< ~counter~0 39)} is VALID [2022-04-15 15:23:37,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,687 INFO L272 TraceCheckUtils]: 67: Hoare triple {198419#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:23:37,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {198419#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {198419#(< ~counter~0 39)} is VALID [2022-04-15 15:23:37,689 INFO L290 TraceCheckUtils]: 65: Hoare triple {198444#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198419#(< ~counter~0 39)} is VALID [2022-04-15 15:23:37,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {198444#(< ~counter~0 38)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {198444#(< ~counter~0 38)} is VALID [2022-04-15 15:23:37,690 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {197581#true} {198444#(< ~counter~0 38)} #96#return; {198444#(< ~counter~0 38)} is VALID [2022-04-15 15:23:37,690 INFO L290 TraceCheckUtils]: 62: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,690 INFO L290 TraceCheckUtils]: 61: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,690 INFO L290 TraceCheckUtils]: 60: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,690 INFO L272 TraceCheckUtils]: 59: Hoare triple {198444#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:23:37,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {198444#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {198444#(< ~counter~0 38)} is VALID [2022-04-15 15:23:37,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {198469#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198444#(< ~counter~0 38)} is VALID [2022-04-15 15:23:37,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {198469#(< ~counter~0 37)} assume !!(0 != ~r~0); {198469#(< ~counter~0 37)} is VALID [2022-04-15 15:23:37,693 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {197581#true} {198469#(< ~counter~0 37)} #94#return; {198469#(< ~counter~0 37)} is VALID [2022-04-15 15:23:37,693 INFO L290 TraceCheckUtils]: 54: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,693 INFO L272 TraceCheckUtils]: 51: Hoare triple {198469#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:23:37,693 INFO L290 TraceCheckUtils]: 50: Hoare triple {198469#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {198469#(< ~counter~0 37)} is VALID [2022-04-15 15:23:37,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {198494#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198469#(< ~counter~0 37)} is VALID [2022-04-15 15:23:37,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {198494#(< ~counter~0 36)} assume !(~r~0 < 0); {198494#(< ~counter~0 36)} is VALID [2022-04-15 15:23:37,696 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {197581#true} {198494#(< ~counter~0 36)} #98#return; {198494#(< ~counter~0 36)} is VALID [2022-04-15 15:23:37,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,696 INFO L290 TraceCheckUtils]: 44: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,696 INFO L272 TraceCheckUtils]: 43: Hoare triple {198494#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:23:37,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {198494#(< ~counter~0 36)} assume !!(#t~post8 < 50);havoc #t~post8; {198494#(< ~counter~0 36)} is VALID [2022-04-15 15:23:37,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {198519#(< ~counter~0 35)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198494#(< ~counter~0 36)} is VALID [2022-04-15 15:23:37,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {198519#(< ~counter~0 35)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198519#(< ~counter~0 35)} is VALID [2022-04-15 15:23:37,699 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {197581#true} {198519#(< ~counter~0 35)} #98#return; {198519#(< ~counter~0 35)} is VALID [2022-04-15 15:23:37,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,699 INFO L272 TraceCheckUtils]: 35: Hoare triple {198519#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:23:37,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {198519#(< ~counter~0 35)} assume !!(#t~post8 < 50);havoc #t~post8; {198519#(< ~counter~0 35)} is VALID [2022-04-15 15:23:37,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {198544#(< ~counter~0 34)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198519#(< ~counter~0 35)} is VALID [2022-04-15 15:23:37,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {198544#(< ~counter~0 34)} assume !(~r~0 > 0); {198544#(< ~counter~0 34)} is VALID [2022-04-15 15:23:37,702 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {197581#true} {198544#(< ~counter~0 34)} #96#return; {198544#(< ~counter~0 34)} is VALID [2022-04-15 15:23:37,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,702 INFO L272 TraceCheckUtils]: 27: Hoare triple {198544#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:23:37,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {198544#(< ~counter~0 34)} assume !!(#t~post7 < 50);havoc #t~post7; {198544#(< ~counter~0 34)} is VALID [2022-04-15 15:23:37,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {198569#(< ~counter~0 33)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198544#(< ~counter~0 34)} is VALID [2022-04-15 15:23:37,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {198569#(< ~counter~0 33)} assume !!(0 != ~r~0); {198569#(< ~counter~0 33)} is VALID [2022-04-15 15:23:37,705 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {197581#true} {198569#(< ~counter~0 33)} #94#return; {198569#(< ~counter~0 33)} is VALID [2022-04-15 15:23:37,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,705 INFO L272 TraceCheckUtils]: 19: Hoare triple {198569#(< ~counter~0 33)} call __VERIFIER_assert((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-15 15:23:37,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {198569#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {198569#(< ~counter~0 33)} is VALID [2022-04-15 15:23:37,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {198594#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198569#(< ~counter~0 33)} is VALID [2022-04-15 15:23:37,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {198594#(< ~counter~0 32)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,707 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {197581#true} {198594#(< ~counter~0 32)} #92#return; {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,708 INFO L272 TraceCheckUtils]: 11: Hoare triple {198594#(< ~counter~0 32)} call assume_abort_if_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-15 15:23:37,708 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197581#true} {198594#(< ~counter~0 32)} #90#return; {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {197581#true} assume true; {197581#true} is VALID [2022-04-15 15:23:37,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {197581#true} assume !(0 == ~cond); {197581#true} is VALID [2022-04-15 15:23:37,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {197581#true} ~cond := #in~cond; {197581#true} is VALID [2022-04-15 15:23:37,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {198594#(< ~counter~0 32)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {197581#true} is VALID [2022-04-15 15:23:37,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {198594#(< ~counter~0 32)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 32)} is VALID [2022-04-15 15:23:37,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {198594#(< ~counter~0 32)} call #t~ret9 := main(); {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198594#(< ~counter~0 32)} {197581#true} #102#return; {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {198594#(< ~counter~0 32)} assume true; {198594#(< ~counter~0 32)} is VALID [2022-04-15 15:23:37,710 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 32)} is VALID [2022-04-15 15:23:37,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {197581#true} call ULTIMATE.init(); {197581#true} is VALID [2022-04-15 15:23:37,710 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-15 15:23:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:23:37,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709271981] [2022-04-15 15:23:37,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:23:37,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765235155] [2022-04-15 15:23:37,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765235155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:23:37,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:23:37,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:23:37,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:23:37,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719245505] [2022-04-15 15:23:37,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719245505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:23:37,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:23:37,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:23:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579914984] [2022-04-15 15:23:37,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:23:37,712 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-15 15:23:37,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:23:37,712 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-15 15:23:37,964 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-15 15:23:37,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:23:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:23:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:23:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:23:37,965 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-15 15:23:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:45,205 INFO L93 Difference]: Finished difference Result 1133 states and 1538 transitions. [2022-04-15 15:23:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 15:23:45,205 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-15 15:23:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:23:45,205 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-15 15:23:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-15 15:23:45,208 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-15 15:23:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-15 15:23:45,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 396 transitions. [2022-04-15 15:23:45,785 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-15 15:23:45,833 INFO L225 Difference]: With dead ends: 1133 [2022-04-15 15:23:45,833 INFO L226 Difference]: Without dead ends: 963 [2022-04-15 15:23:45,834 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-15 15:23:45,834 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 453 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:23:45,834 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.1s Time] [2022-04-15 15:23:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-04-15 15:23:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-04-15 15:23:49,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:23:49,733 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-15 15:23:49,733 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-15 15:23:49,734 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-15 15:23:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:49,761 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-15 15:23:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-15 15:23:49,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:49,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:49,762 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-15 15:23:49,763 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-15 15:23:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:23:49,797 INFO L93 Difference]: Finished difference Result 963 states and 1277 transitions. [2022-04-15 15:23:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-15 15:23:49,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:23:49,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:23:49,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:23:49,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:23:49,799 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-15 15:23:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1277 transitions. [2022-04-15 15:23:49,838 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1277 transitions. Word has length 171 [2022-04-15 15:23:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:23:49,839 INFO L478 AbstractCegarLoop]: Abstraction has 963 states and 1277 transitions. [2022-04-15 15:23:49,839 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-15 15:23:49,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 963 states and 1277 transitions. [2022-04-15 15:24:00,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1277 edges. 1276 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:24:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1277 transitions. [2022-04-15 15:24:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 15:24:00,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:24:00,829 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-15 15:24:00,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 15:24:01,031 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-15 15:24:01,031 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:24:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:24:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 21 times [2022-04-15 15:24:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:24:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656808059] [2022-04-15 15:24:01,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:24:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 22 times [2022-04-15 15:24:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:24:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990409287] [2022-04-15 15:24:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:24:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:24:01,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:24:01,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20513631] [2022-04-15 15:24:01,048 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:24:01,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:24:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:24:01,049 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-15 15:24:01,049 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-15 15:24:01,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:24:01,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:24:01,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 15:24:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:24:01,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:24:02,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {204800#true} call ULTIMATE.init(); {204800#true} is VALID [2022-04-15 15:24:02,086 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-15 15:24:02,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204808#(<= ~counter~0 0)} {204800#true} #102#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {204808#(<= ~counter~0 0)} call #t~ret9 := main(); {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,087 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-15 15:24:02,088 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-15 15:24:02,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {204808#(<= ~counter~0 0)} ~cond := #in~cond; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {204808#(<= ~counter~0 0)} assume !(0 == ~cond); {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204808#(<= ~counter~0 0)} {204808#(<= ~counter~0 0)} #90#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,089 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-15 15:24:02,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {204808#(<= ~counter~0 0)} ~cond := #in~cond; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {204808#(<= ~counter~0 0)} assume !(0 == ~cond); {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {204808#(<= ~counter~0 0)} assume true; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204808#(<= ~counter~0 0)} {204808#(<= ~counter~0 0)} #92#return; {204808#(<= ~counter~0 0)} is VALID [2022-04-15 15:24:02,091 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-15 15:24:02,095 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-15 15:24:02,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {204857#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,096 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-15 15:24:02,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {204857#(<= ~counter~0 1)} ~cond := #in~cond; {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {204857#(<= ~counter~0 1)} assume !(0 == ~cond); {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {204857#(<= ~counter~0 1)} assume true; {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,097 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204857#(<= ~counter~0 1)} {204857#(<= ~counter~0 1)} #94#return; {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {204857#(<= ~counter~0 1)} assume !!(0 != ~r~0); {204857#(<= ~counter~0 1)} is VALID [2022-04-15 15:24:02,099 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-15 15:24:02,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {204882#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,100 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-15 15:24:02,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {204882#(<= ~counter~0 2)} ~cond := #in~cond; {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {204882#(<= ~counter~0 2)} assume !(0 == ~cond); {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {204882#(<= ~counter~0 2)} assume true; {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,101 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204882#(<= ~counter~0 2)} {204882#(<= ~counter~0 2)} #96#return; {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {204882#(<= ~counter~0 2)} assume !(~r~0 > 0); {204882#(<= ~counter~0 2)} is VALID [2022-04-15 15:24:02,103 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-15 15:24:02,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {204907#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {204907#(<= ~counter~0 3)} is VALID [2022-04-15 15:24:02,104 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-15 15:24:02,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {204907#(<= ~counter~0 3)} ~cond := #in~cond; {204907#(<= ~counter~0 3)} is VALID [2022-04-15 15:24:02,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {204907#(<= ~counter~0 3)} assume !(0 == ~cond); {204907#(<= ~counter~0 3)} is VALID [2022-04-15 15:24:02,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {204907#(<= ~counter~0 3)} assume true; {204907#(<= ~counter~0 3)} is VALID [2022-04-15 15:24:02,105 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204907#(<= ~counter~0 3)} {204907#(<= ~counter~0 3)} #98#return; {204907#(<= ~counter~0 3)} is VALID [2022-04-15 15:24:02,105 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-15 15:24:02,107 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-15 15:24:02,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {204932#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,108 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-15 15:24:02,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {204932#(<= ~counter~0 4)} ~cond := #in~cond; {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {204932#(<= ~counter~0 4)} assume !(0 == ~cond); {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {204932#(<= ~counter~0 4)} assume true; {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,109 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204932#(<= ~counter~0 4)} {204932#(<= ~counter~0 4)} #98#return; {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {204932#(<= ~counter~0 4)} assume !(~r~0 < 0); {204932#(<= ~counter~0 4)} is VALID [2022-04-15 15:24:02,111 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-15 15:24:02,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {204957#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,112 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-15 15:24:02,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {204957#(<= ~counter~0 5)} ~cond := #in~cond; {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {204957#(<= ~counter~0 5)} assume !(0 == ~cond); {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {204957#(<= ~counter~0 5)} assume true; {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,113 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204957#(<= ~counter~0 5)} {204957#(<= ~counter~0 5)} #94#return; {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {204957#(<= ~counter~0 5)} assume !!(0 != ~r~0); {204957#(<= ~counter~0 5)} is VALID [2022-04-15 15:24:02,115 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-15 15:24:02,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {204982#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {204982#(<= ~counter~0 6)} is VALID [2022-04-15 15:24:02,115 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-15 15:24:02,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {204982#(<= ~counter~0 6)} ~cond := #in~cond; {204982#(<= ~counter~0 6)} is VALID [2022-04-15 15:24:02,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {204982#(<= ~counter~0 6)} assume !(0 == ~cond); {204982#(<= ~counter~0 6)} is VALID [2022-04-15 15:24:02,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {204982#(<= ~counter~0 6)} assume true; {204982#(<= ~counter~0 6)} is VALID [2022-04-15 15:24:02,117 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204982#(<= ~counter~0 6)} {204982#(<= ~counter~0 6)} #96#return; {204982#(<= ~counter~0 6)} is VALID [2022-04-15 15:24:02,117 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-15 15:24:02,119 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-15 15:24:02,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {205007#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {205007#(<= ~counter~0 7)} is VALID [2022-04-15 15:24:02,119 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-15 15:24:02,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {205007#(<= ~counter~0 7)} ~cond := #in~cond; {205007#(<= ~counter~0 7)} is VALID [2022-04-15 15:24:02,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {205007#(<= ~counter~0 7)} assume !(0 == ~cond); {205007#(<= ~counter~0 7)} is VALID [2022-04-15 15:24:02,120 INFO L290 TraceCheckUtils]: 70: Hoare triple {205007#(<= ~counter~0 7)} assume true; {205007#(<= ~counter~0 7)} is VALID [2022-04-15 15:24:02,121 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {205007#(<= ~counter~0 7)} {205007#(<= ~counter~0 7)} #96#return; {205007#(<= ~counter~0 7)} is VALID [2022-04-15 15:24:02,121 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-15 15:24:02,123 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-15 15:24:02,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {205032#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,124 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-15 15:24:02,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {205032#(<= ~counter~0 8)} ~cond := #in~cond; {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {205032#(<= ~counter~0 8)} assume !(0 == ~cond); {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {205032#(<= ~counter~0 8)} assume true; {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,125 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {205032#(<= ~counter~0 8)} {205032#(<= ~counter~0 8)} #96#return; {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,125 INFO L290 TraceCheckUtils]: 80: Hoare triple {205032#(<= ~counter~0 8)} assume !(~r~0 > 0); {205032#(<= ~counter~0 8)} is VALID [2022-04-15 15:24:02,127 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-15 15:24:02,127 INFO L290 TraceCheckUtils]: 82: Hoare triple {205057#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {205057#(<= ~counter~0 9)} is VALID [2022-04-15 15:24:02,128 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-15 15:24:02,128 INFO L290 TraceCheckUtils]: 84: Hoare triple {205057#(<= ~counter~0 9)} ~cond := #in~cond; {205057#(<= ~counter~0 9)} is VALID [2022-04-15 15:24:02,128 INFO L290 TraceCheckUtils]: 85: Hoare triple {205057#(<= ~counter~0 9)} assume !(0 == ~cond); {205057#(<= ~counter~0 9)} is VALID [2022-04-15 15:24:02,128 INFO L290 TraceCheckUtils]: 86: Hoare triple {205057#(<= ~counter~0 9)} assume true; {205057#(<= ~counter~0 9)} is VALID [2022-04-15 15:24:02,129 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {205057#(<= ~counter~0 9)} {205057#(<= ~counter~0 9)} #98#return; {205057#(<= ~counter~0 9)} is VALID [2022-04-15 15:24:02,129 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-15 15:24:02,131 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-15 15:24:02,131 INFO L290 TraceCheckUtils]: 90: Hoare triple {205082#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,132 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-15 15:24:02,132 INFO L290 TraceCheckUtils]: 92: Hoare triple {205082#(<= ~counter~0 10)} ~cond := #in~cond; {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,132 INFO L290 TraceCheckUtils]: 93: Hoare triple {205082#(<= ~counter~0 10)} assume !(0 == ~cond); {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,132 INFO L290 TraceCheckUtils]: 94: Hoare triple {205082#(<= ~counter~0 10)} assume true; {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,133 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {205082#(<= ~counter~0 10)} {205082#(<= ~counter~0 10)} #98#return; {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {205082#(<= ~counter~0 10)} assume !(~r~0 < 0); {205082#(<= ~counter~0 10)} is VALID [2022-04-15 15:24:02,135 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-15 15:24:02,135 INFO L290 TraceCheckUtils]: 98: Hoare triple {205107#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,136 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-15 15:24:02,136 INFO L290 TraceCheckUtils]: 100: Hoare triple {205107#(<= ~counter~0 11)} ~cond := #in~cond; {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,136 INFO L290 TraceCheckUtils]: 101: Hoare triple {205107#(<= ~counter~0 11)} assume !(0 == ~cond); {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,136 INFO L290 TraceCheckUtils]: 102: Hoare triple {205107#(<= ~counter~0 11)} assume true; {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,137 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {205107#(<= ~counter~0 11)} {205107#(<= ~counter~0 11)} #94#return; {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,137 INFO L290 TraceCheckUtils]: 104: Hoare triple {205107#(<= ~counter~0 11)} assume !!(0 != ~r~0); {205107#(<= ~counter~0 11)} is VALID [2022-04-15 15:24:02,139 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-15 15:24:02,139 INFO L290 TraceCheckUtils]: 106: Hoare triple {205132#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {205132#(<= ~counter~0 12)} is VALID [2022-04-15 15:24:02,140 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-15 15:24:02,140 INFO L290 TraceCheckUtils]: 108: Hoare triple {205132#(<= ~counter~0 12)} ~cond := #in~cond; {205132#(<= ~counter~0 12)} is VALID [2022-04-15 15:24:02,140 INFO L290 TraceCheckUtils]: 109: Hoare triple {205132#(<= ~counter~0 12)} assume !(0 == ~cond); {205132#(<= ~counter~0 12)} is VALID [2022-04-15 15:24:02,141 INFO L290 TraceCheckUtils]: 110: Hoare triple {205132#(<= ~counter~0 12)} assume true; {205132#(<= ~counter~0 12)} is VALID [2022-04-15 15:24:02,141 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {205132#(<= ~counter~0 12)} {205132#(<= ~counter~0 12)} #96#return; {205132#(<= ~counter~0 12)} is VALID [2022-04-15 15:24:02,141 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-15 15:24:02,143 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-15 15:24:02,143 INFO L290 TraceCheckUtils]: 114: Hoare triple {205157#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {205157#(<= ~counter~0 13)} is VALID [2022-04-15 15:24:02,144 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-15 15:24:02,144 INFO L290 TraceCheckUtils]: 116: Hoare triple {205157#(<= ~counter~0 13)} ~cond := #in~cond; {205157#(<= ~counter~0 13)} is VALID [2022-04-15 15:24:02,144 INFO L290 TraceCheckUtils]: 117: Hoare triple {205157#(<= ~counter~0 13)} assume !(0 == ~cond); {205157#(<= ~counter~0 13)} is VALID [2022-04-15 15:24:02,145 INFO L290 TraceCheckUtils]: 118: Hoare triple {205157#(<= ~counter~0 13)} assume true; {205157#(<= ~counter~0 13)} is VALID [2022-04-15 15:24:02,145 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {205157#(<= ~counter~0 13)} {205157#(<= ~counter~0 13)} #96#return; {205157#(<= ~counter~0 13)} is VALID [2022-04-15 15:24:02,145 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-15 15:24:02,147 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-15 15:24:02,147 INFO L290 TraceCheckUtils]: 122: Hoare triple {205182#(<= ~counter~0 14)} assume !!(#t~post7 < 50);havoc #t~post7; {205182#(<= ~counter~0 14)} is VALID [2022-04-15 15:24:02,148 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-15 15:24:02,148 INFO L290 TraceCheckUtils]: 124: Hoare triple {205182#(<= ~counter~0 14)} ~cond := #in~cond; {205182#(<= ~counter~0 14)} is VALID [2022-04-15 15:24:02,148 INFO L290 TraceCheckUtils]: 125: Hoare triple {205182#(<= ~counter~0 14)} assume !(0 == ~cond); {205182#(<= ~counter~0 14)} is VALID [2022-04-15 15:24:02,149 INFO L290 TraceCheckUtils]: 126: Hoare triple {205182#(<= ~counter~0 14)} assume true; {205182#(<= ~counter~0 14)} is VALID [2022-04-15 15:24:02,149 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {205182#(<= ~counter~0 14)} {205182#(<= ~counter~0 14)} #96#return; {205182#(<= ~counter~0 14)} is VALID [2022-04-15 15:24:02,149 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-15 15:24:02,151 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-15 15:24:02,151 INFO L290 TraceCheckUtils]: 130: Hoare triple {205207#(<= ~counter~0 15)} assume !!(#t~post7 < 50);havoc #t~post7; {205207#(<= ~counter~0 15)} is VALID [2022-04-15 15:24:02,152 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-15 15:24:02,152 INFO L290 TraceCheckUtils]: 132: Hoare triple {205207#(<= ~counter~0 15)} ~cond := #in~cond; {205207#(<= ~counter~0 15)} is VALID [2022-04-15 15:24:02,152 INFO L290 TraceCheckUtils]: 133: Hoare triple {205207#(<= ~counter~0 15)} assume !(0 == ~cond); {205207#(<= ~counter~0 15)} is VALID [2022-04-15 15:24:02,153 INFO L290 TraceCheckUtils]: 134: Hoare triple {205207#(<= ~counter~0 15)} assume true; {205207#(<= ~counter~0 15)} is VALID [2022-04-15 15:24:02,153 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {205207#(<= ~counter~0 15)} {205207#(<= ~counter~0 15)} #96#return; {205207#(<= ~counter~0 15)} is VALID [2022-04-15 15:24:02,154 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-15 15:24:02,155 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-15 15:24:02,155 INFO L290 TraceCheckUtils]: 138: Hoare triple {205232#(<= ~counter~0 16)} assume !!(#t~post7 < 50);havoc #t~post7; {205232#(<= ~counter~0 16)} is VALID [2022-04-15 15:24:02,156 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-15 15:24:02,156 INFO L290 TraceCheckUtils]: 140: Hoare triple {205232#(<= ~counter~0 16)} ~cond := #in~cond; {205232#(<= ~counter~0 16)} is VALID [2022-04-15 15:24:02,157 INFO L290 TraceCheckUtils]: 141: Hoare triple {205232#(<= ~counter~0 16)} assume !(0 == ~cond); {205232#(<= ~counter~0 16)} is VALID [2022-04-15 15:24:02,157 INFO L290 TraceCheckUtils]: 142: Hoare triple {205232#(<= ~counter~0 16)} assume true; {205232#(<= ~counter~0 16)} is VALID [2022-04-15 15:24:02,157 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {205232#(<= ~counter~0 16)} {205232#(<= ~counter~0 16)} #96#return; {205232#(<= ~counter~0 16)} is VALID [2022-04-15 15:24:02,158 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-15 15:24:02,159 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-15 15:24:02,159 INFO L290 TraceCheckUtils]: 146: Hoare triple {205257#(<= ~counter~0 17)} assume !!(#t~post7 < 50);havoc #t~post7; {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,160 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-15 15:24:02,160 INFO L290 TraceCheckUtils]: 148: Hoare triple {205257#(<= ~counter~0 17)} ~cond := #in~cond; {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,160 INFO L290 TraceCheckUtils]: 149: Hoare triple {205257#(<= ~counter~0 17)} assume !(0 == ~cond); {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,161 INFO L290 TraceCheckUtils]: 150: Hoare triple {205257#(<= ~counter~0 17)} assume true; {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,161 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {205257#(<= ~counter~0 17)} {205257#(<= ~counter~0 17)} #96#return; {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,162 INFO L290 TraceCheckUtils]: 152: Hoare triple {205257#(<= ~counter~0 17)} assume !(~r~0 > 0); {205257#(<= ~counter~0 17)} is VALID [2022-04-15 15:24:02,163 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-15 15:24:02,163 INFO L290 TraceCheckUtils]: 154: Hoare triple {205282#(<= ~counter~0 18)} assume !!(#t~post8 < 50);havoc #t~post8; {205282#(<= ~counter~0 18)} is VALID [2022-04-15 15:24:02,164 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-15 15:24:02,164 INFO L290 TraceCheckUtils]: 156: Hoare triple {205282#(<= ~counter~0 18)} ~cond := #in~cond; {205282#(<= ~counter~0 18)} is VALID [2022-04-15 15:24:02,165 INFO L290 TraceCheckUtils]: 157: Hoare triple {205282#(<= ~counter~0 18)} assume !(0 == ~cond); {205282#(<= ~counter~0 18)} is VALID [2022-04-15 15:24:02,165 INFO L290 TraceCheckUtils]: 158: Hoare triple {205282#(<= ~counter~0 18)} assume true; {205282#(<= ~counter~0 18)} is VALID [2022-04-15 15:24:02,165 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {205282#(<= ~counter~0 18)} {205282#(<= ~counter~0 18)} #98#return; {205282#(<= ~counter~0 18)} is VALID [2022-04-15 15:24:02,166 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-15 15:24:02,167 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-15 15:24:02,168 INFO L290 TraceCheckUtils]: 162: Hoare triple {205307#(<= ~counter~0 19)} assume !!(#t~post8 < 50);havoc #t~post8; {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,168 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-15 15:24:02,168 INFO L290 TraceCheckUtils]: 164: Hoare triple {205307#(<= ~counter~0 19)} ~cond := #in~cond; {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,169 INFO L290 TraceCheckUtils]: 165: Hoare triple {205307#(<= ~counter~0 19)} assume !(0 == ~cond); {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,169 INFO L290 TraceCheckUtils]: 166: Hoare triple {205307#(<= ~counter~0 19)} assume true; {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,169 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {205307#(<= ~counter~0 19)} {205307#(<= ~counter~0 19)} #98#return; {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,170 INFO L290 TraceCheckUtils]: 168: Hoare triple {205307#(<= ~counter~0 19)} assume !(~r~0 < 0); {205307#(<= ~counter~0 19)} is VALID [2022-04-15 15:24:02,170 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-15 15:24:02,170 INFO L290 TraceCheckUtils]: 170: Hoare triple {205332#(<= |main_#t~post6| 19)} assume !(#t~post6 < 50);havoc #t~post6; {204801#false} is VALID [2022-04-15 15:24:02,170 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-15 15:24:02,170 INFO L290 TraceCheckUtils]: 172: Hoare triple {204801#false} ~cond := #in~cond; {204801#false} is VALID [2022-04-15 15:24:02,170 INFO L290 TraceCheckUtils]: 173: Hoare triple {204801#false} assume 0 == ~cond; {204801#false} is VALID [2022-04-15 15:24:02,171 INFO L290 TraceCheckUtils]: 174: Hoare triple {204801#false} assume !false; {204801#false} is VALID [2022-04-15 15:24:02,171 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-15 15:24:02,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:24:03,341 INFO L290 TraceCheckUtils]: 174: Hoare triple {204801#false} assume !false; {204801#false} is VALID [2022-04-15 15:24:03,341 INFO L290 TraceCheckUtils]: 173: Hoare triple {204801#false} assume 0 == ~cond; {204801#false} is VALID [2022-04-15 15:24:03,341 INFO L290 TraceCheckUtils]: 172: Hoare triple {204801#false} ~cond := #in~cond; {204801#false} is VALID [2022-04-15 15:24:03,341 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-15 15:24:03,341 INFO L290 TraceCheckUtils]: 170: Hoare triple {205360#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {204801#false} is VALID [2022-04-15 15:24:03,342 INFO L290 TraceCheckUtils]: 169: Hoare triple {205364#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205360#(< |main_#t~post6| 50)} is VALID [2022-04-15 15:24:03,342 INFO L290 TraceCheckUtils]: 168: Hoare triple {205364#(< ~counter~0 50)} assume !(~r~0 < 0); {205364#(< ~counter~0 50)} is VALID [2022-04-15 15:24:03,343 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {204800#true} {205364#(< ~counter~0 50)} #98#return; {205364#(< ~counter~0 50)} is VALID [2022-04-15 15:24:03,343 INFO L290 TraceCheckUtils]: 166: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,343 INFO L290 TraceCheckUtils]: 165: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,343 INFO L290 TraceCheckUtils]: 164: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,343 INFO L272 TraceCheckUtils]: 163: Hoare triple {205364#(< ~counter~0 50)} call __VERIFIER_assert((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-15 15:24:03,343 INFO L290 TraceCheckUtils]: 162: Hoare triple {205364#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {205364#(< ~counter~0 50)} is VALID [2022-04-15 15:24:03,347 INFO L290 TraceCheckUtils]: 161: Hoare triple {205389#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205364#(< ~counter~0 50)} is VALID [2022-04-15 15:24:03,347 INFO L290 TraceCheckUtils]: 160: Hoare triple {205389#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205389#(< ~counter~0 49)} is VALID [2022-04-15 15:24:03,348 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {204800#true} {205389#(< ~counter~0 49)} #98#return; {205389#(< ~counter~0 49)} is VALID [2022-04-15 15:24:03,348 INFO L290 TraceCheckUtils]: 158: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,348 INFO L290 TraceCheckUtils]: 157: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,348 INFO L290 TraceCheckUtils]: 156: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,348 INFO L272 TraceCheckUtils]: 155: Hoare triple {205389#(< ~counter~0 49)} call __VERIFIER_assert((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-15 15:24:03,348 INFO L290 TraceCheckUtils]: 154: Hoare triple {205389#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {205389#(< ~counter~0 49)} is VALID [2022-04-15 15:24:03,350 INFO L290 TraceCheckUtils]: 153: Hoare triple {205414#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205389#(< ~counter~0 49)} is VALID [2022-04-15 15:24:03,350 INFO L290 TraceCheckUtils]: 152: Hoare triple {205414#(< ~counter~0 48)} assume !(~r~0 > 0); {205414#(< ~counter~0 48)} is VALID [2022-04-15 15:24:03,351 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {204800#true} {205414#(< ~counter~0 48)} #96#return; {205414#(< ~counter~0 48)} is VALID [2022-04-15 15:24:03,351 INFO L290 TraceCheckUtils]: 150: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,351 INFO L290 TraceCheckUtils]: 149: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,351 INFO L290 TraceCheckUtils]: 148: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,351 INFO L272 TraceCheckUtils]: 147: Hoare triple {205414#(< ~counter~0 48)} call __VERIFIER_assert((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-15 15:24:03,351 INFO L290 TraceCheckUtils]: 146: Hoare triple {205414#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {205414#(< ~counter~0 48)} is VALID [2022-04-15 15:24:03,353 INFO L290 TraceCheckUtils]: 145: Hoare triple {205439#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205414#(< ~counter~0 48)} is VALID [2022-04-15 15:24:03,353 INFO L290 TraceCheckUtils]: 144: Hoare triple {205439#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205439#(< ~counter~0 47)} is VALID [2022-04-15 15:24:03,354 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {204800#true} {205439#(< ~counter~0 47)} #96#return; {205439#(< ~counter~0 47)} is VALID [2022-04-15 15:24:03,354 INFO L290 TraceCheckUtils]: 142: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,354 INFO L290 TraceCheckUtils]: 141: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,354 INFO L290 TraceCheckUtils]: 140: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,354 INFO L272 TraceCheckUtils]: 139: Hoare triple {205439#(< ~counter~0 47)} call __VERIFIER_assert((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-15 15:24:03,354 INFO L290 TraceCheckUtils]: 138: Hoare triple {205439#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {205439#(< ~counter~0 47)} is VALID [2022-04-15 15:24:03,356 INFO L290 TraceCheckUtils]: 137: Hoare triple {205464#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205439#(< ~counter~0 47)} is VALID [2022-04-15 15:24:03,356 INFO L290 TraceCheckUtils]: 136: Hoare triple {205464#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205464#(< ~counter~0 46)} is VALID [2022-04-15 15:24:03,357 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {204800#true} {205464#(< ~counter~0 46)} #96#return; {205464#(< ~counter~0 46)} is VALID [2022-04-15 15:24:03,357 INFO L290 TraceCheckUtils]: 134: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,357 INFO L290 TraceCheckUtils]: 133: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,357 INFO L290 TraceCheckUtils]: 132: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,357 INFO L272 TraceCheckUtils]: 131: Hoare triple {205464#(< ~counter~0 46)} call __VERIFIER_assert((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-15 15:24:03,357 INFO L290 TraceCheckUtils]: 130: Hoare triple {205464#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {205464#(< ~counter~0 46)} is VALID [2022-04-15 15:24:03,359 INFO L290 TraceCheckUtils]: 129: Hoare triple {205489#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205464#(< ~counter~0 46)} is VALID [2022-04-15 15:24:03,359 INFO L290 TraceCheckUtils]: 128: Hoare triple {205489#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205489#(< ~counter~0 45)} is VALID [2022-04-15 15:24:03,360 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {204800#true} {205489#(< ~counter~0 45)} #96#return; {205489#(< ~counter~0 45)} is VALID [2022-04-15 15:24:03,360 INFO L290 TraceCheckUtils]: 126: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,360 INFO L290 TraceCheckUtils]: 125: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,360 INFO L290 TraceCheckUtils]: 124: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,360 INFO L272 TraceCheckUtils]: 123: Hoare triple {205489#(< ~counter~0 45)} call __VERIFIER_assert((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-15 15:24:03,360 INFO L290 TraceCheckUtils]: 122: Hoare triple {205489#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {205489#(< ~counter~0 45)} is VALID [2022-04-15 15:24:03,362 INFO L290 TraceCheckUtils]: 121: Hoare triple {205514#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205489#(< ~counter~0 45)} is VALID [2022-04-15 15:24:03,362 INFO L290 TraceCheckUtils]: 120: Hoare triple {205514#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205514#(< ~counter~0 44)} is VALID [2022-04-15 15:24:03,363 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {204800#true} {205514#(< ~counter~0 44)} #96#return; {205514#(< ~counter~0 44)} is VALID [2022-04-15 15:24:03,363 INFO L290 TraceCheckUtils]: 118: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,363 INFO L290 TraceCheckUtils]: 117: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,363 INFO L272 TraceCheckUtils]: 115: Hoare triple {205514#(< ~counter~0 44)} call __VERIFIER_assert((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-15 15:24:03,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {205514#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {205514#(< ~counter~0 44)} is VALID [2022-04-15 15:24:03,365 INFO L290 TraceCheckUtils]: 113: Hoare triple {205539#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205514#(< ~counter~0 44)} is VALID [2022-04-15 15:24:03,365 INFO L290 TraceCheckUtils]: 112: Hoare triple {205539#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205539#(< ~counter~0 43)} is VALID [2022-04-15 15:24:03,366 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {204800#true} {205539#(< ~counter~0 43)} #96#return; {205539#(< ~counter~0 43)} is VALID [2022-04-15 15:24:03,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,366 INFO L272 TraceCheckUtils]: 107: Hoare triple {205539#(< ~counter~0 43)} call __VERIFIER_assert((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-15 15:24:03,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {205539#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {205539#(< ~counter~0 43)} is VALID [2022-04-15 15:24:03,368 INFO L290 TraceCheckUtils]: 105: Hoare triple {205564#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205539#(< ~counter~0 43)} is VALID [2022-04-15 15:24:03,368 INFO L290 TraceCheckUtils]: 104: Hoare triple {205564#(< ~counter~0 42)} assume !!(0 != ~r~0); {205564#(< ~counter~0 42)} is VALID [2022-04-15 15:24:03,369 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {204800#true} {205564#(< ~counter~0 42)} #94#return; {205564#(< ~counter~0 42)} is VALID [2022-04-15 15:24:03,369 INFO L290 TraceCheckUtils]: 102: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,369 INFO L290 TraceCheckUtils]: 101: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,369 INFO L290 TraceCheckUtils]: 100: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,369 INFO L272 TraceCheckUtils]: 99: Hoare triple {205564#(< ~counter~0 42)} call __VERIFIER_assert((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-15 15:24:03,369 INFO L290 TraceCheckUtils]: 98: Hoare triple {205564#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {205564#(< ~counter~0 42)} is VALID [2022-04-15 15:24:03,371 INFO L290 TraceCheckUtils]: 97: Hoare triple {205589#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205564#(< ~counter~0 42)} is VALID [2022-04-15 15:24:03,371 INFO L290 TraceCheckUtils]: 96: Hoare triple {205589#(< ~counter~0 41)} assume !(~r~0 < 0); {205589#(< ~counter~0 41)} is VALID [2022-04-15 15:24:03,371 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {204800#true} {205589#(< ~counter~0 41)} #98#return; {205589#(< ~counter~0 41)} is VALID [2022-04-15 15:24:03,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,372 INFO L272 TraceCheckUtils]: 91: Hoare triple {205589#(< ~counter~0 41)} call __VERIFIER_assert((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-15 15:24:03,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {205589#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {205589#(< ~counter~0 41)} is VALID [2022-04-15 15:24:03,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {205614#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205589#(< ~counter~0 41)} is VALID [2022-04-15 15:24:03,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {205614#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205614#(< ~counter~0 40)} is VALID [2022-04-15 15:24:03,375 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {204800#true} {205614#(< ~counter~0 40)} #98#return; {205614#(< ~counter~0 40)} is VALID [2022-04-15 15:24:03,375 INFO L290 TraceCheckUtils]: 86: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,375 INFO L290 TraceCheckUtils]: 85: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,375 INFO L290 TraceCheckUtils]: 84: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,375 INFO L272 TraceCheckUtils]: 83: Hoare triple {205614#(< ~counter~0 40)} call __VERIFIER_assert((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-15 15:24:03,375 INFO L290 TraceCheckUtils]: 82: Hoare triple {205614#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {205614#(< ~counter~0 40)} is VALID [2022-04-15 15:24:03,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {205639#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205614#(< ~counter~0 40)} is VALID [2022-04-15 15:24:03,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {205639#(< ~counter~0 39)} assume !(~r~0 > 0); {205639#(< ~counter~0 39)} is VALID [2022-04-15 15:24:03,378 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {204800#true} {205639#(< ~counter~0 39)} #96#return; {205639#(< ~counter~0 39)} is VALID [2022-04-15 15:24:03,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,378 INFO L272 TraceCheckUtils]: 75: Hoare triple {205639#(< ~counter~0 39)} call __VERIFIER_assert((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-15 15:24:03,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {205639#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {205639#(< ~counter~0 39)} is VALID [2022-04-15 15:24:03,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {205664#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205639#(< ~counter~0 39)} is VALID [2022-04-15 15:24:03,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {205664#(< ~counter~0 38)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205664#(< ~counter~0 38)} is VALID [2022-04-15 15:24:03,381 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {204800#true} {205664#(< ~counter~0 38)} #96#return; {205664#(< ~counter~0 38)} is VALID [2022-04-15 15:24:03,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,381 INFO L272 TraceCheckUtils]: 67: Hoare triple {205664#(< ~counter~0 38)} call __VERIFIER_assert((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-15 15:24:03,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {205664#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {205664#(< ~counter~0 38)} is VALID [2022-04-15 15:24:03,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {205689#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205664#(< ~counter~0 38)} is VALID [2022-04-15 15:24:03,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {205689#(< ~counter~0 37)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {205689#(< ~counter~0 37)} is VALID [2022-04-15 15:24:03,383 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {204800#true} {205689#(< ~counter~0 37)} #96#return; {205689#(< ~counter~0 37)} is VALID [2022-04-15 15:24:03,384 INFO L290 TraceCheckUtils]: 62: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,384 INFO L272 TraceCheckUtils]: 59: Hoare triple {205689#(< ~counter~0 37)} call __VERIFIER_assert((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-15 15:24:03,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {205689#(< ~counter~0 37)} assume !!(#t~post7 < 50);havoc #t~post7; {205689#(< ~counter~0 37)} is VALID [2022-04-15 15:24:03,386 INFO L290 TraceCheckUtils]: 57: Hoare triple {205714#(< ~counter~0 36)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205689#(< ~counter~0 37)} is VALID [2022-04-15 15:24:03,386 INFO L290 TraceCheckUtils]: 56: Hoare triple {205714#(< ~counter~0 36)} assume !!(0 != ~r~0); {205714#(< ~counter~0 36)} is VALID [2022-04-15 15:24:03,386 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {204800#true} {205714#(< ~counter~0 36)} #94#return; {205714#(< ~counter~0 36)} is VALID [2022-04-15 15:24:03,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,387 INFO L272 TraceCheckUtils]: 51: Hoare triple {205714#(< ~counter~0 36)} call __VERIFIER_assert((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-15 15:24:03,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {205714#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {205714#(< ~counter~0 36)} is VALID [2022-04-15 15:24:03,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {205739#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205714#(< ~counter~0 36)} is VALID [2022-04-15 15:24:03,389 INFO L290 TraceCheckUtils]: 48: Hoare triple {205739#(< ~counter~0 35)} assume !(~r~0 < 0); {205739#(< ~counter~0 35)} is VALID [2022-04-15 15:24:03,389 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {204800#true} {205739#(< ~counter~0 35)} #98#return; {205739#(< ~counter~0 35)} is VALID [2022-04-15 15:24:03,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,390 INFO L272 TraceCheckUtils]: 43: Hoare triple {205739#(< ~counter~0 35)} call __VERIFIER_assert((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-15 15:24:03,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {205739#(< ~counter~0 35)} assume !!(#t~post8 < 50);havoc #t~post8; {205739#(< ~counter~0 35)} is VALID [2022-04-15 15:24:03,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {205764#(< ~counter~0 34)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205739#(< ~counter~0 35)} is VALID [2022-04-15 15:24:03,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {205764#(< ~counter~0 34)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {205764#(< ~counter~0 34)} is VALID [2022-04-15 15:24:03,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {204800#true} {205764#(< ~counter~0 34)} #98#return; {205764#(< ~counter~0 34)} is VALID [2022-04-15 15:24:03,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,393 INFO L272 TraceCheckUtils]: 35: Hoare triple {205764#(< ~counter~0 34)} call __VERIFIER_assert((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-15 15:24:03,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {205764#(< ~counter~0 34)} assume !!(#t~post8 < 50);havoc #t~post8; {205764#(< ~counter~0 34)} is VALID [2022-04-15 15:24:03,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {205789#(< ~counter~0 33)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {205764#(< ~counter~0 34)} is VALID [2022-04-15 15:24:03,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {205789#(< ~counter~0 33)} assume !(~r~0 > 0); {205789#(< ~counter~0 33)} is VALID [2022-04-15 15:24:03,395 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {204800#true} {205789#(< ~counter~0 33)} #96#return; {205789#(< ~counter~0 33)} is VALID [2022-04-15 15:24:03,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,396 INFO L272 TraceCheckUtils]: 27: Hoare triple {205789#(< ~counter~0 33)} call __VERIFIER_assert((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-15 15:24:03,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {205789#(< ~counter~0 33)} assume !!(#t~post7 < 50);havoc #t~post7; {205789#(< ~counter~0 33)} is VALID [2022-04-15 15:24:03,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {205814#(< ~counter~0 32)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {205789#(< ~counter~0 33)} is VALID [2022-04-15 15:24:03,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {205814#(< ~counter~0 32)} assume !!(0 != ~r~0); {205814#(< ~counter~0 32)} is VALID [2022-04-15 15:24:03,398 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {204800#true} {205814#(< ~counter~0 32)} #94#return; {205814#(< ~counter~0 32)} is VALID [2022-04-15 15:24:03,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {205814#(< ~counter~0 32)} call __VERIFIER_assert((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-15 15:24:03,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {205814#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {205814#(< ~counter~0 32)} is VALID [2022-04-15 15:24:03,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {205839#(< ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205814#(< ~counter~0 32)} is VALID [2022-04-15 15:24:03,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {205839#(< ~counter~0 31)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,401 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {204800#true} {205839#(< ~counter~0 31)} #92#return; {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {205839#(< ~counter~0 31)} call assume_abort_if_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-15 15:24:03,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204800#true} {205839#(< ~counter~0 31)} #90#return; {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {204800#true} assume true; {204800#true} is VALID [2022-04-15 15:24:03,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {204800#true} assume !(0 == ~cond); {204800#true} is VALID [2022-04-15 15:24:03,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {204800#true} ~cond := #in~cond; {204800#true} is VALID [2022-04-15 15:24:03,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {205839#(< ~counter~0 31)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {204800#true} is VALID [2022-04-15 15:24:03,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {205839#(< ~counter~0 31)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #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 31)} is VALID [2022-04-15 15:24:03,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {205839#(< ~counter~0 31)} call #t~ret9 := main(); {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205839#(< ~counter~0 31)} {204800#true} #102#return; {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {205839#(< ~counter~0 31)} assume true; {205839#(< ~counter~0 31)} is VALID [2022-04-15 15:24:03,404 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 31)} is VALID [2022-04-15 15:24:03,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {204800#true} call ULTIMATE.init(); {204800#true} is VALID [2022-04-15 15:24:03,404 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-15 15:24:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:24:03,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990409287] [2022-04-15 15:24:03,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:24:03,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20513631] [2022-04-15 15:24:03,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20513631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:24:03,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:24:03,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-15 15:24:03,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:24:03,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656808059] [2022-04-15 15:24:03,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656808059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:24:03,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:24:03,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 15:24:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412297167] [2022-04-15 15:24:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:24:03,405 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-15 15:24:03,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:24:03,406 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-15 15:24:03,663 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-15 15:24:03,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 15:24:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:24:03,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 15:24:03,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 15:24:03,664 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-15 15:24:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:24:10,654 INFO L93 Difference]: Finished difference Result 1014 states and 1347 transitions. [2022-04-15 15:24:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 15:24:10,654 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-15 15:24:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:24:10,655 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-15 15:24:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-15 15:24:10,657 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-15 15:24:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-15 15:24:10,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 394 transitions. [2022-04-15 15:24:11,251 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-15 15:24:11,294 INFO L225 Difference]: With dead ends: 1014 [2022-04-15 15:24:11,294 INFO L226 Difference]: Without dead ends: 1009 [2022-04-15 15:24:11,295 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-15 15:24:11,295 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-15 15:24:11,296 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-15 15:24:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2022-04-15 15:24:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 987. [2022-04-15 15:24:15,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:24:15,344 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-15 15:24:15,344 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-15 15:24:15,345 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-15 15:24:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:24:15,374 INFO L93 Difference]: Finished difference Result 1009 states and 1341 transitions. [2022-04-15 15:24:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1341 transitions. [2022-04-15 15:24:15,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:24:15,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:24:15,376 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-15 15:24:15,376 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-15 15:24:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:24:15,405 INFO L93 Difference]: Finished difference Result 1009 states and 1341 transitions. [2022-04-15 15:24:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1341 transitions. [2022-04-15 15:24:15,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:24:15,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:24:15,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:24:15,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:24:15,407 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-15 15:24:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1315 transitions. [2022-04-15 15:24:15,448 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1315 transitions. Word has length 175 [2022-04-15 15:24:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:24:15,449 INFO L478 AbstractCegarLoop]: Abstraction has 987 states and 1315 transitions. [2022-04-15 15:24:15,449 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-15 15:24:15,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 987 states and 1315 transitions. [2022-04-15 15:24:24,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1315 edges. 1314 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:24:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1315 transitions. [2022-04-15 15:24:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-15 15:24:24,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:24:24,848 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-15 15:24:24,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-15 15:24:25,049 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-15 15:24:25,049 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:24:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:24:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -743527641, now seen corresponding path program 33 times [2022-04-15 15:24:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:24:25,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012240758] [2022-04-15 15:24:25,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:24:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -743527641, now seen corresponding path program 34 times [2022-04-15 15:24:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:24:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306348287] [2022-04-15 15:24:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:24:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:24:25,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:24:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840129398] [2022-04-15 15:24:25,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:24:25,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:24:25,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:24:25,067 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-15 15:24:25,097 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-15 15:24:25,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:24:25,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:24:25,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 15:24:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:24:25,234 INFO L286 TraceCheckSpWp]: Computing forward predicates...